./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 13:03:40,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 13:03:40,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 13:03:40,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 13:03:40,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 13:03:40,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 13:03:40,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 13:03:40,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 13:03:40,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 13:03:40,316 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 13:03:40,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 13:03:40,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 13:03:40,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 13:03:40,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 13:03:40,318 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 13:03:40,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 13:03:40,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 13:03:40,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 13:03:40,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 13:03:40,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 13:03:40,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 13:03:40,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 13:03:40,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 13:03:40,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 13:03:40,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 13:03:40,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 13:03:40,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 13:03:40,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 13:03:40,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 13:03:40,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 13:03:40,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 13:03:40,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 13:03:40,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 13:03:40,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 13:03:40,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 13:03:40,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 13:03:40,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 13:03:40,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 13:03:40,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 13:03:40,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 13:03:40,331 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 13:03:40,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 13:03:40,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 13:03:40,332 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 13:03:40,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 13:03:40,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 13:03:40,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 13:03:40,574 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 13:03:40,575 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 13:03:40,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-14 13:03:40,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 13:03:40,717 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 13:03:40,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-06-14 13:03:41,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 13:03:42,090 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 13:03:42,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-06-14 13:03:42,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89afb874f/064ec2bc7fd74d328599894a786d0e76/FLAGc0fe8f574 [2024-06-14 13:03:42,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89afb874f/064ec2bc7fd74d328599894a786d0e76 [2024-06-14 13:03:42,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 13:03:42,114 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 13:03:42,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 13:03:42,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 13:03:42,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 13:03:42,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:03:40" (1/2) ... [2024-06-14 13:03:42,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5b1fa8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 01:03:42, skipping insertion in model container [2024-06-14 13:03:42,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:03:40" (1/2) ... [2024-06-14 13:03:42,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7776a217 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 01:03:42, skipping insertion in model container [2024-06-14 13:03:42,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 01:03:42" (2/2) ... [2024-06-14 13:03:42,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5b1fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42, skipping insertion in model container [2024-06-14 13:03:42,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 01:03:42" (2/2) ... [2024-06-14 13:03:42,123 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 13:03:42,190 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 13:03:42,190 INFO L97 edCorrectnessWitness]: Location invariant before [L821-L821] ((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= z$mem_tmp && z$mem_tmp <= 2) && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1))) [2024-06-14 13:03:42,191 INFO L97 edCorrectnessWitness]: Location invariant before [L824-L824] ((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= z$mem_tmp && z$mem_tmp <= 2) && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1))) [2024-06-14 13:03:42,191 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= z$mem_tmp && z$mem_tmp <= 2) && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1))) [2024-06-14 13:03:42,191 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 13:03:42,191 INFO L106 edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1; [2024-06-14 13:03:42,232 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 13:03:42,565 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 13:03:42,575 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 13:03:42,662 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 13:03:42,689 INFO L206 MainTranslator]: Completed translation [2024-06-14 13:03:42,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42 WrapperNode [2024-06-14 13:03:42,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 13:03:42,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 13:03:42,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 13:03:42,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 13:03:42,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,761 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2024-06-14 13:03:42,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 13:03:42,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 13:03:42,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 13:03:42,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 13:03:42,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,803 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-14 13:03:42,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 13:03:42,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 13:03:42,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 13:03:42,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 13:03:42,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (1/1) ... [2024-06-14 13:03:42,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 13:03:42,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 13:03:42,859 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-14 13:03:42,922 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-14 13:03:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 13:03:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 13:03:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 13:03:42,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 13:03:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 13:03:42,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 13:03:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 13:03:42,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 13:03:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 13:03:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 13:03:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 13:03:42,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 13:03:42,968 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 13:03:43,106 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 13:03:43,108 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 13:03:43,367 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 13:03:43,367 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 13:03:43,469 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 13:03:43,469 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 13:03:43,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 01:03:43 BoogieIcfgContainer [2024-06-14 13:03:43,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 13:03:43,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 13:03:43,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 13:03:43,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 13:03:43,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:03:40" (1/4) ... [2024-06-14 13:03:43,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c7888e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 01:03:43, skipping insertion in model container [2024-06-14 13:03:43,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 01:03:42" (2/4) ... [2024-06-14 13:03:43,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c7888e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 01:03:43, skipping insertion in model container [2024-06-14 13:03:43,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:03:42" (3/4) ... [2024-06-14 13:03:43,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c7888e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 01:03:43, skipping insertion in model container [2024-06-14 13:03:43,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 01:03:43" (4/4) ... [2024-06-14 13:03:43,475 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-06-14 13:03:43,488 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 13:03:43,488 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 13:03:43,488 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 13:03:43,570 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 13:03:43,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 13:03:43,617 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-14 13:03:43,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 13:03:43,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 13:03:43,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 13:03:43,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-14 13:03:43,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 13:03:43,632 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;@7e033fdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 13:03:43,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 13:03:43,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 13:03:43,636 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 13:03:43,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 13:03:43,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:43,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 13:03:43,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:43,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1456369184, now seen corresponding path program 1 times [2024-06-14 13:03:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:43,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008066582] [2024-06-14 13:03:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:44,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:44,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008066582] [2024-06-14 13:03:44,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008066582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:44,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:44,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 13:03:44,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533566650] [2024-06-14 13:03:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:44,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 13:03:44,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:44,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 13:03:44,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 13:03:44,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 13:03:44,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:44,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:44,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 13:03:44,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:44,944 INFO L124 PetriNetUnfolderBase]: 1407/2119 cut-off events. [2024-06-14 13:03:44,945 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-14 13:03:44,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4325 conditions, 2119 events. 1407/2119 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9680 event pairs, 989 based on Foata normal form. 1/2076 useless extension candidates. Maximal degree in co-relation 4310. Up to 2105 conditions per place. [2024-06-14 13:03:44,959 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 34 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-14 13:03:44,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 175 flow [2024-06-14 13:03:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 13:03:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 13:03:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-06-14 13:03:44,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2024-06-14 13:03:44,969 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 68 transitions. [2024-06-14 13:03:44,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 175 flow [2024-06-14 13:03:44,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 13:03:44,973 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-14 13:03:44,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-14 13:03:44,977 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-14 13:03:44,977 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-14 13:03:44,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:44,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:44,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:44,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 13:03:44,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:44,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash 588573823, now seen corresponding path program 1 times [2024-06-14 13:03:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:44,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775555251] [2024-06-14 13:03:44,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:45,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-14 13:03:45,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:45,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775555251] [2024-06-14 13:03:45,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775555251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:45,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:45,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 13:03:45,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844003373] [2024-06-14 13:03:45,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:45,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:03:45,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:45,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:03:45,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:03:45,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 13:03:45,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:45,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:45,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 13:03:45,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:45,779 INFO L124 PetriNetUnfolderBase]: 1401/2110 cut-off events. [2024-06-14 13:03:45,780 INFO L125 PetriNetUnfolderBase]: For 403/411 co-relation queries the response was YES. [2024-06-14 13:03:45,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 2110 events. 1401/2110 cut-off events. For 403/411 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9515 event pairs, 864 based on Foata normal form. 6/2113 useless extension candidates. Maximal degree in co-relation 4854. Up to 2081 conditions per place. [2024-06-14 13:03:45,790 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-14 13:03:45,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 242 flow [2024-06-14 13:03:45,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 13:03:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 13:03:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-06-14 13:03:45,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304878048780488 [2024-06-14 13:03:45,792 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 87 transitions. [2024-06-14 13:03:45,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 242 flow [2024-06-14 13:03:45,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 13:03:45,794 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-14 13:03:45,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-14 13:03:45,794 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-14 13:03:45,795 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-14 13:03:45,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:45,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:45,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:45,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 13:03:45,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:45,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:45,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1065920051, now seen corresponding path program 1 times [2024-06-14 13:03:45,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:45,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332074056] [2024-06-14 13:03:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:45,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:46,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-14 13:03:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332074056] [2024-06-14 13:03:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332074056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:46,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:46,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:03:46,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021243208] [2024-06-14 13:03:46,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:46,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 13:03:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:46,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 13:03:46,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 13:03:46,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 13:03:46,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:46,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:46,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 13:03:46,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:46,763 INFO L124 PetriNetUnfolderBase]: 1409/2124 cut-off events. [2024-06-14 13:03:46,764 INFO L125 PetriNetUnfolderBase]: For 1116/1122 co-relation queries the response was YES. [2024-06-14 13:03:46,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 2124 events. 1409/2124 cut-off events. For 1116/1122 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9556 event pairs, 673 based on Foata normal form. 9/2127 useless extension candidates. Maximal degree in co-relation 5431. Up to 2027 conditions per place. [2024-06-14 13:03:46,777 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 54 selfloop transitions, 16 changer transitions 0/74 dead transitions. [2024-06-14 13:03:46,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 396 flow [2024-06-14 13:03:46,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:03:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:03:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-14 13:03:46,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5560975609756098 [2024-06-14 13:03:46,779 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 114 transitions. [2024-06-14 13:03:46,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 396 flow [2024-06-14 13:03:46,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 382 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 13:03:46,782 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 235 flow [2024-06-14 13:03:46,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-06-14 13:03:46,782 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-14 13:03:46,783 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 235 flow [2024-06-14 13:03:46,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:46,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:46,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:46,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 13:03:46,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:46,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1316216034, now seen corresponding path program 1 times [2024-06-14 13:03:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547059457] [2024-06-14 13:03:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:46,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:47,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:47,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547059457] [2024-06-14 13:03:47,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547059457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:47,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:47,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:03:47,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147787067] [2024-06-14 13:03:47,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:47,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 13:03:47,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:47,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 13:03:47,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 13:03:47,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 13:03:47,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:47,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:47,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 13:03:47,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:47,900 INFO L124 PetriNetUnfolderBase]: 1461/2198 cut-off events. [2024-06-14 13:03:47,900 INFO L125 PetriNetUnfolderBase]: For 2704/2723 co-relation queries the response was YES. [2024-06-14 13:03:47,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6607 conditions, 2198 events. 1461/2198 cut-off events. For 2704/2723 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9922 event pairs, 550 based on Foata normal form. 17/2209 useless extension candidates. Maximal degree in co-relation 6587. Up to 1944 conditions per place. [2024-06-14 13:03:47,913 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 73 selfloop transitions, 27 changer transitions 0/104 dead transitions. [2024-06-14 13:03:47,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 104 transitions, 641 flow [2024-06-14 13:03:47,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:03:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:03:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-06-14 13:03:47,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813008130081301 [2024-06-14 13:03:47,915 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 235 flow. Second operand 6 states and 143 transitions. [2024-06-14 13:03:47,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 104 transitions, 641 flow [2024-06-14 13:03:47,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 633 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-14 13:03:47,920 INFO L231 Difference]: Finished difference. Result has 59 places, 65 transitions, 412 flow [2024-06-14 13:03:47,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=59, PETRI_TRANSITIONS=65} [2024-06-14 13:03:47,921 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-06-14 13:03:47,921 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 65 transitions, 412 flow [2024-06-14 13:03:47,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:47,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:47,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:47,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 13:03:47,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:47,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:47,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2146976690, now seen corresponding path program 1 times [2024-06-14 13:03:47,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:47,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924061841] [2024-06-14 13:03:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:47,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03: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-14 13:03:48,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:48,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924061841] [2024-06-14 13:03:48,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924061841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:48,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:48,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 13:03:48,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201930347] [2024-06-14 13:03:48,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:48,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:03:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:48,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:03:48,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:03:48,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 13:03:48,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 65 transitions, 412 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:48,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:48,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 13:03:48,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:49,354 INFO L124 PetriNetUnfolderBase]: 1473/2218 cut-off events. [2024-06-14 13:03:49,354 INFO L125 PetriNetUnfolderBase]: For 5341/5360 co-relation queries the response was YES. [2024-06-14 13:03:49,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8112 conditions, 2218 events. 1473/2218 cut-off events. For 5341/5360 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10007 event pairs, 415 based on Foata normal form. 18/2230 useless extension candidates. Maximal degree in co-relation 8086. Up to 2043 conditions per place. [2024-06-14 13:03:49,369 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 80 selfloop transitions, 23 changer transitions 0/107 dead transitions. [2024-06-14 13:03:49,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 107 transitions, 783 flow [2024-06-14 13:03:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:03:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:03:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-14 13:03:49,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5226480836236934 [2024-06-14 13:03:49,371 INFO L175 Difference]: Start difference. First operand has 59 places, 65 transitions, 412 flow. Second operand 7 states and 150 transitions. [2024-06-14 13:03:49,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 107 transitions, 783 flow [2024-06-14 13:03:49,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 757 flow, removed 13 selfloop flow, removed 0 redundant places. [2024-06-14 13:03:49,378 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 498 flow [2024-06-14 13:03:49,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=498, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2024-06-14 13:03:49,379 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-14 13:03:49,379 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 498 flow [2024-06-14 13:03:49,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:49,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:49,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:49,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 13:03:49,380 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:49,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1906059420, now seen corresponding path program 1 times [2024-06-14 13:03:49,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:49,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552404621] [2024-06-14 13:03:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:49,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:49,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552404621] [2024-06-14 13:03:49,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552404621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:49,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:49,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:03:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301638734] [2024-06-14 13:03:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:49,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 13:03:49,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:49,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 13:03:49,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 13:03:50,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 13:03:50,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:50,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:50,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 13:03:50,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:50,377 INFO L124 PetriNetUnfolderBase]: 1468/2209 cut-off events. [2024-06-14 13:03:50,377 INFO L125 PetriNetUnfolderBase]: For 6404/6419 co-relation queries the response was YES. [2024-06-14 13:03:50,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8513 conditions, 2209 events. 1468/2209 cut-off events. For 6404/6419 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9988 event pairs, 550 based on Foata normal form. 11/2217 useless extension candidates. Maximal degree in co-relation 8483. Up to 2186 conditions per place. [2024-06-14 13:03:50,392 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 69 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2024-06-14 13:03:50,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 680 flow [2024-06-14 13:03:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:03:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:03:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-14 13:03:50,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-14 13:03:50,394 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 498 flow. Second operand 5 states and 86 transitions. [2024-06-14 13:03:50,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 680 flow [2024-06-14 13:03:50,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 619 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-14 13:03:50,399 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 461 flow [2024-06-14 13:03:50,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2024-06-14 13:03:50,400 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-14 13:03:50,400 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 461 flow [2024-06-14 13:03:50,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:50,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:50,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:50,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 13:03:50,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:50,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1042966956, now seen corresponding path program 1 times [2024-06-14 13:03:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:50,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519600031] [2024-06-14 13:03:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:50,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:50,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519600031] [2024-06-14 13:03:50,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519600031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:50,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:50,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 13:03:50,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529191282] [2024-06-14 13:03:50,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:50,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:03:50,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:50,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:03:50,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:03:51,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:03:51,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 461 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:51,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:51,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:03:51,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:51,583 INFO L124 PetriNetUnfolderBase]: 1715/2564 cut-off events. [2024-06-14 13:03:51,583 INFO L125 PetriNetUnfolderBase]: For 8228/8228 co-relation queries the response was YES. [2024-06-14 13:03:51,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9668 conditions, 2564 events. 1715/2564 cut-off events. For 8228/8228 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11720 event pairs, 657 based on Foata normal form. 4/2566 useless extension candidates. Maximal degree in co-relation 9636. Up to 2524 conditions per place. [2024-06-14 13:03:51,596 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 81 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2024-06-14 13:03:51,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 95 transitions, 748 flow [2024-06-14 13:03:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:03:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:03:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-14 13:03:51,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-06-14 13:03:51,597 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 461 flow. Second operand 6 states and 97 transitions. [2024-06-14 13:03:51,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 95 transitions, 748 flow [2024-06-14 13:03:51,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 716 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 13:03:51,604 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 544 flow [2024-06-14 13:03:51,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2024-06-14 13:03:51,605 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2024-06-14 13:03:51,605 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 544 flow [2024-06-14 13:03:51,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:51,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:51,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:51,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 13:03:51,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:51,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2027549125, now seen corresponding path program 1 times [2024-06-14 13:03:51,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:51,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061968829] [2024-06-14 13:03:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:51,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:52,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:52,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061968829] [2024-06-14 13:03:52,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061968829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:52,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:52,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 13:03:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276938742] [2024-06-14 13:03:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:52,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:03:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:03:52,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:03:52,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 13:03:52,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 544 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:52,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:52,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 13:03:52,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:52,737 INFO L124 PetriNetUnfolderBase]: 1622/2437 cut-off events. [2024-06-14 13:03:52,737 INFO L125 PetriNetUnfolderBase]: For 10115/10181 co-relation queries the response was YES. [2024-06-14 13:03:52,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10008 conditions, 2437 events. 1622/2437 cut-off events. For 10115/10181 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11155 event pairs, 593 based on Foata normal form. 26/2446 useless extension candidates. Maximal degree in co-relation 9974. Up to 2322 conditions per place. [2024-06-14 13:03:52,754 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 73 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2024-06-14 13:03:52,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 841 flow [2024-06-14 13:03:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:03:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:03:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-14 13:03:52,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-14 13:03:52,757 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 544 flow. Second operand 6 states and 110 transitions. [2024-06-14 13:03:52,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 841 flow [2024-06-14 13:03:52,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 102 transitions, 835 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-14 13:03:52,771 INFO L231 Difference]: Finished difference. Result has 76 places, 82 transitions, 623 flow [2024-06-14 13:03:52,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=623, PETRI_PLACES=76, PETRI_TRANSITIONS=82} [2024-06-14 13:03:52,775 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2024-06-14 13:03:52,775 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 623 flow [2024-06-14 13:03:52,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:52,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:52,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:52,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 13:03:52,776 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:52,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash -767578745, now seen corresponding path program 2 times [2024-06-14 13:03:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:52,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510241686] [2024-06-14 13:03:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:52,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:53,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510241686] [2024-06-14 13:03:53,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510241686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:53,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:53,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 13:03:53,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614572975] [2024-06-14 13:03:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:53,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:03:53,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:53,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:03:53,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:03:53,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 13:03:53,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 623 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:53,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:53,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 13:03:53,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:53,909 INFO L124 PetriNetUnfolderBase]: 1605/2409 cut-off events. [2024-06-14 13:03:53,909 INFO L125 PetriNetUnfolderBase]: For 11677/11755 co-relation queries the response was YES. [2024-06-14 13:03:53,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10183 conditions, 2409 events. 1605/2409 cut-off events. For 11677/11755 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10992 event pairs, 589 based on Foata normal form. 6/2402 useless extension candidates. Maximal degree in co-relation 10146. Up to 2363 conditions per place. [2024-06-14 13:03:53,922 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 75 selfloop transitions, 15 changer transitions 0/97 dead transitions. [2024-06-14 13:03:53,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 97 transitions, 841 flow [2024-06-14 13:03:53,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:03:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:03:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-14 13:03:53,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-14 13:03:53,924 INFO L175 Difference]: Start difference. First operand has 76 places, 82 transitions, 623 flow. Second operand 6 states and 101 transitions. [2024-06-14 13:03:53,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 97 transitions, 841 flow [2024-06-14 13:03:53,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 97 transitions, 808 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 13:03:53,934 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 629 flow [2024-06-14 13:03:53,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=629, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2024-06-14 13:03:53,934 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-14 13:03:53,935 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 629 flow [2024-06-14 13:03:53,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:53,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:53,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:53,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 13:03:53,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:53,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash 739556529, now seen corresponding path program 1 times [2024-06-14 13:03:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:53,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622061477] [2024-06-14 13:03:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:54,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:54,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622061477] [2024-06-14 13:03:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622061477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:54,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:03:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229101833] [2024-06-14 13:03:54,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:54,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:03:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:54,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:03:54,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:03:54,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:03:54,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 629 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:54,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:54,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:03:54,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:55,232 INFO L124 PetriNetUnfolderBase]: 1774/2647 cut-off events. [2024-06-14 13:03:55,232 INFO L125 PetriNetUnfolderBase]: For 14023/14025 co-relation queries the response was YES. [2024-06-14 13:03:55,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11059 conditions, 2647 events. 1774/2647 cut-off events. For 14023/14025 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12027 event pairs, 566 based on Foata normal form. 8/2653 useless extension candidates. Maximal degree in co-relation 11021. Up to 2431 conditions per place. [2024-06-14 13:03:55,251 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 104 selfloop transitions, 23 changer transitions 0/130 dead transitions. [2024-06-14 13:03:55,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 130 transitions, 1154 flow [2024-06-14 13:03:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:03:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:03:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-14 13:03:55,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-14 13:03:55,253 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 629 flow. Second operand 7 states and 124 transitions. [2024-06-14 13:03:55,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 130 transitions, 1154 flow [2024-06-14 13:03:55,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 130 transitions, 1077 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 13:03:55,266 INFO L231 Difference]: Finished difference. Result has 83 places, 99 transitions, 784 flow [2024-06-14 13:03:55,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=784, PETRI_PLACES=83, PETRI_TRANSITIONS=99} [2024-06-14 13:03:55,266 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2024-06-14 13:03:55,267 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 99 transitions, 784 flow [2024-06-14 13:03:55,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:55,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:55,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:55,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 13:03:55,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:55,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash -311940057, now seen corresponding path program 2 times [2024-06-14 13:03:55,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:55,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421129150] [2024-06-14 13:03:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:55,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:55,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:55,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421129150] [2024-06-14 13:03:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421129150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:55,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:03:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162172987] [2024-06-14 13:03:55,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:55,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:03:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:03:55,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:03:56,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:03:56,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 99 transitions, 784 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:56,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:56,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:03:56,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:56,505 INFO L124 PetriNetUnfolderBase]: 1796/2678 cut-off events. [2024-06-14 13:03:56,506 INFO L125 PetriNetUnfolderBase]: For 16705/16705 co-relation queries the response was YES. [2024-06-14 13:03:56,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12199 conditions, 2678 events. 1796/2678 cut-off events. For 16705/16705 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12119 event pairs, 592 based on Foata normal form. 4/2680 useless extension candidates. Maximal degree in co-relation 12157. Up to 2596 conditions per place. [2024-06-14 13:03:56,527 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 109 selfloop transitions, 18 changer transitions 0/130 dead transitions. [2024-06-14 13:03:56,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 1202 flow [2024-06-14 13:03:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:03:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:03:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-14 13:03:56,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-14 13:03:56,529 INFO L175 Difference]: Start difference. First operand has 83 places, 99 transitions, 784 flow. Second operand 7 states and 116 transitions. [2024-06-14 13:03:56,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 1202 flow [2024-06-14 13:03:56,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 130 transitions, 1180 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-14 13:03:56,543 INFO L231 Difference]: Finished difference. Result has 90 places, 107 transitions, 887 flow [2024-06-14 13:03:56,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=887, PETRI_PLACES=90, PETRI_TRANSITIONS=107} [2024-06-14 13:03:56,543 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-14 13:03:56,544 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 107 transitions, 887 flow [2024-06-14 13:03:56,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:56,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:56,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:56,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 13:03:56,544 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:56,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1563818637, now seen corresponding path program 3 times [2024-06-14 13:03:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:56,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847683966] [2024-06-14 13:03:56,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:57,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:57,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847683966] [2024-06-14 13:03:57,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847683966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:57,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:57,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:03:57,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545966914] [2024-06-14 13:03:57,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:57,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:03:57,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:57,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:03:57,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:03:57,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:03:57,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 107 transitions, 887 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:57,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:57,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:03:57,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:57,730 INFO L124 PetriNetUnfolderBase]: 1786/2664 cut-off events. [2024-06-14 13:03:57,731 INFO L125 PetriNetUnfolderBase]: For 19347/19347 co-relation queries the response was YES. [2024-06-14 13:03:57,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12498 conditions, 2664 events. 1786/2664 cut-off events. For 19347/19347 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12013 event pairs, 590 based on Foata normal form. 4/2666 useless extension candidates. Maximal degree in co-relation 12452. Up to 2615 conditions per place. [2024-06-14 13:03:57,748 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 111 selfloop transitions, 14 changer transitions 0/128 dead transitions. [2024-06-14 13:03:57,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 128 transitions, 1197 flow [2024-06-14 13:03:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:03:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:03:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-14 13:03:57,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-14 13:03:57,750 INFO L175 Difference]: Start difference. First operand has 90 places, 107 transitions, 887 flow. Second operand 7 states and 111 transitions. [2024-06-14 13:03:57,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 128 transitions, 1197 flow [2024-06-14 13:03:57,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 128 transitions, 1169 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 13:03:57,770 INFO L231 Difference]: Finished difference. Result has 94 places, 108 transitions, 905 flow [2024-06-14 13:03:57,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=905, PETRI_PLACES=94, PETRI_TRANSITIONS=108} [2024-06-14 13:03:57,770 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-14 13:03:57,771 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 108 transitions, 905 flow [2024-06-14 13:03:57,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:57,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:57,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:57,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 13:03:57,771 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:57,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:57,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1563809709, now seen corresponding path program 1 times [2024-06-14 13:03:57,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:57,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139707226] [2024-06-14 13:03:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:57,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:03:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:03:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:03:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139707226] [2024-06-14 13:03:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139707226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:03:58,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:03:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:03:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386496491] [2024-06-14 13:03:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:03:58,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:03:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:03:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:03:58,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:03:58,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:03:58,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 108 transitions, 905 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:58,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:03:58,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:03:58,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:03:59,457 INFO L124 PetriNetUnfolderBase]: 1778/2652 cut-off events. [2024-06-14 13:03:59,457 INFO L125 PetriNetUnfolderBase]: For 21458/21458 co-relation queries the response was YES. [2024-06-14 13:03:59,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12653 conditions, 2652 events. 1778/2652 cut-off events. For 21458/21458 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11987 event pairs, 571 based on Foata normal form. 4/2654 useless extension candidates. Maximal degree in co-relation 12606. Up to 2594 conditions per place. [2024-06-14 13:03:59,474 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 112 selfloop transitions, 15 changer transitions 0/130 dead transitions. [2024-06-14 13:03:59,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 130 transitions, 1223 flow [2024-06-14 13:03:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:03:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:03:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-14 13:03:59,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-14 13:03:59,475 INFO L175 Difference]: Start difference. First operand has 94 places, 108 transitions, 905 flow. Second operand 7 states and 111 transitions. [2024-06-14 13:03:59,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 130 transitions, 1223 flow [2024-06-14 13:03:59,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 130 transitions, 1195 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-14 13:03:59,492 INFO L231 Difference]: Finished difference. Result has 96 places, 110 transitions, 932 flow [2024-06-14 13:03:59,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=932, PETRI_PLACES=96, PETRI_TRANSITIONS=110} [2024-06-14 13:03:59,493 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-14 13:03:59,493 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 110 transitions, 932 flow [2024-06-14 13:03:59,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:03:59,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:03:59,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:03:59,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 13:03:59,494 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:03:59,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:03:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1447602406, now seen corresponding path program 1 times [2024-06-14 13:03:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:03:59,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143382855] [2024-06-14 13:03:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:03:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:03:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:00,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-14 13:04:00,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:00,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143382855] [2024-06-14 13:04:00,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143382855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:00,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:00,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:04:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917117769] [2024-06-14 13:04:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:00,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:04:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:00,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:04:00,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:04:00,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 13:04:00,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 110 transitions, 932 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:00,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:00,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 13:04:00,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:00,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][76], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 8#L784true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, 10#L823-5true, P0Thread1of1ForFork1InUse, 182#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L754true, 31#L791true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-14 13:04:00,768 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,768 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,768 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,768 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][116], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 37#L781true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 14#L794true, 71#true, 10#L823-5true, P0Thread1of1ForFork1InUse, 182#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L754true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-14 13:04:00,769 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,769 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,769 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,769 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][101], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 37#L781true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, 10#L823-5true, P0Thread1of1ForFork1InUse, 182#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 28#L761true, 31#L791true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-14 13:04:00,770 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,770 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,770 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,770 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:00,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][76], [139#true, 42#L824true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 8#L784true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, P0Thread1of1ForFork1InUse, 182#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L754true, 31#L791true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-14 13:04:00,802 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,802 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,802 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,802 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][116], [139#true, 42#L824true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 14#L794true, 71#true, P0Thread1of1ForFork1InUse, 182#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L754true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-14 13:04:00,802 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,802 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,803 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,803 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][101], [139#true, 42#L824true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, P0Thread1of1ForFork1InUse, 182#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 28#L761true, 31#L791true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-14 13:04:00,803 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,803 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,803 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,804 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:00,927 INFO L124 PetriNetUnfolderBase]: 1760/2635 cut-off events. [2024-06-14 13:04:00,927 INFO L125 PetriNetUnfolderBase]: For 27250/27331 co-relation queries the response was YES. [2024-06-14 13:04:00,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13194 conditions, 2635 events. 1760/2635 cut-off events. For 27250/27331 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12195 event pairs, 503 based on Foata normal form. 41/2613 useless extension candidates. Maximal degree in co-relation 13146. Up to 2256 conditions per place. [2024-06-14 13:04:00,947 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 96 selfloop transitions, 42 changer transitions 0/153 dead transitions. [2024-06-14 13:04:00,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 153 transitions, 1476 flow [2024-06-14 13:04:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:04:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:04:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-14 13:04:00,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808362369337979 [2024-06-14 13:04:00,949 INFO L175 Difference]: Start difference. First operand has 96 places, 110 transitions, 932 flow. Second operand 7 states and 138 transitions. [2024-06-14 13:04:00,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 153 transitions, 1476 flow [2024-06-14 13:04:00,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 153 transitions, 1439 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 13:04:00,968 INFO L231 Difference]: Finished difference. Result has 98 places, 118 transitions, 1053 flow [2024-06-14 13:04:00,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1053, PETRI_PLACES=98, PETRI_TRANSITIONS=118} [2024-06-14 13:04:00,968 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-14 13:04:00,969 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 118 transitions, 1053 flow [2024-06-14 13:04:00,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:00,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:00,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:00,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 13:04:00,969 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:00,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1447692616, now seen corresponding path program 2 times [2024-06-14 13:04:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:00,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072331336] [2024-06-14 13:04:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072331336] [2024-06-14 13:04:02,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072331336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:02,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:02,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:04:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549489657] [2024-06-14 13:04:02,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:02,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:04:02,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:04:02,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:04:02,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 13:04:02,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 118 transitions, 1053 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:02,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:02,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 13:04:02,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:02,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][73], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 209#true, Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 8#L784true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, 10#L823-5true, P0Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L754true, 31#L791true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-14 13:04:02,363 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,363 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,364 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,364 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][97], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 209#true, Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, 10#L823-5true, P0Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 28#L761true, 31#L791true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-14 13:04:02,364 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,364 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,364 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,364 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][110], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 209#true, Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 14#L794true, 71#true, 10#L823-5true, P0Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L754true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-14 13:04:02,365 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,365 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,365 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,365 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 13:04:02,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][73], [139#true, 42#L824true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 209#true, Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 8#L784true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, P0Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L754true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 31#L791true, 198#true, Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-14 13:04:02,391 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,391 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,391 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,391 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][97], [139#true, 42#L824true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 209#true, Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, P0Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 28#L761true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 31#L791true, 198#true, Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-14 13:04:02,391 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,391 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,392 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,392 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][110], [139#true, 42#L824true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 153#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 209#true, Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 101#true, Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 99#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 14#L794true, 71#true, P0Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L754true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 123#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-14 13:04:02,392 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,392 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,392 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,392 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-14 13:04:02,542 INFO L124 PetriNetUnfolderBase]: 1752/2624 cut-off events. [2024-06-14 13:04:02,542 INFO L125 PetriNetUnfolderBase]: For 31142/31245 co-relation queries the response was YES. [2024-06-14 13:04:02,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13928 conditions, 2624 events. 1752/2624 cut-off events. For 31142/31245 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12117 event pairs, 524 based on Foata normal form. 25/2586 useless extension candidates. Maximal degree in co-relation 13879. Up to 2440 conditions per place. [2024-06-14 13:04:02,556 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 95 selfloop transitions, 32 changer transitions 0/142 dead transitions. [2024-06-14 13:04:02,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 142 transitions, 1379 flow [2024-06-14 13:04:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:04:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:04:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-14 13:04:02,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 13:04:02,558 INFO L175 Difference]: Start difference. First operand has 98 places, 118 transitions, 1053 flow. Second operand 7 states and 123 transitions. [2024-06-14 13:04:02,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 142 transitions, 1379 flow [2024-06-14 13:04:02,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 142 transitions, 1321 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-14 13:04:02,577 INFO L231 Difference]: Finished difference. Result has 102 places, 120 transitions, 1088 flow [2024-06-14 13:04:02,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1088, PETRI_PLACES=102, PETRI_TRANSITIONS=120} [2024-06-14 13:04:02,577 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2024-06-14 13:04:02,577 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 120 transitions, 1088 flow [2024-06-14 13:04:02,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:02,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:02,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:02,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 13:04:02,578 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:02,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash -560683501, now seen corresponding path program 1 times [2024-06-14 13:04:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494851889] [2024-06-14 13:04:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:03,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494851889] [2024-06-14 13:04:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494851889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:03,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:03,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:04:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219094238] [2024-06-14 13:04:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:03,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:04:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:04:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:04:03,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:03,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 120 transitions, 1088 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:03,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:03,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:03,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:03,732 INFO L124 PetriNetUnfolderBase]: 1838/2739 cut-off events. [2024-06-14 13:04:03,732 INFO L125 PetriNetUnfolderBase]: For 31557/31559 co-relation queries the response was YES. [2024-06-14 13:04:03,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14409 conditions, 2739 events. 1838/2739 cut-off events. For 31557/31559 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12491 event pairs, 551 based on Foata normal form. 4/2741 useless extension candidates. Maximal degree in co-relation 14358. Up to 2497 conditions per place. [2024-06-14 13:04:03,748 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 118 selfloop transitions, 35 changer transitions 0/156 dead transitions. [2024-06-14 13:04:03,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 156 transitions, 1588 flow [2024-06-14 13:04:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:04:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:04:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-14 13:04:03,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-14 13:04:03,750 INFO L175 Difference]: Start difference. First operand has 102 places, 120 transitions, 1088 flow. Second operand 7 states and 128 transitions. [2024-06-14 13:04:03,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 156 transitions, 1588 flow [2024-06-14 13:04:03,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 156 transitions, 1513 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 13:04:03,773 INFO L231 Difference]: Finished difference. Result has 106 places, 126 transitions, 1182 flow [2024-06-14 13:04:03,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1182, PETRI_PLACES=106, PETRI_TRANSITIONS=126} [2024-06-14 13:04:03,774 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-14 13:04:03,774 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 126 transitions, 1182 flow [2024-06-14 13:04:03,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:03,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:03,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:03,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 13:04:03,775 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:03,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash -560677921, now seen corresponding path program 2 times [2024-06-14 13:04:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:03,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491020458] [2024-06-14 13:04:03,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:03,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:04,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-14 13:04:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491020458] [2024-06-14 13:04:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491020458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:04,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:04,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:04:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655129460] [2024-06-14 13:04:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:04,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:04:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:04,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:04:04,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:04:04,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:04,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 126 transitions, 1182 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:04,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:04,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:04,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:04,894 INFO L124 PetriNetUnfolderBase]: 1860/2771 cut-off events. [2024-06-14 13:04:04,895 INFO L125 PetriNetUnfolderBase]: For 35358/35360 co-relation queries the response was YES. [2024-06-14 13:04:04,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15055 conditions, 2771 events. 1860/2771 cut-off events. For 35358/35360 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12644 event pairs, 558 based on Foata normal form. 4/2773 useless extension candidates. Maximal degree in co-relation 15001. Up to 2516 conditions per place. [2024-06-14 13:04:04,913 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 118 selfloop transitions, 35 changer transitions 0/156 dead transitions. [2024-06-14 13:04:04,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 156 transitions, 1658 flow [2024-06-14 13:04:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:04:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:04:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-14 13:04:04,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-14 13:04:04,915 INFO L175 Difference]: Start difference. First operand has 106 places, 126 transitions, 1182 flow. Second operand 7 states and 124 transitions. [2024-06-14 13:04:04,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 156 transitions, 1658 flow [2024-06-14 13:04:04,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 156 transitions, 1604 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-14 13:04:04,945 INFO L231 Difference]: Finished difference. Result has 110 places, 129 transitions, 1241 flow [2024-06-14 13:04:04,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1241, PETRI_PLACES=110, PETRI_TRANSITIONS=129} [2024-06-14 13:04:04,945 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-14 13:04:04,946 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 129 transitions, 1241 flow [2024-06-14 13:04:04,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:04,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:04,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:04,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 13:04:04,946 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:04,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2097962333, now seen corresponding path program 3 times [2024-06-14 13:04:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:04,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160365826] [2024-06-14 13:04:04,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:05,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:05,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160365826] [2024-06-14 13:04:05,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160365826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:05,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:05,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:04:05,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783626920] [2024-06-14 13:04:05,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:05,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:04:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:04:05,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:04:05,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:05,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 129 transitions, 1241 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:05,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:05,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:05,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:06,058 INFO L124 PetriNetUnfolderBase]: 1850/2757 cut-off events. [2024-06-14 13:04:06,059 INFO L125 PetriNetUnfolderBase]: For 38587/38589 co-relation queries the response was YES. [2024-06-14 13:04:06,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15151 conditions, 2757 events. 1850/2757 cut-off events. For 38587/38589 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12560 event pairs, 582 based on Foata normal form. 6/2761 useless extension candidates. Maximal degree in co-relation 15096. Up to 2684 conditions per place. [2024-06-14 13:04:06,077 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 132 selfloop transitions, 16 changer transitions 0/151 dead transitions. [2024-06-14 13:04:06,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 151 transitions, 1602 flow [2024-06-14 13:04:06,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:04:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:04:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-14 13:04:06,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-14 13:04:06,079 INFO L175 Difference]: Start difference. First operand has 110 places, 129 transitions, 1241 flow. Second operand 7 states and 113 transitions. [2024-06-14 13:04:06,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 151 transitions, 1602 flow [2024-06-14 13:04:06,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 151 transitions, 1544 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 13:04:06,111 INFO L231 Difference]: Finished difference. Result has 113 places, 130 transitions, 1234 flow [2024-06-14 13:04:06,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1234, PETRI_PLACES=113, PETRI_TRANSITIONS=130} [2024-06-14 13:04:06,112 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-14 13:04:06,112 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 130 transitions, 1234 flow [2024-06-14 13:04:06,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:06,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:06,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:06,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 13:04:06,113 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:06,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2097954676, now seen corresponding path program 1 times [2024-06-14 13:04:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:06,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403089043] [2024-06-14 13:04:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:06,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403089043] [2024-06-14 13:04:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403089043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:06,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:06,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:06,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168871485] [2024-06-14 13:04:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:06,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:06,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:06,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:06,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:06,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 130 transitions, 1234 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:06,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:06,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:06,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:07,415 INFO L124 PetriNetUnfolderBase]: 1845/2749 cut-off events. [2024-06-14 13:04:07,416 INFO L125 PetriNetUnfolderBase]: For 41600/41600 co-relation queries the response was YES. [2024-06-14 13:04:07,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15201 conditions, 2749 events. 1845/2749 cut-off events. For 41600/41600 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12520 event pairs, 576 based on Foata normal form. 2/2749 useless extension candidates. Maximal degree in co-relation 15145. Up to 2682 conditions per place. [2024-06-14 13:04:07,436 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 131 selfloop transitions, 19 changer transitions 0/153 dead transitions. [2024-06-14 13:04:07,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 153 transitions, 1610 flow [2024-06-14 13:04:07,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:04:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:04:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-14 13:04:07,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:04:07,441 INFO L175 Difference]: Start difference. First operand has 113 places, 130 transitions, 1234 flow. Second operand 7 states and 112 transitions. [2024-06-14 13:04:07,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 153 transitions, 1610 flow [2024-06-14 13:04:07,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 153 transitions, 1578 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 13:04:07,481 INFO L231 Difference]: Finished difference. Result has 115 places, 133 transitions, 1282 flow [2024-06-14 13:04:07,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1282, PETRI_PLACES=115, PETRI_TRANSITIONS=133} [2024-06-14 13:04:07,482 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2024-06-14 13:04:07,483 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 133 transitions, 1282 flow [2024-06-14 13:04:07,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:07,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:07,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:07,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 13:04:07,483 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:07,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash -962710473, now seen corresponding path program 1 times [2024-06-14 13:04:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872535499] [2024-06-14 13:04:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872535499] [2024-06-14 13:04:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872535499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:08,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:08,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 13:04:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275189201] [2024-06-14 13:04:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:08,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:04:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:04:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:04:08,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:08,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 133 transitions, 1282 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:08,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:08,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:08,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:08,873 INFO L124 PetriNetUnfolderBase]: 1839/2741 cut-off events. [2024-06-14 13:04:08,873 INFO L125 PetriNetUnfolderBase]: For 45299/45299 co-relation queries the response was YES. [2024-06-14 13:04:08,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15640 conditions, 2741 events. 1839/2741 cut-off events. For 45299/45299 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12489 event pairs, 580 based on Foata normal form. 2/2741 useless extension candidates. Maximal degree in co-relation 15583. Up to 2719 conditions per place. [2024-06-14 13:04:08,888 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 132 selfloop transitions, 10 changer transitions 0/145 dead transitions. [2024-06-14 13:04:08,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 145 transitions, 1618 flow [2024-06-14 13:04:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:04:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:04:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-14 13:04:08,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:04:08,890 INFO L175 Difference]: Start difference. First operand has 115 places, 133 transitions, 1282 flow. Second operand 5 states and 80 transitions. [2024-06-14 13:04:08,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 145 transitions, 1618 flow [2024-06-14 13:04:08,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 145 transitions, 1576 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 13:04:08,922 INFO L231 Difference]: Finished difference. Result has 115 places, 136 transitions, 1302 flow [2024-06-14 13:04:08,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1302, PETRI_PLACES=115, PETRI_TRANSITIONS=136} [2024-06-14 13:04:08,922 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2024-06-14 13:04:08,922 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 136 transitions, 1302 flow [2024-06-14 13:04:08,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:08,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:08,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:08,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 13:04:08,923 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:08,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash -319470718, now seen corresponding path program 1 times [2024-06-14 13:04:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:08,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882617636] [2024-06-14 13:04:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:09,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882617636] [2024-06-14 13:04:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882617636] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:09,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:09,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389251845] [2024-06-14 13:04:09,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:09,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:09,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:09,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:09,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 13:04:09,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 136 transitions, 1302 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:09,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:09,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 13:04:09,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:10,524 INFO L124 PetriNetUnfolderBase]: 1785/2681 cut-off events. [2024-06-14 13:04:10,525 INFO L125 PetriNetUnfolderBase]: For 54609/54689 co-relation queries the response was YES. [2024-06-14 13:04:10,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15908 conditions, 2681 events. 1785/2681 cut-off events. For 54609/54689 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12473 event pairs, 392 based on Foata normal form. 26/2647 useless extension candidates. Maximal degree in co-relation 15850. Up to 2345 conditions per place. [2024-06-14 13:04:10,545 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 115 selfloop transitions, 40 changer transitions 0/175 dead transitions. [2024-06-14 13:04:10,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 175 transitions, 1830 flow [2024-06-14 13:04:10,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-14 13:04:10,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 13:04:10,547 INFO L175 Difference]: Start difference. First operand has 115 places, 136 transitions, 1302 flow. Second operand 8 states and 144 transitions. [2024-06-14 13:04:10,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 175 transitions, 1830 flow [2024-06-14 13:04:10,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 175 transitions, 1798 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 13:04:10,590 INFO L231 Difference]: Finished difference. Result has 121 places, 142 transitions, 1436 flow [2024-06-14 13:04:10,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1436, PETRI_PLACES=121, PETRI_TRANSITIONS=142} [2024-06-14 13:04:10,591 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-14 13:04:10,591 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 142 transitions, 1436 flow [2024-06-14 13:04:10,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:10,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:10,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:10,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 13:04:10,591 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:10,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash -319410268, now seen corresponding path program 2 times [2024-06-14 13:04:10,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:10,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616668031] [2024-06-14 13:04:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:11,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616668031] [2024-06-14 13:04:11,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616668031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:11,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:11,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599684570] [2024-06-14 13:04:11,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:11,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:11,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:11,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:11,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 13:04:11,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 142 transitions, 1436 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:11,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:11,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 13:04:11,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:12,184 INFO L124 PetriNetUnfolderBase]: 1851/2787 cut-off events. [2024-06-14 13:04:12,184 INFO L125 PetriNetUnfolderBase]: For 63400/63483 co-relation queries the response was YES. [2024-06-14 13:04:12,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16969 conditions, 2787 events. 1851/2787 cut-off events. For 63400/63483 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13057 event pairs, 485 based on Foata normal form. 50/2776 useless extension candidates. Maximal degree in co-relation 16909. Up to 2330 conditions per place. [2024-06-14 13:04:12,203 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 115 selfloop transitions, 52 changer transitions 0/187 dead transitions. [2024-06-14 13:04:12,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 187 transitions, 2058 flow [2024-06-14 13:04:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-14 13:04:12,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47560975609756095 [2024-06-14 13:04:12,205 INFO L175 Difference]: Start difference. First operand has 121 places, 142 transitions, 1436 flow. Second operand 8 states and 156 transitions. [2024-06-14 13:04:12,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 187 transitions, 2058 flow [2024-06-14 13:04:12,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 187 transitions, 1989 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-14 13:04:12,250 INFO L231 Difference]: Finished difference. Result has 126 places, 145 transitions, 1527 flow [2024-06-14 13:04:12,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1527, PETRI_PLACES=126, PETRI_TRANSITIONS=145} [2024-06-14 13:04:12,251 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2024-06-14 13:04:12,251 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 145 transitions, 1527 flow [2024-06-14 13:04:12,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:12,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:12,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:12,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 13:04:12,252 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:12,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash -319410144, now seen corresponding path program 1 times [2024-06-14 13:04:12,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:12,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480580832] [2024-06-14 13:04:12,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:13,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480580832] [2024-06-14 13:04:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480580832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001276463] [2024-06-14 13:04:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:13,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:13,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:13,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 145 transitions, 1527 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:13,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:13,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:13,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:13,757 INFO L124 PetriNetUnfolderBase]: 1960/2931 cut-off events. [2024-06-14 13:04:13,758 INFO L125 PetriNetUnfolderBase]: For 61152/61154 co-relation queries the response was YES. [2024-06-14 13:04:13,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17725 conditions, 2931 events. 1960/2931 cut-off events. For 61152/61154 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13589 event pairs, 501 based on Foata normal form. 4/2933 useless extension candidates. Maximal degree in co-relation 17663. Up to 2517 conditions per place. [2024-06-14 13:04:13,779 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 145 selfloop transitions, 50 changer transitions 0/198 dead transitions. [2024-06-14 13:04:13,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 198 transitions, 2352 flow [2024-06-14 13:04:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-14 13:04:13,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-14 13:04:13,781 INFO L175 Difference]: Start difference. First operand has 126 places, 145 transitions, 1527 flow. Second operand 8 states and 145 transitions. [2024-06-14 13:04:13,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 198 transitions, 2352 flow [2024-06-14 13:04:13,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 198 transitions, 2229 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:13,828 INFO L231 Difference]: Finished difference. Result has 131 places, 160 transitions, 1726 flow [2024-06-14 13:04:13,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1726, PETRI_PLACES=131, PETRI_TRANSITIONS=160} [2024-06-14 13:04:13,828 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places. [2024-06-14 13:04:13,828 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 160 transitions, 1726 flow [2024-06-14 13:04:13,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:13,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:13,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:13,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 13:04:13,829 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:13,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1928804474, now seen corresponding path program 2 times [2024-06-14 13:04:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:13,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724023708] [2024-06-14 13:04:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:14,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724023708] [2024-06-14 13:04:14,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724023708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:14,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:14,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014278694] [2024-06-14 13:04:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:14,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:14,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:14,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:14,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:14,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 160 transitions, 1726 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:14,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:14,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:14,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:15,455 INFO L124 PetriNetUnfolderBase]: 1982/2963 cut-off events. [2024-06-14 13:04:15,455 INFO L125 PetriNetUnfolderBase]: For 66836/66838 co-relation queries the response was YES. [2024-06-14 13:04:15,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18602 conditions, 2963 events. 1982/2963 cut-off events. For 66836/66838 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13785 event pairs, 509 based on Foata normal form. 4/2965 useless extension candidates. Maximal degree in co-relation 18536. Up to 2691 conditions per place. [2024-06-14 13:04:15,479 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 150 selfloop transitions, 39 changer transitions 0/192 dead transitions. [2024-06-14 13:04:15,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 192 transitions, 2215 flow [2024-06-14 13:04:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-14 13:04:15,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-14 13:04:15,480 INFO L175 Difference]: Start difference. First operand has 131 places, 160 transitions, 1726 flow. Second operand 8 states and 137 transitions. [2024-06-14 13:04:15,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 192 transitions, 2215 flow [2024-06-14 13:04:15,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 192 transitions, 2151 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-14 13:04:15,540 INFO L231 Difference]: Finished difference. Result has 136 places, 163 transitions, 1787 flow [2024-06-14 13:04:15,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1787, PETRI_PLACES=136, PETRI_TRANSITIONS=163} [2024-06-14 13:04:15,541 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-14 13:04:15,541 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 163 transitions, 1787 flow [2024-06-14 13:04:15,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:15,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:15,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:15,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 13:04:15,542 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:15,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1928799824, now seen corresponding path program 3 times [2024-06-14 13:04:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:15,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253638606] [2024-06-14 13:04:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:16,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:16,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253638606] [2024-06-14 13:04:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253638606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:16,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500762775] [2024-06-14 13:04:16,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:16,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:16,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:16,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:16,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 163 transitions, 1787 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:16,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:16,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:16,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:16,999 INFO L124 PetriNetUnfolderBase]: 2004/2995 cut-off events. [2024-06-14 13:04:17,000 INFO L125 PetriNetUnfolderBase]: For 72195/72197 co-relation queries the response was YES. [2024-06-14 13:04:17,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19043 conditions, 2995 events. 2004/2995 cut-off events. For 72195/72197 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13957 event pairs, 509 based on Foata normal form. 4/2997 useless extension candidates. Maximal degree in co-relation 18976. Up to 2696 conditions per place. [2024-06-14 13:04:17,019 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 153 selfloop transitions, 45 changer transitions 0/201 dead transitions. [2024-06-14 13:04:17,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 201 transitions, 2324 flow [2024-06-14 13:04:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-14 13:04:17,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-14 13:04:17,021 INFO L175 Difference]: Start difference. First operand has 136 places, 163 transitions, 1787 flow. Second operand 9 states and 151 transitions. [2024-06-14 13:04:17,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 201 transitions, 2324 flow [2024-06-14 13:04:17,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 201 transitions, 2238 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:17,081 INFO L231 Difference]: Finished difference. Result has 140 places, 168 transitions, 1868 flow [2024-06-14 13:04:17,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1868, PETRI_PLACES=140, PETRI_TRANSITIONS=168} [2024-06-14 13:04:17,082 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2024-06-14 13:04:17,082 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 168 transitions, 1868 flow [2024-06-14 13:04:17,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:17,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:17,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:17,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 13:04:17,082 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:17,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash -316613758, now seen corresponding path program 3 times [2024-06-14 13:04:17,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:17,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781699554] [2024-06-14 13:04:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781699554] [2024-06-14 13:04:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781699554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:17,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730370775] [2024-06-14 13:04:17,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:17,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:17,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:17,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:17,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 13:04:17,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 168 transitions, 1868 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:17,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:17,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 13:04:17,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:18,566 INFO L124 PetriNetUnfolderBase]: 1995/3001 cut-off events. [2024-06-14 13:04:18,566 INFO L125 PetriNetUnfolderBase]: For 87789/87855 co-relation queries the response was YES. [2024-06-14 13:04:18,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19689 conditions, 3001 events. 1995/3001 cut-off events. For 87789/87855 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14338 event pairs, 476 based on Foata normal form. 20/2955 useless extension candidates. Maximal degree in co-relation 19620. Up to 2585 conditions per place. [2024-06-14 13:04:18,590 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 133 selfloop transitions, 51 changer transitions 0/211 dead transitions. [2024-06-14 13:04:18,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 211 transitions, 2540 flow [2024-06-14 13:04:18,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 13:04:18,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-14 13:04:18,592 INFO L175 Difference]: Start difference. First operand has 140 places, 168 transitions, 1868 flow. Second operand 8 states and 154 transitions. [2024-06-14 13:04:18,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 211 transitions, 2540 flow [2024-06-14 13:04:18,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 211 transitions, 2467 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-14 13:04:18,655 INFO L231 Difference]: Finished difference. Result has 146 places, 173 transitions, 2023 flow [2024-06-14 13:04:18,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2023, PETRI_PLACES=146, PETRI_TRANSITIONS=173} [2024-06-14 13:04:18,656 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2024-06-14 13:04:18,656 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 173 transitions, 2023 flow [2024-06-14 13:04:18,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:18,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:18,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:18,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 13:04:18,656 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:18,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -201322464, now seen corresponding path program 4 times [2024-06-14 13:04:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847443302] [2024-06-14 13:04:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:19,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847443302] [2024-06-14 13:04:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847443302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:19,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014568920] [2024-06-14 13:04:19,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:19,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:19,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:19,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:19,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:19,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:19,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 173 transitions, 2023 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:19,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:19,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:19,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:20,118 INFO L124 PetriNetUnfolderBase]: 2092/3130 cut-off events. [2024-06-14 13:04:20,118 INFO L125 PetriNetUnfolderBase]: For 88664/88666 co-relation queries the response was YES. [2024-06-14 13:04:20,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20873 conditions, 3130 events. 2092/3130 cut-off events. For 88664/88666 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14756 event pairs, 510 based on Foata normal form. 4/3132 useless extension candidates. Maximal degree in co-relation 20799. Up to 2790 conditions per place. [2024-06-14 13:04:20,143 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 172 selfloop transitions, 48 changer transitions 0/223 dead transitions. [2024-06-14 13:04:20,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 223 transitions, 2773 flow [2024-06-14 13:04:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-14 13:04:20,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44173441734417346 [2024-06-14 13:04:20,144 INFO L175 Difference]: Start difference. First operand has 146 places, 173 transitions, 2023 flow. Second operand 9 states and 163 transitions. [2024-06-14 13:04:20,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 223 transitions, 2773 flow [2024-06-14 13:04:20,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 223 transitions, 2684 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 13:04:20,227 INFO L231 Difference]: Finished difference. Result has 152 places, 180 transitions, 2146 flow [2024-06-14 13:04:20,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2146, PETRI_PLACES=152, PETRI_TRANSITIONS=180} [2024-06-14 13:04:20,227 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-14 13:04:20,227 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 180 transitions, 2146 flow [2024-06-14 13:04:20,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:20,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:20,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:20,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 13:04:20,228 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:20,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:20,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2044268624, now seen corresponding path program 5 times [2024-06-14 13:04:20,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:20,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369915544] [2024-06-14 13:04:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:20,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:21,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:21,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369915544] [2024-06-14 13:04:21,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369915544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:21,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:21,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:21,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467475576] [2024-06-14 13:04:21,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:21,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:21,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:21,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:21,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:21,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:21,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 180 transitions, 2146 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:21,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:21,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:21,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:21,764 INFO L124 PetriNetUnfolderBase]: 2114/3162 cut-off events. [2024-06-14 13:04:21,764 INFO L125 PetriNetUnfolderBase]: For 94363/94365 co-relation queries the response was YES. [2024-06-14 13:04:21,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21274 conditions, 3162 events. 2114/3162 cut-off events. For 94363/94365 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14923 event pairs, 515 based on Foata normal form. 4/3164 useless extension candidates. Maximal degree in co-relation 21198. Up to 2890 conditions per place. [2024-06-14 13:04:21,790 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 171 selfloop transitions, 39 changer transitions 0/213 dead transitions. [2024-06-14 13:04:21,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 213 transitions, 2696 flow [2024-06-14 13:04:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-14 13:04:21,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-14 13:04:21,792 INFO L175 Difference]: Start difference. First operand has 152 places, 180 transitions, 2146 flow. Second operand 8 states and 137 transitions. [2024-06-14 13:04:21,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 213 transitions, 2696 flow [2024-06-14 13:04:21,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 213 transitions, 2617 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-14 13:04:21,909 INFO L231 Difference]: Finished difference. Result has 155 places, 183 transitions, 2207 flow [2024-06-14 13:04:21,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2069, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2207, PETRI_PLACES=155, PETRI_TRANSITIONS=183} [2024-06-14 13:04:21,910 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places. [2024-06-14 13:04:21,910 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 183 transitions, 2207 flow [2024-06-14 13:04:21,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:21,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:21,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:21,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 13:04:21,910 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:21,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2044275568, now seen corresponding path program 1 times [2024-06-14 13:04:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253413957] [2024-06-14 13:04:21,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:21,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253413957] [2024-06-14 13:04:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253413957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468951166] [2024-06-14 13:04:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:22,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:22,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:22,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 183 transitions, 2207 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:22,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:22,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:22,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:23,474 INFO L124 PetriNetUnfolderBase]: 2148/3216 cut-off events. [2024-06-14 13:04:23,475 INFO L125 PetriNetUnfolderBase]: For 102080/102082 co-relation queries the response was YES. [2024-06-14 13:04:23,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21825 conditions, 3216 events. 2148/3216 cut-off events. For 102080/102082 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15272 event pairs, 507 based on Foata normal form. 8/3222 useless extension candidates. Maximal degree in co-relation 21747. Up to 2931 conditions per place. [2024-06-14 13:04:23,500 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 173 selfloop transitions, 39 changer transitions 0/215 dead transitions. [2024-06-14 13:04:23,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 215 transitions, 2739 flow [2024-06-14 13:04:23,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-14 13:04:23,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-14 13:04:23,516 INFO L175 Difference]: Start difference. First operand has 155 places, 183 transitions, 2207 flow. Second operand 8 states and 137 transitions. [2024-06-14 13:04:23,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 215 transitions, 2739 flow [2024-06-14 13:04:23,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 215 transitions, 2643 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:23,613 INFO L231 Difference]: Finished difference. Result has 157 places, 186 transitions, 2235 flow [2024-06-14 13:04:23,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2111, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2235, PETRI_PLACES=157, PETRI_TRANSITIONS=186} [2024-06-14 13:04:23,615 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places. [2024-06-14 13:04:23,616 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 186 transitions, 2235 flow [2024-06-14 13:04:23,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:23,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:23,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:23,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 13:04:23,617 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:23,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash -530831184, now seen corresponding path program 2 times [2024-06-14 13:04:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:23,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112806852] [2024-06-14 13:04:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:23,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:24,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:24,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112806852] [2024-06-14 13:04:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112806852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182478232] [2024-06-14 13:04:24,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:24,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:24,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:24,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:24,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:24,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 186 transitions, 2235 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:24,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:24,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:24,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:25,270 INFO L124 PetriNetUnfolderBase]: 2165/3242 cut-off events. [2024-06-14 13:04:25,270 INFO L125 PetriNetUnfolderBase]: For 107272/107272 co-relation queries the response was YES. [2024-06-14 13:04:25,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22373 conditions, 3242 events. 2165/3242 cut-off events. For 107272/107272 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15353 event pairs, 550 based on Foata normal form. 4/3244 useless extension candidates. Maximal degree in co-relation 22294. Up to 3148 conditions per place. [2024-06-14 13:04:25,302 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 190 selfloop transitions, 21 changer transitions 0/214 dead transitions. [2024-06-14 13:04:25,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 214 transitions, 2751 flow [2024-06-14 13:04:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-14 13:04:25,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:04:25,305 INFO L175 Difference]: Start difference. First operand has 157 places, 186 transitions, 2235 flow. Second operand 8 states and 128 transitions. [2024-06-14 13:04:25,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 214 transitions, 2751 flow [2024-06-14 13:04:25,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 214 transitions, 2657 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-14 13:04:25,397 INFO L231 Difference]: Finished difference. Result has 160 places, 188 transitions, 2220 flow [2024-06-14 13:04:25,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2220, PETRI_PLACES=160, PETRI_TRANSITIONS=188} [2024-06-14 13:04:25,397 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places. [2024-06-14 13:04:25,397 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 188 transitions, 2220 flow [2024-06-14 13:04:25,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:25,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:25,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:25,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 13:04:25,398 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:25,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash 339644326, now seen corresponding path program 6 times [2024-06-14 13:04:25,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:25,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442600907] [2024-06-14 13:04:25,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:25,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:26,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442600907] [2024-06-14 13:04:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442600907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:26,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:26,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596536109] [2024-06-14 13:04:26,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:26,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:26,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:26,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:26,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:26,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 188 transitions, 2220 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:26,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:26,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:26,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:26,828 INFO L124 PetriNetUnfolderBase]: 2155/3229 cut-off events. [2024-06-14 13:04:26,829 INFO L125 PetriNetUnfolderBase]: For 111893/111895 co-relation queries the response was YES. [2024-06-14 13:04:26,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22294 conditions, 3229 events. 2155/3229 cut-off events. For 111893/111895 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15345 event pairs, 547 based on Foata normal form. 6/3233 useless extension candidates. Maximal degree in co-relation 22214. Up to 3133 conditions per place. [2024-06-14 13:04:26,860 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 193 selfloop transitions, 19 changer transitions 0/215 dead transitions. [2024-06-14 13:04:26,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 215 transitions, 2730 flow [2024-06-14 13:04:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-14 13:04:26,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:04:26,862 INFO L175 Difference]: Start difference. First operand has 160 places, 188 transitions, 2220 flow. Second operand 8 states and 128 transitions. [2024-06-14 13:04:26,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 215 transitions, 2730 flow [2024-06-14 13:04:26,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 215 transitions, 2645 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:26,955 INFO L231 Difference]: Finished difference. Result has 162 places, 189 transitions, 2199 flow [2024-06-14 13:04:26,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2199, PETRI_PLACES=162, PETRI_TRANSITIONS=189} [2024-06-14 13:04:26,956 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2024-06-14 13:04:26,956 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 189 transitions, 2199 flow [2024-06-14 13:04:26,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:26,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:26,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:26,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 13:04:26,957 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:26,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:26,957 INFO L85 PathProgramCache]: Analyzing trace with hash -524575074, now seen corresponding path program 3 times [2024-06-14 13:04:26,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407891634] [2024-06-14 13:04:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407891634] [2024-06-14 13:04:27,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407891634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:27,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:27,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768132680] [2024-06-14 13:04:27,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:27,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:27,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:27,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 189 transitions, 2199 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:27,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:27,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:27,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:28,470 INFO L124 PetriNetUnfolderBase]: 2172/3255 cut-off events. [2024-06-14 13:04:28,470 INFO L125 PetriNetUnfolderBase]: For 118209/118209 co-relation queries the response was YES. [2024-06-14 13:04:28,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22525 conditions, 3255 events. 2172/3255 cut-off events. For 118209/118209 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15443 event pairs, 548 based on Foata normal form. 4/3257 useless extension candidates. Maximal degree in co-relation 22444. Up to 3188 conditions per place. [2024-06-14 13:04:28,499 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 197 selfloop transitions, 16 changer transitions 0/216 dead transitions. [2024-06-14 13:04:28,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 216 transitions, 2719 flow [2024-06-14 13:04:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-14 13:04:28,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-14 13:04:28,501 INFO L175 Difference]: Start difference. First operand has 162 places, 189 transitions, 2199 flow. Second operand 8 states and 125 transitions. [2024-06-14 13:04:28,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 216 transitions, 2719 flow [2024-06-14 13:04:28,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 216 transitions, 2675 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:28,598 INFO L231 Difference]: Finished difference. Result has 164 places, 191 transitions, 2228 flow [2024-06-14 13:04:28,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2155, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2228, PETRI_PLACES=164, PETRI_TRANSITIONS=191} [2024-06-14 13:04:28,598 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 122 predicate places. [2024-06-14 13:04:28,598 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 191 transitions, 2228 flow [2024-06-14 13:04:28,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:28,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:28,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:28,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 13:04:28,599 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:28,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1540263898, now seen corresponding path program 1 times [2024-06-14 13:04:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:28,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86175443] [2024-06-14 13:04:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86175443] [2024-06-14 13:04:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86175443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:04:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387723354] [2024-06-14 13:04:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:29,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:04:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:29,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:04:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:04:29,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:29,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 191 transitions, 2228 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:29,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:29,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:29,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:29,909 INFO L124 PetriNetUnfolderBase]: 2167/3249 cut-off events. [2024-06-14 13:04:29,909 INFO L125 PetriNetUnfolderBase]: For 123488/123490 co-relation queries the response was YES. [2024-06-14 13:04:29,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22740 conditions, 3249 events. 2167/3249 cut-off events. For 123488/123490 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15481 event pairs, 545 based on Foata normal form. 4/3251 useless extension candidates. Maximal degree in co-relation 22658. Up to 3149 conditions per place. [2024-06-14 13:04:29,938 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 185 selfloop transitions, 24 changer transitions 0/212 dead transitions. [2024-06-14 13:04:29,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 212 transitions, 2702 flow [2024-06-14 13:04:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:04:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:04:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-14 13:04:29,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-14 13:04:29,940 INFO L175 Difference]: Start difference. First operand has 164 places, 191 transitions, 2228 flow. Second operand 7 states and 114 transitions. [2024-06-14 13:04:29,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 212 transitions, 2702 flow [2024-06-14 13:04:30,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 212 transitions, 2643 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:30,046 INFO L231 Difference]: Finished difference. Result has 165 places, 191 transitions, 2229 flow [2024-06-14 13:04:30,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2229, PETRI_PLACES=165, PETRI_TRANSITIONS=191} [2024-06-14 13:04:30,047 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 123 predicate places. [2024-06-14 13:04:30,047 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 191 transitions, 2229 flow [2024-06-14 13:04:30,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:30,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:30,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:30,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 13:04:30,048 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:30,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash -604040196, now seen corresponding path program 4 times [2024-06-14 13:04:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:30,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933630233] [2024-06-14 13:04:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933630233] [2024-06-14 13:04:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933630233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:30,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:30,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287701204] [2024-06-14 13:04:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:30,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:30,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:31,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:31,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 191 transitions, 2229 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:31,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:31,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:31,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:31,699 INFO L124 PetriNetUnfolderBase]: 2184/3275 cut-off events. [2024-06-14 13:04:31,699 INFO L125 PetriNetUnfolderBase]: For 131265/131265 co-relation queries the response was YES. [2024-06-14 13:04:31,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23072 conditions, 3275 events. 2184/3275 cut-off events. For 131265/131265 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15578 event pairs, 551 based on Foata normal form. 4/3277 useless extension candidates. Maximal degree in co-relation 22989. Up to 3172 conditions per place. [2024-06-14 13:04:31,730 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 192 selfloop transitions, 23 changer transitions 0/218 dead transitions. [2024-06-14 13:04:31,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 218 transitions, 2757 flow [2024-06-14 13:04:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-14 13:04:31,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-14 13:04:31,731 INFO L175 Difference]: Start difference. First operand has 165 places, 191 transitions, 2229 flow. Second operand 8 states and 126 transitions. [2024-06-14 13:04:31,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 218 transitions, 2757 flow [2024-06-14 13:04:31,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 218 transitions, 2678 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:31,864 INFO L231 Difference]: Finished difference. Result has 167 places, 193 transitions, 2244 flow [2024-06-14 13:04:31,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2244, PETRI_PLACES=167, PETRI_TRANSITIONS=193} [2024-06-14 13:04:31,864 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2024-06-14 13:04:31,864 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 193 transitions, 2244 flow [2024-06-14 13:04:31,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:31,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:31,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:31,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 13:04:31,865 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:31,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1539966980, now seen corresponding path program 5 times [2024-06-14 13:04:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499191215] [2024-06-14 13:04:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:32,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499191215] [2024-06-14 13:04:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499191215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:32,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:32,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976706426] [2024-06-14 13:04:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:32,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:32,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:32,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:32,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:32,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 193 transitions, 2244 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:32,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:32,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:32,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:33,312 INFO L124 PetriNetUnfolderBase]: 2176/3263 cut-off events. [2024-06-14 13:04:33,313 INFO L125 PetriNetUnfolderBase]: For 135875/135875 co-relation queries the response was YES. [2024-06-14 13:04:33,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23214 conditions, 3263 events. 2176/3263 cut-off events. For 135875/135875 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15514 event pairs, 534 based on Foata normal form. 4/3265 useless extension candidates. Maximal degree in co-relation 23130. Up to 3182 conditions per place. [2024-06-14 13:04:33,342 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 200 selfloop transitions, 17 changer transitions 0/220 dead transitions. [2024-06-14 13:04:33,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 220 transitions, 2778 flow [2024-06-14 13:04:33,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-14 13:04:33,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-14 13:04:33,344 INFO L175 Difference]: Start difference. First operand has 167 places, 193 transitions, 2244 flow. Second operand 8 states and 125 transitions. [2024-06-14 13:04:33,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 220 transitions, 2778 flow [2024-06-14 13:04:33,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 220 transitions, 2700 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:33,469 INFO L231 Difference]: Finished difference. Result has 169 places, 195 transitions, 2249 flow [2024-06-14 13:04:33,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2249, PETRI_PLACES=169, PETRI_TRANSITIONS=195} [2024-06-14 13:04:33,469 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places. [2024-06-14 13:04:33,469 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 195 transitions, 2249 flow [2024-06-14 13:04:33,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 13:04:33,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:33,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:33,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 13:04:33,470 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:33,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1313655978, now seen corresponding path program 1 times [2024-06-14 13:04:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128193400] [2024-06-14 13:04:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:34,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-14 13:04:34,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128193400] [2024-06-14 13:04:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128193400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:34,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:34,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259928835] [2024-06-14 13:04:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:34,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:34,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:34,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:34,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:34,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 195 transitions, 2249 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:34,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:34,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:34,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:35,165 INFO L124 PetriNetUnfolderBase]: 2345/3543 cut-off events. [2024-06-14 13:04:35,165 INFO L125 PetriNetUnfolderBase]: For 154328/154330 co-relation queries the response was YES. [2024-06-14 13:04:35,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24961 conditions, 3543 events. 2345/3543 cut-off events. For 154328/154330 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17364 event pairs, 345 based on Foata normal form. 16/3557 useless extension candidates. Maximal degree in co-relation 24876. Up to 2489 conditions per place. [2024-06-14 13:04:35,199 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 185 selfloop transitions, 63 changer transitions 0/251 dead transitions. [2024-06-14 13:04:35,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 251 transitions, 3119 flow [2024-06-14 13:04:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-14 13:04:35,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 13:04:35,201 INFO L175 Difference]: Start difference. First operand has 169 places, 195 transitions, 2249 flow. Second operand 9 states and 164 transitions. [2024-06-14 13:04:35,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 251 transitions, 3119 flow [2024-06-14 13:04:35,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 251 transitions, 3058 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:35,356 INFO L231 Difference]: Finished difference. Result has 174 places, 200 transitions, 2421 flow [2024-06-14 13:04:35,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2188, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2421, PETRI_PLACES=174, PETRI_TRANSITIONS=200} [2024-06-14 13:04:35,357 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 132 predicate places. [2024-06-14 13:04:35,357 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 200 transitions, 2421 flow [2024-06-14 13:04:35,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:35,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:35,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:35,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 13:04:35,358 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:35,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1311778308, now seen corresponding path program 2 times [2024-06-14 13:04:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:35,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135545456] [2024-06-14 13:04:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:36,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135545456] [2024-06-14 13:04:36,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135545456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:36,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:36,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:36,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577488165] [2024-06-14 13:04:36,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:36,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:36,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:36,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:36,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 200 transitions, 2421 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:36,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:36,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:36,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:37,059 INFO L124 PetriNetUnfolderBase]: 2420/3668 cut-off events. [2024-06-14 13:04:37,059 INFO L125 PetriNetUnfolderBase]: For 166787/166789 co-relation queries the response was YES. [2024-06-14 13:04:37,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26119 conditions, 3668 events. 2420/3668 cut-off events. For 166787/166789 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18282 event pairs, 553 based on Foata normal form. 20/3686 useless extension candidates. Maximal degree in co-relation 26031. Up to 3086 conditions per place. [2024-06-14 13:04:37,089 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 173 selfloop transitions, 68 changer transitions 0/244 dead transitions. [2024-06-14 13:04:37,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 244 transitions, 3190 flow [2024-06-14 13:04:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-14 13:04:37,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-14 13:04:37,095 INFO L175 Difference]: Start difference. First operand has 174 places, 200 transitions, 2421 flow. Second operand 9 states and 160 transitions. [2024-06-14 13:04:37,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 244 transitions, 3190 flow [2024-06-14 13:04:37,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 244 transitions, 3099 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 13:04:37,236 INFO L231 Difference]: Finished difference. Result has 179 places, 201 transitions, 2496 flow [2024-06-14 13:04:37,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2496, PETRI_PLACES=179, PETRI_TRANSITIONS=201} [2024-06-14 13:04:37,236 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 137 predicate places. [2024-06-14 13:04:37,236 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 201 transitions, 2496 flow [2024-06-14 13:04:37,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:37,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:37,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:37,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 13:04:37,237 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:37,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1311782028, now seen corresponding path program 3 times [2024-06-14 13:04:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012600422] [2024-06-14 13:04:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:38,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-14 13:04:38,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012600422] [2024-06-14 13:04:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012600422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:38,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925514938] [2024-06-14 13:04:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:38,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:38,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:38,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 201 transitions, 2496 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:38,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:38,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:38,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:39,098 INFO L124 PetriNetUnfolderBase]: 2589/3947 cut-off events. [2024-06-14 13:04:39,098 INFO L125 PetriNetUnfolderBase]: For 188598/188600 co-relation queries the response was YES. [2024-06-14 13:04:39,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28583 conditions, 3947 events. 2589/3947 cut-off events. For 188598/188600 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20243 event pairs, 566 based on Foata normal form. 16/3961 useless extension candidates. Maximal degree in co-relation 28493. Up to 3038 conditions per place. [2024-06-14 13:04:39,135 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 187 selfloop transitions, 67 changer transitions 0/257 dead transitions. [2024-06-14 13:04:39,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 257 transitions, 3364 flow [2024-06-14 13:04:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:04:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:04:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-14 13:04:39,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-06-14 13:04:39,137 INFO L175 Difference]: Start difference. First operand has 179 places, 201 transitions, 2496 flow. Second operand 10 states and 182 transitions. [2024-06-14 13:04:39,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 257 transitions, 3364 flow [2024-06-14 13:04:39,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 257 transitions, 3221 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 13:04:39,333 INFO L231 Difference]: Finished difference. Result has 183 places, 205 transitions, 2573 flow [2024-06-14 13:04:39,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2573, PETRI_PLACES=183, PETRI_TRANSITIONS=205} [2024-06-14 13:04:39,334 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2024-06-14 13:04:39,334 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 205 transitions, 2573 flow [2024-06-14 13:04:39,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:39,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:39,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:39,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 13:04:39,334 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:39,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1224942348, now seen corresponding path program 4 times [2024-06-14 13:04:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:39,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564615380] [2024-06-14 13:04:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:40,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564615380] [2024-06-14 13:04:40,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564615380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:40,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:40,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:40,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019262743] [2024-06-14 13:04:40,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:40,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:40,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:40,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:40,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:40,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 205 transitions, 2573 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:40,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:40,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:40,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:40,984 INFO L124 PetriNetUnfolderBase]: 2664/4072 cut-off events. [2024-06-14 13:04:40,984 INFO L125 PetriNetUnfolderBase]: For 201909/201911 co-relation queries the response was YES. [2024-06-14 13:04:41,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29579 conditions, 4072 events. 2664/4072 cut-off events. For 201909/201911 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 21121 event pairs, 654 based on Foata normal form. 20/4090 useless extension candidates. Maximal degree in co-relation 29487. Up to 3653 conditions per place. [2024-06-14 13:04:41,024 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 194 selfloop transitions, 47 changer transitions 0/244 dead transitions. [2024-06-14 13:04:41,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 244 transitions, 3195 flow [2024-06-14 13:04:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-14 13:04:41,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-14 13:04:41,029 INFO L175 Difference]: Start difference. First operand has 183 places, 205 transitions, 2573 flow. Second operand 9 states and 155 transitions. [2024-06-14 13:04:41,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 244 transitions, 3195 flow [2024-06-14 13:04:41,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 244 transitions, 3108 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:41,222 INFO L231 Difference]: Finished difference. Result has 186 places, 206 transitions, 2615 flow [2024-06-14 13:04:41,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2486, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2615, PETRI_PLACES=186, PETRI_TRANSITIONS=206} [2024-06-14 13:04:41,224 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places. [2024-06-14 13:04:41,225 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 206 transitions, 2615 flow [2024-06-14 13:04:41,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:41,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:41,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:41,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 13:04:41,225 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:41,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1225086498, now seen corresponding path program 5 times [2024-06-14 13:04:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703698639] [2024-06-14 13:04:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703698639] [2024-06-14 13:04:42,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703698639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:42,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:42,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746206190] [2024-06-14 13:04:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:42,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:42,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:42,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:42,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:42,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:42,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 206 transitions, 2615 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:42,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:42,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:42,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:42,907 INFO L124 PetriNetUnfolderBase]: 2689/4119 cut-off events. [2024-06-14 13:04:42,907 INFO L125 PetriNetUnfolderBase]: For 206144/206146 co-relation queries the response was YES. [2024-06-14 13:04:42,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29859 conditions, 4119 events. 2689/4119 cut-off events. For 206144/206146 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 21532 event pairs, 635 based on Foata normal form. 20/4137 useless extension candidates. Maximal degree in co-relation 29765. Up to 3700 conditions per place. [2024-06-14 13:04:42,948 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 198 selfloop transitions, 45 changer transitions 0/246 dead transitions. [2024-06-14 13:04:42,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 246 transitions, 3247 flow [2024-06-14 13:04:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-14 13:04:42,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-14 13:04:42,950 INFO L175 Difference]: Start difference. First operand has 186 places, 206 transitions, 2615 flow. Second operand 9 states and 156 transitions. [2024-06-14 13:04:42,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 246 transitions, 3247 flow [2024-06-14 13:04:43,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 246 transitions, 3144 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 13:04:43,185 INFO L231 Difference]: Finished difference. Result has 188 places, 207 transitions, 2639 flow [2024-06-14 13:04:43,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2512, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2639, PETRI_PLACES=188, PETRI_TRANSITIONS=207} [2024-06-14 13:04:43,185 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places. [2024-06-14 13:04:43,186 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 207 transitions, 2639 flow [2024-06-14 13:04:43,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:43,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:43,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:43,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 13:04:43,186 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:43,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1057690782, now seen corresponding path program 6 times [2024-06-14 13:04:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:43,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780692378] [2024-06-14 13:04:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:43,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:44,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:44,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780692378] [2024-06-14 13:04:44,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780692378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:44,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:44,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554463121] [2024-06-14 13:04:44,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:44,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:44,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:44,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:44,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:44,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:44,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 207 transitions, 2639 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:44,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:44,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:44,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:45,022 INFO L124 PetriNetUnfolderBase]: 2833/4359 cut-off events. [2024-06-14 13:04:45,023 INFO L125 PetriNetUnfolderBase]: For 226687/226689 co-relation queries the response was YES. [2024-06-14 13:04:45,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31802 conditions, 4359 events. 2833/4359 cut-off events. For 226687/226689 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 23219 event pairs, 558 based on Foata normal form. 16/4373 useless extension candidates. Maximal degree in co-relation 31707. Up to 3628 conditions per place. [2024-06-14 13:04:45,061 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 204 selfloop transitions, 54 changer transitions 0/261 dead transitions. [2024-06-14 13:04:45,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 261 transitions, 3531 flow [2024-06-14 13:04:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-14 13:04:45,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-14 13:04:45,063 INFO L175 Difference]: Start difference. First operand has 188 places, 207 transitions, 2639 flow. Second operand 9 states and 169 transitions. [2024-06-14 13:04:45,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 261 transitions, 3531 flow [2024-06-14 13:04:45,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 261 transitions, 3420 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 13:04:45,297 INFO L231 Difference]: Finished difference. Result has 191 places, 210 transitions, 2715 flow [2024-06-14 13:04:45,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2715, PETRI_PLACES=191, PETRI_TRANSITIONS=210} [2024-06-14 13:04:45,298 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2024-06-14 13:04:45,298 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 210 transitions, 2715 flow [2024-06-14 13:04:45,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:45,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:45,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:45,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 13:04:45,298 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:45,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:45,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1057687062, now seen corresponding path program 7 times [2024-06-14 13:04:45,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:45,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685933905] [2024-06-14 13:04:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:45,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:46,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:46,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685933905] [2024-06-14 13:04:46,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685933905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:46,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:46,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:46,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285975686] [2024-06-14 13:04:46,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:46,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:46,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:46,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 210 transitions, 2715 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:46,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:46,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:46,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:46,887 INFO L124 PetriNetUnfolderBase]: 2930/4516 cut-off events. [2024-06-14 13:04:46,888 INFO L125 PetriNetUnfolderBase]: For 241158/241160 co-relation queries the response was YES. [2024-06-14 13:04:46,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32955 conditions, 4516 events. 2930/4516 cut-off events. For 241158/241160 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 24327 event pairs, 705 based on Foata normal form. 20/4534 useless extension candidates. Maximal degree in co-relation 32858. Up to 3998 conditions per place. [2024-06-14 13:04:46,934 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 192 selfloop transitions, 66 changer transitions 0/261 dead transitions. [2024-06-14 13:04:46,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 261 transitions, 3597 flow [2024-06-14 13:04:46,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-14 13:04:46,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44986449864498645 [2024-06-14 13:04:46,936 INFO L175 Difference]: Start difference. First operand has 191 places, 210 transitions, 2715 flow. Second operand 9 states and 166 transitions. [2024-06-14 13:04:46,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 261 transitions, 3597 flow [2024-06-14 13:04:47,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 261 transitions, 3511 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 13:04:47,206 INFO L231 Difference]: Finished difference. Result has 195 places, 214 transitions, 2838 flow [2024-06-14 13:04:47,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2634, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2838, PETRI_PLACES=195, PETRI_TRANSITIONS=214} [2024-06-14 13:04:47,207 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 153 predicate places. [2024-06-14 13:04:47,207 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 214 transitions, 2838 flow [2024-06-14 13:04:47,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:47,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:47,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:47,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 13:04:47,208 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:47,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1057536960, now seen corresponding path program 1 times [2024-06-14 13:04:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:47,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102739524] [2024-06-14 13:04:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:48,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102739524] [2024-06-14 13:04:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102739524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:48,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:48,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:48,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901880195] [2024-06-14 13:04:48,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:48,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:48,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:48,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:48,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:48,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 214 transitions, 2838 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:48,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:48,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:48,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:49,028 INFO L124 PetriNetUnfolderBase]: 2947/4543 cut-off events. [2024-06-14 13:04:49,028 INFO L125 PetriNetUnfolderBase]: For 238139/238141 co-relation queries the response was YES. [2024-06-14 13:04:49,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33525 conditions, 4543 events. 2947/4543 cut-off events. For 238139/238141 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24563 event pairs, 718 based on Foata normal form. 4/4545 useless extension candidates. Maximal degree in co-relation 33426. Up to 4276 conditions per place. [2024-06-14 13:04:49,074 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 205 selfloop transitions, 41 changer transitions 0/249 dead transitions. [2024-06-14 13:04:49,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 249 transitions, 3458 flow [2024-06-14 13:04:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-14 13:04:49,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-14 13:04:49,076 INFO L175 Difference]: Start difference. First operand has 195 places, 214 transitions, 2838 flow. Second operand 8 states and 140 transitions. [2024-06-14 13:04:49,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 249 transitions, 3458 flow [2024-06-14 13:04:49,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 249 transitions, 3274 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 13:04:49,431 INFO L231 Difference]: Finished difference. Result has 196 places, 216 transitions, 2787 flow [2024-06-14 13:04:49,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2654, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2787, PETRI_PLACES=196, PETRI_TRANSITIONS=216} [2024-06-14 13:04:49,432 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-14 13:04:49,432 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 216 transitions, 2787 flow [2024-06-14 13:04:49,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:49,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:49,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-14 13:04:49,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 13:04:49,433 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:49,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:49,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1051972770, now seen corresponding path program 2 times [2024-06-14 13:04:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:49,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420264812] [2024-06-14 13:04:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:50,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:50,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420264812] [2024-06-14 13:04:50,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420264812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:50,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:50,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:50,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791058396] [2024-06-14 13:04:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:50,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:50,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:50,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:50,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:50,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:50,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 216 transitions, 2787 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:50,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:50,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:50,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:51,332 INFO L124 PetriNetUnfolderBase]: 2964/4570 cut-off events. [2024-06-14 13:04:51,333 INFO L125 PetriNetUnfolderBase]: For 248674/248676 co-relation queries the response was YES. [2024-06-14 13:04:51,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33675 conditions, 4570 events. 2964/4570 cut-off events. For 248674/248676 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 24694 event pairs, 718 based on Foata normal form. 4/4572 useless extension candidates. Maximal degree in co-relation 33576. Up to 4303 conditions per place. [2024-06-14 13:04:51,374 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 207 selfloop transitions, 38 changer transitions 0/248 dead transitions. [2024-06-14 13:04:51,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 248 transitions, 3401 flow [2024-06-14 13:04:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-14 13:04:51,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 13:04:51,388 INFO L175 Difference]: Start difference. First operand has 196 places, 216 transitions, 2787 flow. Second operand 8 states and 136 transitions. [2024-06-14 13:04:51,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 248 transitions, 3401 flow [2024-06-14 13:04:51,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 248 transitions, 3292 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:51,664 INFO L231 Difference]: Finished difference. Result has 198 places, 218 transitions, 2809 flow [2024-06-14 13:04:51,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2678, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2809, PETRI_PLACES=198, PETRI_TRANSITIONS=218} [2024-06-14 13:04:51,665 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places. [2024-06-14 13:04:51,665 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 218 transitions, 2809 flow [2024-06-14 13:04:51,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:51,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:51,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:51,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 13:04:51,666 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:51,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:51,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1052180532, now seen corresponding path program 8 times [2024-06-14 13:04:51,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200975803] [2024-06-14 13:04:51,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:52,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200975803] [2024-06-14 13:04:52,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200975803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:52,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:52,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:52,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233904321] [2024-06-14 13:04:52,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:52,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:52,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:52,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:52,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 218 transitions, 2809 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:52,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:52,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:52,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:53,636 INFO L124 PetriNetUnfolderBase]: 3039/4695 cut-off events. [2024-06-14 13:04:53,636 INFO L125 PetriNetUnfolderBase]: For 275879/275881 co-relation queries the response was YES. [2024-06-14 13:04:53,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34659 conditions, 4695 events. 3039/4695 cut-off events. For 275879/275881 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25650 event pairs, 737 based on Foata normal form. 20/4713 useless extension candidates. Maximal degree in co-relation 34559. Up to 4276 conditions per place. [2024-06-14 13:04:53,690 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 208 selfloop transitions, 47 changer transitions 0/258 dead transitions. [2024-06-14 13:04:53,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 258 transitions, 3469 flow [2024-06-14 13:04:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-14 13:04:53,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-14 13:04:53,692 INFO L175 Difference]: Start difference. First operand has 198 places, 218 transitions, 2809 flow. Second operand 9 states and 155 transitions. [2024-06-14 13:04:53,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 258 transitions, 3469 flow [2024-06-14 13:04:53,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 258 transitions, 3362 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:53,986 INFO L231 Difference]: Finished difference. Result has 201 places, 219 transitions, 2837 flow [2024-06-14 13:04:53,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2702, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2837, PETRI_PLACES=201, PETRI_TRANSITIONS=219} [2024-06-14 13:04:53,989 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-06-14 13:04:53,989 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 219 transitions, 2837 flow [2024-06-14 13:04:53,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:53,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:53,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:53,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 13:04:53,989 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:53,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1051965330, now seen corresponding path program 3 times [2024-06-14 13:04:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:53,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576706959] [2024-06-14 13:04:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:54,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576706959] [2024-06-14 13:04:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576706959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:54,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:54,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679272579] [2024-06-14 13:04:54,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:54,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:54,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:54,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:54,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:54,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 219 transitions, 2837 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:54,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:54,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:54,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:55,797 INFO L124 PetriNetUnfolderBase]: 3056/4722 cut-off events. [2024-06-14 13:04:55,797 INFO L125 PetriNetUnfolderBase]: For 274086/274088 co-relation queries the response was YES. [2024-06-14 13:04:55,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35100 conditions, 4722 events. 3056/4722 cut-off events. For 274086/274088 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25846 event pairs, 720 based on Foata normal form. 4/4724 useless extension candidates. Maximal degree in co-relation 34999. Up to 4350 conditions per place. [2024-06-14 13:04:55,846 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 203 selfloop transitions, 45 changer transitions 0/251 dead transitions. [2024-06-14 13:04:55,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 251 transitions, 3454 flow [2024-06-14 13:04:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:04:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:04:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-14 13:04:55,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 13:04:55,848 INFO L175 Difference]: Start difference. First operand has 201 places, 219 transitions, 2837 flow. Second operand 8 states and 136 transitions. [2024-06-14 13:04:55,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 251 transitions, 3454 flow [2024-06-14 13:04:56,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 251 transitions, 3345 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 13:04:56,199 INFO L231 Difference]: Finished difference. Result has 202 places, 221 transitions, 2873 flow [2024-06-14 13:04:56,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2728, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2873, PETRI_PLACES=202, PETRI_TRANSITIONS=221} [2024-06-14 13:04:56,200 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-14 13:04:56,200 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 221 transitions, 2873 flow [2024-06-14 13:04:56,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:56,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:56,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:56,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 13:04:56,201 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:56,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1057542912, now seen corresponding path program 9 times [2024-06-14 13:04:56,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:56,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009994485] [2024-06-14 13:04:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:56,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:57,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009994485] [2024-06-14 13:04:57,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009994485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:57,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:57,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:04:57,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785327129] [2024-06-14 13:04:57,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:57,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:04:57,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:57,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:04:57,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:04:57,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:57,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 221 transitions, 2873 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:57,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:57,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:57,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:58,032 INFO L124 PetriNetUnfolderBase]: 3131/4847 cut-off events. [2024-06-14 13:04:58,032 INFO L125 PetriNetUnfolderBase]: For 301222/301224 co-relation queries the response was YES. [2024-06-14 13:04:58,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36021 conditions, 4847 events. 3131/4847 cut-off events. For 301222/301224 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26701 event pairs, 743 based on Foata normal form. 20/4865 useless extension candidates. Maximal degree in co-relation 35919. Up to 4428 conditions per place. [2024-06-14 13:04:58,084 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 210 selfloop transitions, 51 changer transitions 0/264 dead transitions. [2024-06-14 13:04:58,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 264 transitions, 3555 flow [2024-06-14 13:04:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:04:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:04:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-14 13:04:58,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-14 13:04:58,086 INFO L175 Difference]: Start difference. First operand has 202 places, 221 transitions, 2873 flow. Second operand 9 states and 159 transitions. [2024-06-14 13:04:58,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 264 transitions, 3555 flow [2024-06-14 13:04:58,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 264 transitions, 3433 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 13:04:58,423 INFO L231 Difference]: Finished difference. Result has 205 places, 222 transitions, 2896 flow [2024-06-14 13:04:58,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2751, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2896, PETRI_PLACES=205, PETRI_TRANSITIONS=222} [2024-06-14 13:04:58,424 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places. [2024-06-14 13:04:58,424 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 222 transitions, 2896 flow [2024-06-14 13:04:58,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:58,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:04:58,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:04:58,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 13:04:58,424 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:04:58,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:04:58,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1739753016, now seen corresponding path program 1 times [2024-06-14 13:04:58,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:04:58,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495933899] [2024-06-14 13:04:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:04:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:04:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:04:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:04:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:04:59,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495933899] [2024-06-14 13:04:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495933899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:04:59,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:04:59,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:04:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868188867] [2024-06-14 13:04:59,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:04:59,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:04:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:04:59,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:04:59,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:04:59,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:04:59,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 222 transitions, 2896 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:04:59,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:04:59,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:04:59,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:04:59,889 INFO L124 PetriNetUnfolderBase]: 3146/4867 cut-off events. [2024-06-14 13:04:59,889 INFO L125 PetriNetUnfolderBase]: For 295404/295404 co-relation queries the response was YES. [2024-06-14 13:04:59,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36395 conditions, 4867 events. 3146/4867 cut-off events. For 295404/295404 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26794 event pairs, 830 based on Foata normal form. 2/4867 useless extension candidates. Maximal degree in co-relation 36292. Up to 4805 conditions per place. [2024-06-14 13:04:59,939 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 224 selfloop transitions, 23 changer transitions 0/250 dead transitions. [2024-06-14 13:04:59,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 250 transitions, 3624 flow [2024-06-14 13:04:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:04:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:04:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-14 13:04:59,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-14 13:04:59,940 INFO L175 Difference]: Start difference. First operand has 205 places, 222 transitions, 2896 flow. Second operand 7 states and 114 transitions. [2024-06-14 13:04:59,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 250 transitions, 3624 flow [2024-06-14 13:05:00,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 250 transitions, 3501 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 13:05:00,317 INFO L231 Difference]: Finished difference. Result has 206 places, 230 transitions, 2927 flow [2024-06-14 13:05:00,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2773, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2927, PETRI_PLACES=206, PETRI_TRANSITIONS=230} [2024-06-14 13:05:00,318 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2024-06-14 13:05:00,318 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 230 transitions, 2927 flow [2024-06-14 13:05:00,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:00,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:00,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:00,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 13:05:00,319 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:00,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash -209054884, now seen corresponding path program 4 times [2024-06-14 13:05:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:00,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198265872] [2024-06-14 13:05:00,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:00,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:01,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198265872] [2024-06-14 13:05:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198265872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:01,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:01,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:05:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134194871] [2024-06-14 13:05:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:01,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:05:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:05:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:05:01,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:01,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 230 transitions, 2927 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:01,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:01,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:01,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:02,281 INFO L124 PetriNetUnfolderBase]: 3138/4856 cut-off events. [2024-06-14 13:05:02,281 INFO L125 PetriNetUnfolderBase]: For 300576/300578 co-relation queries the response was YES. [2024-06-14 13:05:02,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35951 conditions, 4856 events. 3138/4856 cut-off events. For 300576/300578 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26800 event pairs, 826 based on Foata normal form. 6/4860 useless extension candidates. Maximal degree in co-relation 35846. Up to 4765 conditions per place. [2024-06-14 13:05:02,335 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 237 selfloop transitions, 18 changer transitions 0/258 dead transitions. [2024-06-14 13:05:02,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 258 transitions, 3559 flow [2024-06-14 13:05:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:05:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:05:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-14 13:05:02,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-14 13:05:02,336 INFO L175 Difference]: Start difference. First operand has 206 places, 230 transitions, 2927 flow. Second operand 8 states and 127 transitions. [2024-06-14 13:05:02,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 258 transitions, 3559 flow [2024-06-14 13:05:02,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 258 transitions, 3519 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-14 13:05:02,744 INFO L231 Difference]: Finished difference. Result has 212 places, 232 transitions, 2988 flow [2024-06-14 13:05:02,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2887, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2988, PETRI_PLACES=212, PETRI_TRANSITIONS=232} [2024-06-14 13:05:02,744 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2024-06-14 13:05:02,744 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 232 transitions, 2988 flow [2024-06-14 13:05:02,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:02,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:02,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:02,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 13:05:02,745 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:02,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1545382830, now seen corresponding path program 5 times [2024-06-14 13:05:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997524489] [2024-06-14 13:05:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:03,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:03,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997524489] [2024-06-14 13:05:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997524489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:03,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:03,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:05:03,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569710568] [2024-06-14 13:05:03,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:03,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:05:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:03,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:05:03,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:05:03,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:03,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 232 transitions, 2988 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:03,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:03,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:03,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:04,696 INFO L124 PetriNetUnfolderBase]: 3155/4883 cut-off events. [2024-06-14 13:05:04,697 INFO L125 PetriNetUnfolderBase]: For 314092/314094 co-relation queries the response was YES. [2024-06-14 13:05:04,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36557 conditions, 4883 events. 3155/4883 cut-off events. For 314092/314094 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 26982 event pairs, 822 based on Foata normal form. 6/4887 useless extension candidates. Maximal degree in co-relation 36450. Up to 4747 conditions per place. [2024-06-14 13:05:04,752 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 229 selfloop transitions, 28 changer transitions 0/260 dead transitions. [2024-06-14 13:05:04,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 260 transitions, 3610 flow [2024-06-14 13:05:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:05:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:05:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-14 13:05:04,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:05:04,753 INFO L175 Difference]: Start difference. First operand has 212 places, 232 transitions, 2988 flow. Second operand 8 states and 128 transitions. [2024-06-14 13:05:04,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 260 transitions, 3610 flow [2024-06-14 13:05:05,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 260 transitions, 3512 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-14 13:05:05,244 INFO L231 Difference]: Finished difference. Result has 213 places, 234 transitions, 3000 flow [2024-06-14 13:05:05,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2890, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3000, PETRI_PLACES=213, PETRI_TRANSITIONS=234} [2024-06-14 13:05:05,245 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 171 predicate places. [2024-06-14 13:05:05,245 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 234 transitions, 3000 flow [2024-06-14 13:05:05,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:05,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:05,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:05,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 13:05:05,245 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:05,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1802091102, now seen corresponding path program 10 times [2024-06-14 13:05:05,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:05,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525778566] [2024-06-14 13:05:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:05,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525778566] [2024-06-14 13:05:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525778566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:06,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:06,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:05:06,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936261521] [2024-06-14 13:05:06,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:06,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:05:06,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:06,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:05:06,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:05:06,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:06,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 234 transitions, 3000 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:06,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:06,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:06,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:07,243 INFO L124 PetriNetUnfolderBase]: 3208/4982 cut-off events. [2024-06-14 13:05:07,244 INFO L125 PetriNetUnfolderBase]: For 350205/350207 co-relation queries the response was YES. [2024-06-14 13:05:07,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36593 conditions, 4982 events. 3208/4982 cut-off events. For 350205/350207 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 27769 event pairs, 829 based on Foata normal form. 40/5020 useless extension candidates. Maximal degree in co-relation 36486. Up to 4638 conditions per place. [2024-06-14 13:05:07,291 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 236 selfloop transitions, 32 changer transitions 0/271 dead transitions. [2024-06-14 13:05:07,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 271 transitions, 3702 flow [2024-06-14 13:05:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:05:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:05:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-14 13:05:07,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-14 13:05:07,293 INFO L175 Difference]: Start difference. First operand has 213 places, 234 transitions, 3000 flow. Second operand 9 states and 148 transitions. [2024-06-14 13:05:07,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 271 transitions, 3702 flow [2024-06-14 13:05:07,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 271 transitions, 3602 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-14 13:05:07,691 INFO L231 Difference]: Finished difference. Result has 217 places, 236 transitions, 3050 flow [2024-06-14 13:05:07,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2900, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3050, PETRI_PLACES=217, PETRI_TRANSITIONS=236} [2024-06-14 13:05:07,691 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places. [2024-06-14 13:05:07,691 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 236 transitions, 3050 flow [2024-06-14 13:05:07,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:07,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:07,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:07,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 13:05:07,692 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:07,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1536178620, now seen corresponding path program 6 times [2024-06-14 13:05:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:07,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267382914] [2024-06-14 13:05:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:07,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267382914] [2024-06-14 13:05:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267382914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:05:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563364081] [2024-06-14 13:05:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:08,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:05:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:08,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:05:08,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:05:08,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:08,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 236 transitions, 3050 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:08,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:08,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:08,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:09,491 INFO L124 PetriNetUnfolderBase]: 3225/5009 cut-off events. [2024-06-14 13:05:09,491 INFO L125 PetriNetUnfolderBase]: For 335055/335057 co-relation queries the response was YES. [2024-06-14 13:05:09,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37267 conditions, 5009 events. 3225/5009 cut-off events. For 335055/335057 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27954 event pairs, 804 based on Foata normal form. 6/5013 useless extension candidates. Maximal degree in co-relation 37158. Up to 4904 conditions per place. [2024-06-14 13:05:09,545 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 243 selfloop transitions, 18 changer transitions 0/264 dead transitions. [2024-06-14 13:05:09,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 264 transitions, 3682 flow [2024-06-14 13:05:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:05:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:05:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-14 13:05:09,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-14 13:05:09,546 INFO L175 Difference]: Start difference. First operand has 217 places, 236 transitions, 3050 flow. Second operand 8 states and 126 transitions. [2024-06-14 13:05:09,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 264 transitions, 3682 flow [2024-06-14 13:05:10,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 264 transitions, 3563 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-14 13:05:10,016 INFO L231 Difference]: Finished difference. Result has 217 places, 238 transitions, 3024 flow [2024-06-14 13:05:10,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2931, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3024, PETRI_PLACES=217, PETRI_TRANSITIONS=238} [2024-06-14 13:05:10,017 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places. [2024-06-14 13:05:10,017 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 238 transitions, 3024 flow [2024-06-14 13:05:10,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:10,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:10,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:10,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 13:05:10,018 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:10,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1801875900, now seen corresponding path program 7 times [2024-06-14 13:05:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:10,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082999495] [2024-06-14 13:05:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:10,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-14 13:05:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082999495] [2024-06-14 13:05:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082999495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:05:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293998704] [2024-06-14 13:05:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:10,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:05:10,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:05:10,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:05:10,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:10,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 238 transitions, 3024 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:10,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:10,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:10,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:11,980 INFO L124 PetriNetUnfolderBase]: 3217/4997 cut-off events. [2024-06-14 13:05:11,981 INFO L125 PetriNetUnfolderBase]: For 327779/327781 co-relation queries the response was YES. [2024-06-14 13:05:12,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36647 conditions, 4997 events. 3217/4997 cut-off events. For 327779/327781 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27917 event pairs, 838 based on Foata normal form. 6/5001 useless extension candidates. Maximal degree in co-relation 36538. Up to 4865 conditions per place. [2024-06-14 13:05:12,035 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 242 selfloop transitions, 21 changer transitions 0/266 dead transitions. [2024-06-14 13:05:12,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 266 transitions, 3669 flow [2024-06-14 13:05:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:05:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:05:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-14 13:05:12,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:05:12,037 INFO L175 Difference]: Start difference. First operand has 217 places, 238 transitions, 3024 flow. Second operand 8 states and 128 transitions. [2024-06-14 13:05:12,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 266 transitions, 3669 flow [2024-06-14 13:05:12,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 266 transitions, 3594 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 13:05:12,531 INFO L231 Difference]: Finished difference. Result has 219 places, 240 transitions, 3055 flow [2024-06-14 13:05:12,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2949, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3055, PETRI_PLACES=219, PETRI_TRANSITIONS=240} [2024-06-14 13:05:12,532 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 177 predicate places. [2024-06-14 13:05:12,532 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 240 transitions, 3055 flow [2024-06-14 13:05:12,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:12,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:12,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:12,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 13:05:12,532 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:12,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1545375390, now seen corresponding path program 8 times [2024-06-14 13:05:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:12,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028448114] [2024-06-14 13:05:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:13,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-14 13:05:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028448114] [2024-06-14 13:05:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028448114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:13,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:05:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663267319] [2024-06-14 13:05:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:13,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:05:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:13,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:05:13,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:05:13,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:13,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 240 transitions, 3055 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:13,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:13,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:13,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:14,318 INFO L124 PetriNetUnfolderBase]: 3209/4985 cut-off events. [2024-06-14 13:05:14,318 INFO L125 PetriNetUnfolderBase]: For 335986/335988 co-relation queries the response was YES. [2024-06-14 13:05:14,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36573 conditions, 4985 events. 3209/4985 cut-off events. For 335986/335988 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27836 event pairs, 826 based on Foata normal form. 6/4989 useless extension candidates. Maximal degree in co-relation 36463. Up to 4767 conditions per place. [2024-06-14 13:05:14,374 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 231 selfloop transitions, 34 changer transitions 0/268 dead transitions. [2024-06-14 13:05:14,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 268 transitions, 3703 flow [2024-06-14 13:05:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:05:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:05:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-14 13:05:14,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-14 13:05:14,375 INFO L175 Difference]: Start difference. First operand has 219 places, 240 transitions, 3055 flow. Second operand 8 states and 129 transitions. [2024-06-14 13:05:14,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 268 transitions, 3703 flow [2024-06-14 13:05:14,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 268 transitions, 3618 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-14 13:05:14,821 INFO L231 Difference]: Finished difference. Result has 221 places, 242 transitions, 3104 flow [2024-06-14 13:05:14,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3104, PETRI_PLACES=221, PETRI_TRANSITIONS=242} [2024-06-14 13:05:14,822 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places. [2024-06-14 13:05:14,822 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 242 transitions, 3104 flow [2024-06-14 13:05:14,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:14,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:14,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:14,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 13:05:14,822 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:14,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1353695200, now seen corresponding path program 2 times [2024-06-14 13:05:14,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:14,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952886346] [2024-06-14 13:05:14,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:15,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:15,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952886346] [2024-06-14 13:05:15,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952886346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:15,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:15,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:05:15,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788411035] [2024-06-14 13:05:15,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:15,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:05:15,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:15,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:05:15,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:05:15,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:15,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 242 transitions, 3104 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:15,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:15,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:15,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:16,333 INFO L124 PetriNetUnfolderBase]: 3219/4998 cut-off events. [2024-06-14 13:05:16,333 INFO L125 PetriNetUnfolderBase]: For 344848/344848 co-relation queries the response was YES. [2024-06-14 13:05:16,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36923 conditions, 4998 events. 3219/4998 cut-off events. For 344848/344848 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27849 event pairs, 844 based on Foata normal form. 2/4998 useless extension candidates. Maximal degree in co-relation 36812. Up to 4932 conditions per place. [2024-06-14 13:05:16,393 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 235 selfloop transitions, 26 changer transitions 0/264 dead transitions. [2024-06-14 13:05:16,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 264 transitions, 3821 flow [2024-06-14 13:05:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:05:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:05:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-14 13:05:16,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186991869918699 [2024-06-14 13:05:16,395 INFO L175 Difference]: Start difference. First operand has 221 places, 242 transitions, 3104 flow. Second operand 6 states and 103 transitions. [2024-06-14 13:05:16,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 264 transitions, 3821 flow [2024-06-14 13:05:16,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 264 transitions, 3715 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-14 13:05:16,899 INFO L231 Difference]: Finished difference. Result has 221 places, 245 transitions, 3101 flow [2024-06-14 13:05:16,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2998, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3101, PETRI_PLACES=221, PETRI_TRANSITIONS=245} [2024-06-14 13:05:16,900 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places. [2024-06-14 13:05:16,900 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 245 transitions, 3101 flow [2024-06-14 13:05:16,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:16,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:16,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 13:05:16,901 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:16,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2044131700, now seen corresponding path program 3 times [2024-06-14 13:05:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:16,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543412694] [2024-06-14 13:05:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:17,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:17,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543412694] [2024-06-14 13:05:17,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543412694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:17,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:17,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:05:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197304226] [2024-06-14 13:05:17,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:17,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:05:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:17,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:05:17,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:05:17,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:17,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 245 transitions, 3101 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:17,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:17,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:17,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:18,449 INFO L124 PetriNetUnfolderBase]: 3221/5001 cut-off events. [2024-06-14 13:05:18,450 INFO L125 PetriNetUnfolderBase]: For 352707/352707 co-relation queries the response was YES. [2024-06-14 13:05:18,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36898 conditions, 5001 events. 3221/5001 cut-off events. For 352707/352707 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27856 event pairs, 843 based on Foata normal form. 2/5001 useless extension candidates. Maximal degree in co-relation 36786. Up to 4973 conditions per place. [2024-06-14 13:05:18,505 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 242 selfloop transitions, 16 changer transitions 0/261 dead transitions. [2024-06-14 13:05:18,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 261 transitions, 3710 flow [2024-06-14 13:05:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:05:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:05:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-06-14 13:05:18,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37398373983739835 [2024-06-14 13:05:18,507 INFO L175 Difference]: Start difference. First operand has 221 places, 245 transitions, 3101 flow. Second operand 6 states and 92 transitions. [2024-06-14 13:05:18,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 261 transitions, 3710 flow [2024-06-14 13:05:18,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 261 transitions, 3652 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 13:05:18,993 INFO L231 Difference]: Finished difference. Result has 224 places, 251 transitions, 3162 flow [2024-06-14 13:05:18,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3049, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3162, PETRI_PLACES=224, PETRI_TRANSITIONS=251} [2024-06-14 13:05:18,993 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places. [2024-06-14 13:05:18,993 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 251 transitions, 3162 flow [2024-06-14 13:05:18,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:18,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:18,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:18,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 13:05:18,994 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:18,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash -846974204, now seen corresponding path program 1 times [2024-06-14 13:05:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:18,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119261575] [2024-06-14 13:05:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:19,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:19,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119261575] [2024-06-14 13:05:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119261575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:19,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:05:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991905104] [2024-06-14 13:05:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:19,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:05:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:19,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:05:19,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:05:19,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:19,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 251 transitions, 3162 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:19,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:19,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:19,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:20,637 INFO L124 PetriNetUnfolderBase]: 3231/5015 cut-off events. [2024-06-14 13:05:20,637 INFO L125 PetriNetUnfolderBase]: For 353753/353753 co-relation queries the response was YES. [2024-06-14 13:05:20,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37070 conditions, 5015 events. 3231/5015 cut-off events. For 353753/353753 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27969 event pairs, 841 based on Foata normal form. 2/5015 useless extension candidates. Maximal degree in co-relation 36957. Up to 4950 conditions per place. [2024-06-14 13:05:20,695 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 250 selfloop transitions, 23 changer transitions 0/276 dead transitions. [2024-06-14 13:05:20,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 276 transitions, 3940 flow [2024-06-14 13:05:20,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:05:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:05:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-14 13:05:20,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:05:20,696 INFO L175 Difference]: Start difference. First operand has 224 places, 251 transitions, 3162 flow. Second operand 7 states and 112 transitions. [2024-06-14 13:05:20,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 276 transitions, 3940 flow [2024-06-14 13:05:21,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 276 transitions, 3910 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-14 13:05:21,191 INFO L231 Difference]: Finished difference. Result has 229 places, 257 transitions, 3263 flow [2024-06-14 13:05:21,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3132, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3263, PETRI_PLACES=229, PETRI_TRANSITIONS=257} [2024-06-14 13:05:21,192 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2024-06-14 13:05:21,192 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 257 transitions, 3263 flow [2024-06-14 13:05:21,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:21,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:21,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:21,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 13:05:21,193 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:21,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1924145160, now seen corresponding path program 1 times [2024-06-14 13:05:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:21,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491651543] [2024-06-14 13:05:21,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:21,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491651543] [2024-06-14 13:05:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491651543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:05:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067284424] [2024-06-14 13:05:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:21,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:05:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:21,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:05:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:05:21,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:21,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 257 transitions, 3263 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:21,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:21,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:21,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:22,916 INFO L124 PetriNetUnfolderBase]: 3246/5036 cut-off events. [2024-06-14 13:05:22,916 INFO L125 PetriNetUnfolderBase]: For 366089/366089 co-relation queries the response was YES. [2024-06-14 13:05:22,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37752 conditions, 5036 events. 3246/5036 cut-off events. For 366089/366089 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 28063 event pairs, 842 based on Foata normal form. 2/5036 useless extension candidates. Maximal degree in co-relation 37637. Up to 4980 conditions per place. [2024-06-14 13:05:22,972 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 251 selfloop transitions, 25 changer transitions 0/279 dead transitions. [2024-06-14 13:05:22,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 279 transitions, 4041 flow [2024-06-14 13:05:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:05:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:05:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-14 13:05:22,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-14 13:05:22,973 INFO L175 Difference]: Start difference. First operand has 229 places, 257 transitions, 3263 flow. Second operand 7 states and 111 transitions. [2024-06-14 13:05:22,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 279 transitions, 4041 flow [2024-06-14 13:05:23,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 279 transitions, 3985 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-14 13:05:23,530 INFO L231 Difference]: Finished difference. Result has 234 places, 263 transitions, 3341 flow [2024-06-14 13:05:23,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3210, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3341, PETRI_PLACES=234, PETRI_TRANSITIONS=263} [2024-06-14 13:05:23,531 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-06-14 13:05:23,531 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 263 transitions, 3341 flow [2024-06-14 13:05:23,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:23,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:23,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:23,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 13:05:23,532 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:23,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:23,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1924145346, now seen corresponding path program 2 times [2024-06-14 13:05:23,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:23,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98661671] [2024-06-14 13:05:23,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:23,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:24,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98661671] [2024-06-14 13:05:24,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98661671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:24,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:24,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:05:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762519296] [2024-06-14 13:05:24,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:24,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:05:24,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:24,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:05:24,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:05:24,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:24,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 263 transitions, 3341 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:24,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:24,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:24,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:25,151 INFO L124 PetriNetUnfolderBase]: 3256/5050 cut-off events. [2024-06-14 13:05:25,152 INFO L125 PetriNetUnfolderBase]: For 377435/377435 co-relation queries the response was YES. [2024-06-14 13:05:25,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38033 conditions, 5050 events. 3256/5050 cut-off events. For 377435/377435 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 28152 event pairs, 840 based on Foata normal form. 2/5050 useless extension candidates. Maximal degree in co-relation 37915. Up to 5013 conditions per place. [2024-06-14 13:05:25,210 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 258 selfloop transitions, 19 changer transitions 0/280 dead transitions. [2024-06-14 13:05:25,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 280 transitions, 3965 flow [2024-06-14 13:05:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:05:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:05:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2024-06-14 13:05:25,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693379790940767 [2024-06-14 13:05:25,211 INFO L175 Difference]: Start difference. First operand has 234 places, 263 transitions, 3341 flow. Second operand 7 states and 106 transitions. [2024-06-14 13:05:25,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 280 transitions, 3965 flow [2024-06-14 13:05:25,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 280 transitions, 3903 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 13:05:25,778 INFO L231 Difference]: Finished difference. Result has 237 places, 266 transitions, 3363 flow [2024-06-14 13:05:25,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3279, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3363, PETRI_PLACES=237, PETRI_TRANSITIONS=266} [2024-06-14 13:05:25,779 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places. [2024-06-14 13:05:25,779 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 266 transitions, 3363 flow [2024-06-14 13:05:25,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:25,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:25,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:25,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 13:05:25,780 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:25,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:25,785 INFO L85 PathProgramCache]: Analyzing trace with hash 388453792, now seen corresponding path program 2 times [2024-06-14 13:05:25,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:25,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024875526] [2024-06-14 13:05:25,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:25,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:26,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:26,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024875526] [2024-06-14 13:05:26,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024875526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:26,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:26,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:05:26,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696213926] [2024-06-14 13:05:26,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:26,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:05:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:26,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:05:26,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:05:26,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:26,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 266 transitions, 3363 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:26,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:26,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:26,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:27,454 INFO L124 PetriNetUnfolderBase]: 3266/5064 cut-off events. [2024-06-14 13:05:27,455 INFO L125 PetriNetUnfolderBase]: For 388335/388335 co-relation queries the response was YES. [2024-06-14 13:05:27,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38301 conditions, 5064 events. 3266/5064 cut-off events. For 388335/388335 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 28202 event pairs, 841 based on Foata normal form. 2/5064 useless extension candidates. Maximal degree in co-relation 38183. Up to 5004 conditions per place. [2024-06-14 13:05:27,508 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 253 selfloop transitions, 28 changer transitions 0/284 dead transitions. [2024-06-14 13:05:27,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 284 transitions, 4111 flow [2024-06-14 13:05:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:05:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:05:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-14 13:05:27,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-14 13:05:27,510 INFO L175 Difference]: Start difference. First operand has 237 places, 266 transitions, 3363 flow. Second operand 6 states and 100 transitions. [2024-06-14 13:05:27,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 284 transitions, 4111 flow [2024-06-14 13:05:28,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 284 transitions, 4047 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 13:05:28,088 INFO L231 Difference]: Finished difference. Result has 237 places, 269 transitions, 3395 flow [2024-06-14 13:05:28,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3299, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3395, PETRI_PLACES=237, PETRI_TRANSITIONS=269} [2024-06-14 13:05:28,089 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places. [2024-06-14 13:05:28,089 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 269 transitions, 3395 flow [2024-06-14 13:05:28,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:28,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:28,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:28,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 13:05:28,090 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:28,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:28,090 INFO L85 PathProgramCache]: Analyzing trace with hash 388453606, now seen corresponding path program 3 times [2024-06-14 13:05:28,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:28,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745226908] [2024-06-14 13:05:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:28,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745226908] [2024-06-14 13:05:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745226908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:28,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:28,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:05:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481546464] [2024-06-14 13:05:28,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:28,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:05:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:05:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:05:28,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:28,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 269 transitions, 3395 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:28,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:28,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:28,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:29,719 INFO L124 PetriNetUnfolderBase]: 3260/5056 cut-off events. [2024-06-14 13:05:29,719 INFO L125 PetriNetUnfolderBase]: For 396084/396084 co-relation queries the response was YES. [2024-06-14 13:05:29,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38340 conditions, 5056 events. 3260/5056 cut-off events. For 396084/396084 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 28156 event pairs, 838 based on Foata normal form. 2/5056 useless extension candidates. Maximal degree in co-relation 38222. Up to 4995 conditions per place. [2024-06-14 13:05:29,867 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 256 selfloop transitions, 26 changer transitions 0/285 dead transitions. [2024-06-14 13:05:29,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 285 transitions, 4001 flow [2024-06-14 13:05:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:05:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:05:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-14 13:05:29,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-14 13:05:29,869 INFO L175 Difference]: Start difference. First operand has 237 places, 269 transitions, 3395 flow. Second operand 6 states and 99 transitions. [2024-06-14 13:05:29,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 285 transitions, 4001 flow [2024-06-14 13:05:30,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 285 transitions, 3938 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 13:05:30,417 INFO L231 Difference]: Finished difference. Result has 239 places, 269 transitions, 3400 flow [2024-06-14 13:05:30,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3332, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3400, PETRI_PLACES=239, PETRI_TRANSITIONS=269} [2024-06-14 13:05:30,418 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 197 predicate places. [2024-06-14 13:05:30,418 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 269 transitions, 3400 flow [2024-06-14 13:05:30,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:30,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:30,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:30,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 13:05:30,419 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:30,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:30,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2044137652, now seen corresponding path program 3 times [2024-06-14 13:05:30,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635037632] [2024-06-14 13:05:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:30,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:31,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:31,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635037632] [2024-06-14 13:05:31,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635037632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:31,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:31,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:05:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742505794] [2024-06-14 13:05:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:31,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:05:31,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:31,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:05:31,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:05:31,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:31,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 269 transitions, 3400 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:31,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:31,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:31,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:31,977 INFO L124 PetriNetUnfolderBase]: 3254/5049 cut-off events. [2024-06-14 13:05:31,977 INFO L125 PetriNetUnfolderBase]: For 393140/393142 co-relation queries the response was YES. [2024-06-14 13:05:32,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38178 conditions, 5049 events. 3254/5049 cut-off events. For 393140/393142 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 28127 event pairs, 844 based on Foata normal form. 4/5051 useless extension candidates. Maximal degree in co-relation 38060. Up to 4991 conditions per place. [2024-06-14 13:05:32,035 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 250 selfloop transitions, 27 changer transitions 0/280 dead transitions. [2024-06-14 13:05:32,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 280 transitions, 3984 flow [2024-06-14 13:05:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:05:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:05:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-06-14 13:05:32,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-14 13:05:32,037 INFO L175 Difference]: Start difference. First operand has 239 places, 269 transitions, 3400 flow. Second operand 6 states and 94 transitions. [2024-06-14 13:05:32,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 280 transitions, 3984 flow [2024-06-14 13:05:32,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 280 transitions, 3924 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 13:05:32,714 INFO L231 Difference]: Finished difference. Result has 240 places, 269 transitions, 3401 flow [2024-06-14 13:05:32,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3340, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3401, PETRI_PLACES=240, PETRI_TRANSITIONS=269} [2024-06-14 13:05:32,715 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-06-14 13:05:32,715 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 269 transitions, 3401 flow [2024-06-14 13:05:32,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:32,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:32,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:05:32,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 13:05:32,715 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:32,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2044146580, now seen corresponding path program 1 times [2024-06-14 13:05:32,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:32,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989952335] [2024-06-14 13:05:32,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:32,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:33,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989952335] [2024-06-14 13:05:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989952335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:05:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892152522] [2024-06-14 13:05:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:33,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:05:33,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:33,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:05:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:05:33,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:33,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 269 transitions, 3401 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:33,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:33,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:33,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:34,819 INFO L124 PetriNetUnfolderBase]: 3249/5041 cut-off events. [2024-06-14 13:05:34,820 INFO L125 PetriNetUnfolderBase]: For 389238/389238 co-relation queries the response was YES. [2024-06-14 13:05:34,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38016 conditions, 5041 events. 3249/5041 cut-off events. For 389238/389238 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 27997 event pairs, 837 based on Foata normal form. 2/5041 useless extension candidates. Maximal degree in co-relation 37897. Up to 5013 conditions per place. [2024-06-14 13:05:34,870 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 264 selfloop transitions, 14 changer transitions 0/281 dead transitions. [2024-06-14 13:05:34,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 281 transitions, 4009 flow [2024-06-14 13:05:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:05:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:05:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-06-14 13:05:34,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2024-06-14 13:05:34,877 INFO L175 Difference]: Start difference. First operand has 240 places, 269 transitions, 3401 flow. Second operand 6 states and 91 transitions. [2024-06-14 13:05:34,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 281 transitions, 4009 flow [2024-06-14 13:05:35,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 281 transitions, 3929 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 13:05:35,379 INFO L231 Difference]: Finished difference. Result has 240 places, 271 transitions, 3386 flow [2024-06-14 13:05:35,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3321, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3386, PETRI_PLACES=240, PETRI_TRANSITIONS=271} [2024-06-14 13:05:35,379 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-06-14 13:05:35,379 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 271 transitions, 3386 flow [2024-06-14 13:05:35,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:35,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:35,380 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-14 13:05:35,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 13:05:35,380 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:35,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 681678921, now seen corresponding path program 1 times [2024-06-14 13:05:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298879531] [2024-06-14 13:05:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:36,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-14 13:05:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298879531] [2024-06-14 13:05:36,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298879531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:36,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:05:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316272801] [2024-06-14 13:05:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:36,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:05:36,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:36,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:05:36,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:05:36,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:36,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 271 transitions, 3386 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:36,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:36,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:36,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:37,626 INFO L124 PetriNetUnfolderBase]: 3229/5010 cut-off events. [2024-06-14 13:05:37,627 INFO L125 PetriNetUnfolderBase]: For 397558/397560 co-relation queries the response was YES. [2024-06-14 13:05:37,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37402 conditions, 5010 events. 3229/5010 cut-off events. For 397558/397560 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 27848 event pairs, 715 based on Foata normal form. 12/5020 useless extension candidates. Maximal degree in co-relation 37283. Up to 4629 conditions per place. [2024-06-14 13:05:37,687 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 258 selfloop transitions, 47 changer transitions 0/308 dead transitions. [2024-06-14 13:05:37,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 308 transitions, 4124 flow [2024-06-14 13:05:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:05:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:05:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-14 13:05:37,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 13:05:37,689 INFO L175 Difference]: Start difference. First operand has 240 places, 271 transitions, 3386 flow. Second operand 9 states and 153 transitions. [2024-06-14 13:05:37,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 308 transitions, 4124 flow [2024-06-14 13:05:38,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 308 transitions, 4059 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 13:05:38,318 INFO L231 Difference]: Finished difference. Result has 245 places, 272 transitions, 3453 flow [2024-06-14 13:05:38,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3329, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3453, PETRI_PLACES=245, PETRI_TRANSITIONS=272} [2024-06-14 13:05:38,320 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 203 predicate places. [2024-06-14 13:05:38,320 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 272 transitions, 3453 flow [2024-06-14 13:05:38,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:38,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:38,320 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-14 13:05:38,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 13:05:38,321 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:38,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1911496460, now seen corresponding path program 1 times [2024-06-14 13:05:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:38,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550728863] [2024-06-14 13:05:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:39,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:39,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550728863] [2024-06-14 13:05:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550728863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:39,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:05:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448757206] [2024-06-14 13:05:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:39,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:05:39,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:05:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:05:39,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:39,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 272 transitions, 3453 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:39,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:39,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:39,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:40,056 INFO L124 PetriNetUnfolderBase]: 3325/5144 cut-off events. [2024-06-14 13:05:40,056 INFO L125 PetriNetUnfolderBase]: For 408710/408712 co-relation queries the response was YES. [2024-06-14 13:05:40,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38583 conditions, 5144 events. 3325/5144 cut-off events. For 408710/408712 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 28540 event pairs, 815 based on Foata normal form. 10/5152 useless extension candidates. Maximal degree in co-relation 38463. Up to 4644 conditions per place. [2024-06-14 13:05:40,119 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 220 selfloop transitions, 106 changer transitions 0/329 dead transitions. [2024-06-14 13:05:40,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 329 transitions, 4729 flow [2024-06-14 13:05:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:05:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:05:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-14 13:05:40,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-14 13:05:40,146 INFO L175 Difference]: Start difference. First operand has 245 places, 272 transitions, 3453 flow. Second operand 8 states and 147 transitions. [2024-06-14 13:05:40,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 329 transitions, 4729 flow [2024-06-14 13:05:40,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 329 transitions, 4625 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 13:05:40,880 INFO L231 Difference]: Finished difference. Result has 247 places, 298 transitions, 3883 flow [2024-06-14 13:05:40,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3349, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3883, PETRI_PLACES=247, PETRI_TRANSITIONS=298} [2024-06-14 13:05:40,881 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 205 predicate places. [2024-06-14 13:05:40,881 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 298 transitions, 3883 flow [2024-06-14 13:05:40,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:40,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:40,881 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-14 13:05:40,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 13:05:40,881 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:40,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash -192656405, now seen corresponding path program 2 times [2024-06-14 13:05:40,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:40,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772616497] [2024-06-14 13:05:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:40,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:42,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772616497] [2024-06-14 13:05:42,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772616497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:42,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:42,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:05:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601022057] [2024-06-14 13:05:42,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:42,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:05:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:42,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:05:42,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:05:42,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:42,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 298 transitions, 3883 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:42,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:42,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:42,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:43,217 INFO L124 PetriNetUnfolderBase]: 3366/5215 cut-off events. [2024-06-14 13:05:43,217 INFO L125 PetriNetUnfolderBase]: For 427479/427481 co-relation queries the response was YES. [2024-06-14 13:05:43,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39837 conditions, 5215 events. 3366/5215 cut-off events. For 427479/427481 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 29072 event pairs, 735 based on Foata normal form. 12/5225 useless extension candidates. Maximal degree in co-relation 39715. Up to 4879 conditions per place. [2024-06-14 13:05:43,278 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 294 selfloop transitions, 42 changer transitions 0/339 dead transitions. [2024-06-14 13:05:43,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 339 transitions, 4707 flow [2024-06-14 13:05:43,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:05:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:05:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-14 13:05:43,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-14 13:05:43,279 INFO L175 Difference]: Start difference. First operand has 247 places, 298 transitions, 3883 flow. Second operand 9 states and 155 transitions. [2024-06-14 13:05:43,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 339 transitions, 4707 flow [2024-06-14 13:05:44,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 339 transitions, 4636 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-14 13:05:44,068 INFO L231 Difference]: Finished difference. Result has 254 places, 299 transitions, 3944 flow [2024-06-14 13:05:44,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3812, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3944, PETRI_PLACES=254, PETRI_TRANSITIONS=299} [2024-06-14 13:05:44,069 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places. [2024-06-14 13:05:44,069 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 299 transitions, 3944 flow [2024-06-14 13:05:44,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:44,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:44,069 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-14 13:05:44,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 13:05:44,070 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:44,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:44,070 INFO L85 PathProgramCache]: Analyzing trace with hash -20166515, now seen corresponding path program 3 times [2024-06-14 13:05:44,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:44,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071768090] [2024-06-14 13:05:44,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:44,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:45,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:45,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071768090] [2024-06-14 13:05:45,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071768090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:45,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:45,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:05:45,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966955653] [2024-06-14 13:05:45,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:45,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:05:45,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:45,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:05:45,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:05:45,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:45,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 299 transitions, 3944 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:45,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:45,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:45,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:46,480 INFO L124 PetriNetUnfolderBase]: 3407/5286 cut-off events. [2024-06-14 13:05:46,480 INFO L125 PetriNetUnfolderBase]: For 443080/443082 co-relation queries the response was YES. [2024-06-14 13:05:46,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40630 conditions, 5286 events. 3407/5286 cut-off events. For 443080/443082 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 29643 event pairs, 759 based on Foata normal form. 12/5296 useless extension candidates. Maximal degree in co-relation 40506. Up to 4923 conditions per place. [2024-06-14 13:05:46,544 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 288 selfloop transitions, 46 changer transitions 0/337 dead transitions. [2024-06-14 13:05:46,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 337 transitions, 4758 flow [2024-06-14 13:05:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:05:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:05:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-14 13:05:46,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41192411924119243 [2024-06-14 13:05:46,545 INFO L175 Difference]: Start difference. First operand has 254 places, 299 transitions, 3944 flow. Second operand 9 states and 152 transitions. [2024-06-14 13:05:46,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 337 transitions, 4758 flow [2024-06-14 13:05:47,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 337 transitions, 4662 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 13:05:47,147 INFO L231 Difference]: Finished difference. Result has 257 places, 300 transitions, 3990 flow [2024-06-14 13:05:47,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3848, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3990, PETRI_PLACES=257, PETRI_TRANSITIONS=300} [2024-06-14 13:05:47,147 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-14 13:05:47,147 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 300 transitions, 3990 flow [2024-06-14 13:05:47,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:47,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:47,148 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-14 13:05:47,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 13:05:47,148 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:47,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash -19935875, now seen corresponding path program 4 times [2024-06-14 13:05:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:47,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495782654] [2024-06-14 13:05:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:48,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-14 13:05:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495782654] [2024-06-14 13:05:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495782654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:48,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:05:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975009411] [2024-06-14 13:05:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:48,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:05:48,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:48,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:05:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:05:48,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:48,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 300 transitions, 3990 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:48,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:48,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:48,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:49,360 INFO L124 PetriNetUnfolderBase]: 3448/5357 cut-off events. [2024-06-14 13:05:49,361 INFO L125 PetriNetUnfolderBase]: For 456797/456799 co-relation queries the response was YES. [2024-06-14 13:05:49,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41130 conditions, 5357 events. 3448/5357 cut-off events. For 456797/456799 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 30255 event pairs, 755 based on Foata normal form. 12/5367 useless extension candidates. Maximal degree in co-relation 41005. Up to 4889 conditions per place. [2024-06-14 13:05:49,424 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 282 selfloop transitions, 53 changer transitions 0/338 dead transitions. [2024-06-14 13:05:49,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 338 transitions, 4793 flow [2024-06-14 13:05:49,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:05:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:05:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-14 13:05:49,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41192411924119243 [2024-06-14 13:05:49,426 INFO L175 Difference]: Start difference. First operand has 257 places, 300 transitions, 3990 flow. Second operand 9 states and 152 transitions. [2024-06-14 13:05:49,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 338 transitions, 4793 flow [2024-06-14 13:05:50,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 338 transitions, 4671 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 13:05:50,120 INFO L231 Difference]: Finished difference. Result has 259 places, 301 transitions, 4013 flow [2024-06-14 13:05:50,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3868, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4013, PETRI_PLACES=259, PETRI_TRANSITIONS=301} [2024-06-14 13:05:50,120 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places. [2024-06-14 13:05:50,120 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 301 transitions, 4013 flow [2024-06-14 13:05:50,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:50,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:50,121 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-14 13:05:50,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 13:05:50,121 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:50,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash -720787030, now seen corresponding path program 2 times [2024-06-14 13:05:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:50,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686571332] [2024-06-14 13:05:50,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:50,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686571332] [2024-06-14 13:05:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686571332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:50,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:50,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:05:50,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463447543] [2024-06-14 13:05:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:50,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:05:50,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:05:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:05:50,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:50,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 301 transitions, 4013 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:50,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:50,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:50,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:51,957 INFO L124 PetriNetUnfolderBase]: 3701/5710 cut-off events. [2024-06-14 13:05:51,957 INFO L125 PetriNetUnfolderBase]: For 488439/488441 co-relation queries the response was YES. [2024-06-14 13:05:52,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44450 conditions, 5710 events. 3701/5710 cut-off events. For 488439/488441 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32335 event pairs, 879 based on Foata normal form. 6/5714 useless extension candidates. Maximal degree in co-relation 44324. Up to 5022 conditions per place. [2024-06-14 13:05:52,029 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 243 selfloop transitions, 132 changer transitions 0/378 dead transitions. [2024-06-14 13:05:52,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 378 transitions, 5749 flow [2024-06-14 13:05:52,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:05:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:05:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-14 13:05:52,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-14 13:05:52,031 INFO L175 Difference]: Start difference. First operand has 259 places, 301 transitions, 4013 flow. Second operand 8 states and 140 transitions. [2024-06-14 13:05:52,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 378 transitions, 5749 flow [2024-06-14 13:05:52,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 378 transitions, 5621 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 13:05:52,765 INFO L231 Difference]: Finished difference. Result has 262 places, 345 transitions, 4772 flow [2024-06-14 13:05:52,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3885, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4772, PETRI_PLACES=262, PETRI_TRANSITIONS=345} [2024-06-14 13:05:52,765 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 220 predicate places. [2024-06-14 13:05:52,766 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 345 transitions, 4772 flow [2024-06-14 13:05:52,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:52,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:52,766 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-14 13:05:52,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 13:05:52,766 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:52,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash 279310620, now seen corresponding path program 3 times [2024-06-14 13:05:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:52,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792817035] [2024-06-14 13:05:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792817035] [2024-06-14 13:05:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792817035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:53,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:53,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:05:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606829361] [2024-06-14 13:05:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:53,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:05:53,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:53,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:05:53,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:05:53,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:53,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 345 transitions, 4772 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:53,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:53,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:53,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:54,659 INFO L124 PetriNetUnfolderBase]: 3669/5666 cut-off events. [2024-06-14 13:05:54,659 INFO L125 PetriNetUnfolderBase]: For 492339/492341 co-relation queries the response was YES. [2024-06-14 13:05:54,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44353 conditions, 5666 events. 3669/5666 cut-off events. For 492339/492341 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31996 event pairs, 887 based on Foata normal form. 10/5674 useless extension candidates. Maximal degree in co-relation 44224. Up to 5002 conditions per place. [2024-06-14 13:05:54,730 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 246 selfloop transitions, 130 changer transitions 0/379 dead transitions. [2024-06-14 13:05:54,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 379 transitions, 6018 flow [2024-06-14 13:05:54,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:05:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:05:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-14 13:05:54,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-14 13:05:54,732 INFO L175 Difference]: Start difference. First operand has 262 places, 345 transitions, 4772 flow. Second operand 8 states and 141 transitions. [2024-06-14 13:05:54,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 379 transitions, 6018 flow [2024-06-14 13:05:55,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 379 transitions, 5846 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-14 13:05:55,462 INFO L231 Difference]: Finished difference. Result has 269 places, 352 transitions, 5070 flow [2024-06-14 13:05:55,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4600, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5070, PETRI_PLACES=269, PETRI_TRANSITIONS=352} [2024-06-14 13:05:55,463 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 227 predicate places. [2024-06-14 13:05:55,463 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 352 transitions, 5070 flow [2024-06-14 13:05:55,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:55,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:55,463 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-14 13:05:55,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 13:05:55,463 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:55,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:55,464 INFO L85 PathProgramCache]: Analyzing trace with hash -662225941, now seen corresponding path program 5 times [2024-06-14 13:05:55,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:55,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720469595] [2024-06-14 13:05:55,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:55,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:05:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:05:56,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:05:56,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720469595] [2024-06-14 13:05:56,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720469595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:05:56,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:05:56,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:05:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313627120] [2024-06-14 13:05:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:05:56,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:05:56,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:05:56,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:05:56,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:05:56,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:05:56,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 352 transitions, 5070 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:56,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:05:56,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:05:56,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:05:57,899 INFO L124 PetriNetUnfolderBase]: 3690/5705 cut-off events. [2024-06-14 13:05:57,900 INFO L125 PetriNetUnfolderBase]: For 511975/511977 co-relation queries the response was YES. [2024-06-14 13:05:57,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44207 conditions, 5705 events. 3690/5705 cut-off events. For 511975/511977 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 32394 event pairs, 848 based on Foata normal form. 26/5729 useless extension candidates. Maximal degree in co-relation 44075. Up to 5431 conditions per place. [2024-06-14 13:05:57,966 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 354 selfloop transitions, 30 changer transitions 0/387 dead transitions. [2024-06-14 13:05:57,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 387 transitions, 6002 flow [2024-06-14 13:05:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:05:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:05:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-14 13:05:57,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875338753387534 [2024-06-14 13:05:57,968 INFO L175 Difference]: Start difference. First operand has 269 places, 352 transitions, 5070 flow. Second operand 9 states and 143 transitions. [2024-06-14 13:05:57,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 387 transitions, 6002 flow [2024-06-14 13:05:58,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 387 transitions, 5739 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-14 13:05:58,803 INFO L231 Difference]: Finished difference. Result has 273 places, 354 transitions, 4951 flow [2024-06-14 13:05:58,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4819, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4951, PETRI_PLACES=273, PETRI_TRANSITIONS=354} [2024-06-14 13:05:58,804 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places. [2024-06-14 13:05:58,804 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 354 transitions, 4951 flow [2024-06-14 13:05:58,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:05:58,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:05:58,804 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-14 13:05:58,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 13:05:58,805 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:05:58,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:05:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1383779347, now seen corresponding path program 6 times [2024-06-14 13:05:58,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:05:58,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602590982] [2024-06-14 13:05:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:05:58,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:05:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:00,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-14 13:06:00,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:00,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602590982] [2024-06-14 13:06:00,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602590982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:00,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:00,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:06:00,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268584433] [2024-06-14 13:06:00,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:00,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:06:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:00,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:06:00,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:06:00,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:00,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 354 transitions, 4951 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:00,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:00,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:00,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:01,453 INFO L124 PetriNetUnfolderBase]: 3711/5744 cut-off events. [2024-06-14 13:06:01,453 INFO L125 PetriNetUnfolderBase]: For 504074/504076 co-relation queries the response was YES. [2024-06-14 13:06:01,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43321 conditions, 5744 events. 3711/5744 cut-off events. For 504074/504076 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 32780 event pairs, 844 based on Foata normal form. 26/5768 useless extension candidates. Maximal degree in co-relation 43189. Up to 5388 conditions per place. [2024-06-14 13:06:01,525 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 349 selfloop transitions, 36 changer transitions 0/388 dead transitions. [2024-06-14 13:06:01,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 388 transitions, 5841 flow [2024-06-14 13:06:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:06:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:06:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-14 13:06:01,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:06:01,526 INFO L175 Difference]: Start difference. First operand has 273 places, 354 transitions, 4951 flow. Second operand 9 states and 144 transitions. [2024-06-14 13:06:01,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 388 transitions, 5841 flow [2024-06-14 13:06:02,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 388 transitions, 5737 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-14 13:06:02,381 INFO L231 Difference]: Finished difference. Result has 275 places, 355 transitions, 4959 flow [2024-06-14 13:06:02,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4847, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4959, PETRI_PLACES=275, PETRI_TRANSITIONS=355} [2024-06-14 13:06:02,382 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places. [2024-06-14 13:06:02,382 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 355 transitions, 4959 flow [2024-06-14 13:06:02,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:02,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:02,382 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-14 13:06:02,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 13:06:02,383 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:02,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1375735777, now seen corresponding path program 7 times [2024-06-14 13:06:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:02,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195759253] [2024-06-14 13:06:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:02,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:03,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:03,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195759253] [2024-06-14 13:06:03,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195759253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:03,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:03,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:06:03,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034763181] [2024-06-14 13:06:03,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:03,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:06:03,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:06:03,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:06:03,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:03,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 355 transitions, 4959 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:03,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:03,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:03,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:04,595 INFO L124 PetriNetUnfolderBase]: 3691/5712 cut-off events. [2024-06-14 13:06:04,595 INFO L125 PetriNetUnfolderBase]: For 467953/467955 co-relation queries the response was YES. [2024-06-14 13:06:04,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42396 conditions, 5712 events. 3691/5712 cut-off events. For 467953/467955 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 32473 event pairs, 845 based on Foata normal form. 14/5724 useless extension candidates. Maximal degree in co-relation 42263. Up to 5538 conditions per place. [2024-06-14 13:06:04,663 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 365 selfloop transitions, 19 changer transitions 0/387 dead transitions. [2024-06-14 13:06:04,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 387 transitions, 5699 flow [2024-06-14 13:06:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:06:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:06:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-14 13:06:04,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3794037940379404 [2024-06-14 13:06:04,665 INFO L175 Difference]: Start difference. First operand has 275 places, 355 transitions, 4959 flow. Second operand 9 states and 140 transitions. [2024-06-14 13:06:04,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 387 transitions, 5699 flow [2024-06-14 13:06:05,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 387 transitions, 5497 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-14 13:06:05,482 INFO L231 Difference]: Finished difference. Result has 274 places, 354 transitions, 4683 flow [2024-06-14 13:06:05,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4641, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4683, PETRI_PLACES=274, PETRI_TRANSITIONS=354} [2024-06-14 13:06:05,483 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places. [2024-06-14 13:06:05,483 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 354 transitions, 4683 flow [2024-06-14 13:06:05,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:05,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:05,483 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-14 13:06:05,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 13:06:05,484 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:05,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1586755340, now seen corresponding path program 4 times [2024-06-14 13:06:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760508950] [2024-06-14 13:06:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:06,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-14 13:06:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760508950] [2024-06-14 13:06:06,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760508950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:06,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:06,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991431494] [2024-06-14 13:06:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:06,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:06,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:06,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:06,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:06,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 354 transitions, 4683 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:06,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:06,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:06,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:07,318 INFO L124 PetriNetUnfolderBase]: 3699/5724 cut-off events. [2024-06-14 13:06:07,318 INFO L125 PetriNetUnfolderBase]: For 451731/451733 co-relation queries the response was YES. [2024-06-14 13:06:07,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41282 conditions, 5724 events. 3699/5724 cut-off events. For 451731/451733 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32644 event pairs, 846 based on Foata normal form. 10/5732 useless extension candidates. Maximal degree in co-relation 41150. Up to 5048 conditions per place. [2024-06-14 13:06:07,376 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 228 selfloop transitions, 155 changer transitions 0/386 dead transitions. [2024-06-14 13:06:07,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 386 transitions, 5857 flow [2024-06-14 13:06:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:06:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:06:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-14 13:06:07,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564459930313589 [2024-06-14 13:06:07,378 INFO L175 Difference]: Start difference. First operand has 274 places, 354 transitions, 4683 flow. Second operand 7 states and 131 transitions. [2024-06-14 13:06:07,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 386 transitions, 5857 flow [2024-06-14 13:06:08,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 386 transitions, 5785 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 13:06:08,131 INFO L231 Difference]: Finished difference. Result has 274 places, 358 transitions, 5015 flow [2024-06-14 13:06:08,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4615, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5015, PETRI_PLACES=274, PETRI_TRANSITIONS=358} [2024-06-14 13:06:08,132 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places. [2024-06-14 13:06:08,132 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 358 transitions, 5015 flow [2024-06-14 13:06:08,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:08,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:08,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:06:08,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 13:06:08,133 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:08,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1069313268, now seen corresponding path program 5 times [2024-06-14 13:06:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:08,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283447019] [2024-06-14 13:06:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:08,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:08,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283447019] [2024-06-14 13:06:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283447019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:08,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:08,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120676780] [2024-06-14 13:06:08,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:08,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:08,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:08,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:08,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:08,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 358 transitions, 5015 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:08,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:08,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:08,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:09,969 INFO L124 PetriNetUnfolderBase]: 3771/5824 cut-off events. [2024-06-14 13:06:09,970 INFO L125 PetriNetUnfolderBase]: For 454875/454877 co-relation queries the response was YES. [2024-06-14 13:06:10,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42871 conditions, 5824 events. 3771/5824 cut-off events. For 454875/454877 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 33233 event pairs, 854 based on Foata normal form. 6/5828 useless extension candidates. Maximal degree in co-relation 42738. Up to 5086 conditions per place. [2024-06-14 13:06:10,045 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 241 selfloop transitions, 147 changer transitions 0/391 dead transitions. [2024-06-14 13:06:10,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 391 transitions, 6300 flow [2024-06-14 13:06:10,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:06:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:06:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-14 13:06:10,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 13:06:10,047 INFO L175 Difference]: Start difference. First operand has 274 places, 358 transitions, 5015 flow. Second operand 7 states and 123 transitions. [2024-06-14 13:06:10,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 391 transitions, 6300 flow [2024-06-14 13:06:10,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 391 transitions, 6021 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-14 13:06:10,811 INFO L231 Difference]: Finished difference. Result has 278 places, 369 transitions, 5293 flow [2024-06-14 13:06:10,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4755, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5293, PETRI_PLACES=278, PETRI_TRANSITIONS=369} [2024-06-14 13:06:10,811 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 236 predicate places. [2024-06-14 13:06:10,812 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 369 transitions, 5293 flow [2024-06-14 13:06:10,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:10,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:10,812 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-14 13:06:10,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 13:06:10,812 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:10,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1056412835, now seen corresponding path program 1 times [2024-06-14 13:06:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:10,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881828822] [2024-06-14 13:06:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:11,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:11,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881828822] [2024-06-14 13:06:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881828822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:11,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:11,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856334099] [2024-06-14 13:06:11,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:11,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:11,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:11,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:11,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:11,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:11,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 369 transitions, 5293 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:11,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:11,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:11,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:12,812 INFO L124 PetriNetUnfolderBase]: 3768/5819 cut-off events. [2024-06-14 13:06:12,812 INFO L125 PetriNetUnfolderBase]: For 446193/446193 co-relation queries the response was YES. [2024-06-14 13:06:12,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43039 conditions, 5819 events. 3768/5819 cut-off events. For 446193/446193 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 33168 event pairs, 891 based on Foata normal form. 1/5818 useless extension candidates. Maximal degree in co-relation 42904. Up to 5788 conditions per place. [2024-06-14 13:06:12,886 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 358 selfloop transitions, 18 changer transitions 0/379 dead transitions. [2024-06-14 13:06:12,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 379 transitions, 6071 flow [2024-06-14 13:06:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:06:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:06:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-06-14 13:06:12,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2024-06-14 13:06:12,887 INFO L175 Difference]: Start difference. First operand has 278 places, 369 transitions, 5293 flow. Second operand 6 states and 91 transitions. [2024-06-14 13:06:12,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 379 transitions, 6071 flow [2024-06-14 13:06:13,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 379 transitions, 5881 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-14 13:06:13,614 INFO L231 Difference]: Finished difference. Result has 280 places, 369 transitions, 5149 flow [2024-06-14 13:06:13,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5103, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5149, PETRI_PLACES=280, PETRI_TRANSITIONS=369} [2024-06-14 13:06:13,615 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places. [2024-06-14 13:06:13,615 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 369 transitions, 5149 flow [2024-06-14 13:06:13,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:13,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:13,615 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-14 13:06:13,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 13:06:13,616 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:13,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1056426258, now seen corresponding path program 6 times [2024-06-14 13:06:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:13,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213369507] [2024-06-14 13:06:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:14,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-14 13:06:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:14,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213369507] [2024-06-14 13:06:14,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213369507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:14,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:14,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907903384] [2024-06-14 13:06:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:14,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:14,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:14,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 369 transitions, 5149 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:14,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:14,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:14,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:15,441 INFO L124 PetriNetUnfolderBase]: 3793/5854 cut-off events. [2024-06-14 13:06:15,441 INFO L125 PetriNetUnfolderBase]: For 456665/456667 co-relation queries the response was YES. [2024-06-14 13:06:15,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42789 conditions, 5854 events. 3793/5854 cut-off events. For 456665/456667 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 33395 event pairs, 893 based on Foata normal form. 6/5858 useless extension candidates. Maximal degree in co-relation 42654. Up to 5730 conditions per place. [2024-06-14 13:06:15,524 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 351 selfloop transitions, 46 changer transitions 0/400 dead transitions. [2024-06-14 13:06:15,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 400 transitions, 6351 flow [2024-06-14 13:06:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:06:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:06:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-14 13:06:15,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-14 13:06:15,525 INFO L175 Difference]: Start difference. First operand has 280 places, 369 transitions, 5149 flow. Second operand 7 states and 109 transitions. [2024-06-14 13:06:15,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 400 transitions, 6351 flow [2024-06-14 13:06:16,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 400 transitions, 6295 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 13:06:16,255 INFO L231 Difference]: Finished difference. Result has 284 places, 387 transitions, 5482 flow [2024-06-14 13:06:16,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5095, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5482, PETRI_PLACES=284, PETRI_TRANSITIONS=387} [2024-06-14 13:06:16,256 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 242 predicate places. [2024-06-14 13:06:16,256 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 387 transitions, 5482 flow [2024-06-14 13:06:16,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:16,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:16,257 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-14 13:06:16,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 13:06:16,257 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:16,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash 365752762, now seen corresponding path program 1 times [2024-06-14 13:06:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:16,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899270342] [2024-06-14 13:06:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899270342] [2024-06-14 13:06:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899270342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:16,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:16,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19406604] [2024-06-14 13:06:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:16,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:16,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:16,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:16,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 387 transitions, 5482 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:16,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:16,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:16,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:18,363 INFO L124 PetriNetUnfolderBase]: 3813/5881 cut-off events. [2024-06-14 13:06:18,363 INFO L125 PetriNetUnfolderBase]: For 457550/457550 co-relation queries the response was YES. [2024-06-14 13:06:18,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43371 conditions, 5881 events. 3813/5881 cut-off events. For 457550/457550 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 33523 event pairs, 897 based on Foata normal form. 4/5883 useless extension candidates. Maximal degree in co-relation 43233. Up to 5730 conditions per place. [2024-06-14 13:06:18,439 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 363 selfloop transitions, 50 changer transitions 0/416 dead transitions. [2024-06-14 13:06:18,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 416 transitions, 6582 flow [2024-06-14 13:06:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:06:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:06:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-14 13:06:18,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-14 13:06:18,441 INFO L175 Difference]: Start difference. First operand has 284 places, 387 transitions, 5482 flow. Second operand 8 states and 130 transitions. [2024-06-14 13:06:18,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 416 transitions, 6582 flow [2024-06-14 13:06:19,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 416 transitions, 6506 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-06-14 13:06:19,387 INFO L231 Difference]: Finished difference. Result has 290 places, 393 transitions, 5590 flow [2024-06-14 13:06:19,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5410, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5590, PETRI_PLACES=290, PETRI_TRANSITIONS=393} [2024-06-14 13:06:19,388 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 248 predicate places. [2024-06-14 13:06:19,388 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 393 transitions, 5590 flow [2024-06-14 13:06:19,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:19,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:19,388 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-14 13:06:19,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 13:06:19,389 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:19,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash 481042852, now seen corresponding path program 2 times [2024-06-14 13:06:19,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:19,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143453467] [2024-06-14 13:06:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:19,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:20,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:20,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143453467] [2024-06-14 13:06:20,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143453467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:20,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:20,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:20,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073372244] [2024-06-14 13:06:20,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:20,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:20,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:20,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:20,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:20,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:20,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 393 transitions, 5590 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:20,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:20,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:20,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:21,584 INFO L124 PetriNetUnfolderBase]: 3865/5953 cut-off events. [2024-06-14 13:06:21,584 INFO L125 PetriNetUnfolderBase]: For 481972/481972 co-relation queries the response was YES. [2024-06-14 13:06:21,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44301 conditions, 5953 events. 3865/5953 cut-off events. For 481972/481972 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 33958 event pairs, 899 based on Foata normal form. 4/5955 useless extension candidates. Maximal degree in co-relation 44161. Up to 5850 conditions per place. [2024-06-14 13:06:21,658 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 376 selfloop transitions, 43 changer transitions 0/422 dead transitions. [2024-06-14 13:06:21,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 422 transitions, 6715 flow [2024-06-14 13:06:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:06:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:06:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2024-06-14 13:06:21,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36097560975609755 [2024-06-14 13:06:21,660 INFO L175 Difference]: Start difference. First operand has 290 places, 393 transitions, 5590 flow. Second operand 10 states and 148 transitions. [2024-06-14 13:06:21,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 422 transitions, 6715 flow [2024-06-14 13:06:22,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 422 transitions, 6592 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-14 13:06:22,536 INFO L231 Difference]: Finished difference. Result has 295 places, 399 transitions, 5646 flow [2024-06-14 13:06:22,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5483, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5646, PETRI_PLACES=295, PETRI_TRANSITIONS=399} [2024-06-14 13:06:22,537 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 253 predicate places. [2024-06-14 13:06:22,537 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 399 transitions, 5646 flow [2024-06-14 13:06:22,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:22,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:22,537 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-14 13:06:22,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 13:06:22,538 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:22,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:22,538 INFO L85 PathProgramCache]: Analyzing trace with hash -482676624, now seen corresponding path program 3 times [2024-06-14 13:06:22,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:22,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282344824] [2024-06-14 13:06:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:22,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:23,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282344824] [2024-06-14 13:06:23,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282344824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:23,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:23,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151061340] [2024-06-14 13:06:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:23,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:23,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:23,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 399 transitions, 5646 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:23,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:23,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:23,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:24,723 INFO L124 PetriNetUnfolderBase]: 3853/5937 cut-off events. [2024-06-14 13:06:24,723 INFO L125 PetriNetUnfolderBase]: For 483919/483919 co-relation queries the response was YES. [2024-06-14 13:06:24,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43997 conditions, 5937 events. 3853/5937 cut-off events. For 483919/483919 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 33872 event pairs, 895 based on Foata normal form. 4/5939 useless extension candidates. Maximal degree in co-relation 43856. Up to 5842 conditions per place. [2024-06-14 13:06:24,786 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 373 selfloop transitions, 42 changer transitions 0/418 dead transitions. [2024-06-14 13:06:24,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 418 transitions, 6533 flow [2024-06-14 13:06:24,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:06:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:06:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-14 13:06:24,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-14 13:06:24,788 INFO L175 Difference]: Start difference. First operand has 295 places, 399 transitions, 5646 flow. Second operand 8 states and 126 transitions. [2024-06-14 13:06:24,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 418 transitions, 6533 flow [2024-06-14 13:06:25,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 418 transitions, 6448 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 13:06:25,722 INFO L231 Difference]: Finished difference. Result has 297 places, 399 transitions, 5651 flow [2024-06-14 13:06:25,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5561, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5651, PETRI_PLACES=297, PETRI_TRANSITIONS=399} [2024-06-14 13:06:25,722 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 255 predicate places. [2024-06-14 13:06:25,723 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 399 transitions, 5651 flow [2024-06-14 13:06:25,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:25,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:25,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:06:25,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 13:06:25,723 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:25,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1056241560, now seen corresponding path program 4 times [2024-06-14 13:06:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427635134] [2024-06-14 13:06:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:26,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427635134] [2024-06-14 13:06:26,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427635134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:26,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:26,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:26,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230361324] [2024-06-14 13:06:26,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:26,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:26,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:26,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:26,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:26,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:26,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 399 transitions, 5651 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:26,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:26,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:26,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:27,739 INFO L124 PetriNetUnfolderBase]: 3873/5966 cut-off events. [2024-06-14 13:06:27,739 INFO L125 PetriNetUnfolderBase]: For 496958/496960 co-relation queries the response was YES. [2024-06-14 13:06:27,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44329 conditions, 5966 events. 3873/5966 cut-off events. For 496958/496960 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 34090 event pairs, 897 based on Foata normal form. 6/5970 useless extension candidates. Maximal degree in co-relation 44186. Up to 5802 conditions per place. [2024-06-14 13:06:27,819 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 365 selfloop transitions, 56 changer transitions 0/424 dead transitions. [2024-06-14 13:06:27,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 424 transitions, 6740 flow [2024-06-14 13:06:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:06:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:06:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-14 13:06:27,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3685636856368564 [2024-06-14 13:06:27,827 INFO L175 Difference]: Start difference. First operand has 297 places, 399 transitions, 5651 flow. Second operand 9 states and 136 transitions. [2024-06-14 13:06:27,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 424 transitions, 6740 flow [2024-06-14 13:06:28,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 424 transitions, 6656 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-14 13:06:28,768 INFO L231 Difference]: Finished difference. Result has 299 places, 402 transitions, 5724 flow [2024-06-14 13:06:28,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5567, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5724, PETRI_PLACES=299, PETRI_TRANSITIONS=402} [2024-06-14 13:06:28,769 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2024-06-14 13:06:28,769 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 402 transitions, 5724 flow [2024-06-14 13:06:28,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:28,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:28,769 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-14 13:06:28,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 13:06:28,770 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:28,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1063593210, now seen corresponding path program 5 times [2024-06-14 13:06:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:28,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577975520] [2024-06-14 13:06:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:29,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577975520] [2024-06-14 13:06:29,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577975520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:29,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:29,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:29,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824765700] [2024-06-14 13:06:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:29,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:29,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:29,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:29,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:29,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:29,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 402 transitions, 5724 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:29,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:29,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:29,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:30,857 INFO L124 PetriNetUnfolderBase]: 3893/5993 cut-off events. [2024-06-14 13:06:30,857 INFO L125 PetriNetUnfolderBase]: For 510418/510418 co-relation queries the response was YES. [2024-06-14 13:06:30,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44758 conditions, 5993 events. 3893/5993 cut-off events. For 510418/510418 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34198 event pairs, 895 based on Foata normal form. 4/5995 useless extension candidates. Maximal degree in co-relation 44614. Up to 5818 conditions per place. [2024-06-14 13:06:30,938 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 368 selfloop transitions, 60 changer transitions 0/431 dead transitions. [2024-06-14 13:06:30,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 431 transitions, 6847 flow [2024-06-14 13:06:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:06:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:06:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-14 13:06:30,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875338753387534 [2024-06-14 13:06:30,940 INFO L175 Difference]: Start difference. First operand has 299 places, 402 transitions, 5724 flow. Second operand 9 states and 143 transitions. [2024-06-14 13:06:30,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 431 transitions, 6847 flow [2024-06-14 13:06:31,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 431 transitions, 6677 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 13:06:31,771 INFO L231 Difference]: Finished difference. Result has 301 places, 405 transitions, 5730 flow [2024-06-14 13:06:31,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5568, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5730, PETRI_PLACES=301, PETRI_TRANSITIONS=405} [2024-06-14 13:06:31,771 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2024-06-14 13:06:31,771 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 405 transitions, 5730 flow [2024-06-14 13:06:31,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:31,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:31,772 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-14 13:06:31,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 13:06:31,772 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:31,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1063598790, now seen corresponding path program 6 times [2024-06-14 13:06:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:31,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215991829] [2024-06-14 13:06:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:32,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:32,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215991829] [2024-06-14 13:06:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215991829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:32,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:32,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678890475] [2024-06-14 13:06:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:32,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:32,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:32,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:32,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 405 transitions, 5730 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:32,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:32,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:32,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:33,828 INFO L124 PetriNetUnfolderBase]: 3881/5977 cut-off events. [2024-06-14 13:06:33,828 INFO L125 PetriNetUnfolderBase]: For 511433/511433 co-relation queries the response was YES. [2024-06-14 13:06:33,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44468 conditions, 5977 events. 3881/5977 cut-off events. For 511433/511433 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34088 event pairs, 891 based on Foata normal form. 4/5979 useless extension candidates. Maximal degree in co-relation 44323. Up to 5810 conditions per place. [2024-06-14 13:06:33,909 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 364 selfloop transitions, 58 changer transitions 0/425 dead transitions. [2024-06-14 13:06:33,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 425 transitions, 6630 flow [2024-06-14 13:06:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:06:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:06:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-14 13:06:33,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-14 13:06:33,911 INFO L175 Difference]: Start difference. First operand has 301 places, 405 transitions, 5730 flow. Second operand 7 states and 117 transitions. [2024-06-14 13:06:33,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 425 transitions, 6630 flow [2024-06-14 13:06:34,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 425 transitions, 6479 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 13:06:34,781 INFO L231 Difference]: Finished difference. Result has 300 places, 405 transitions, 5705 flow [2024-06-14 13:06:34,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5579, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5705, PETRI_PLACES=300, PETRI_TRANSITIONS=405} [2024-06-14 13:06:34,781 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 258 predicate places. [2024-06-14 13:06:34,781 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 405 transitions, 5705 flow [2024-06-14 13:06:34,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:34,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:34,782 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-14 13:06:34,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 13:06:34,782 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:34,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:34,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1047045795, now seen corresponding path program 1 times [2024-06-14 13:06:34,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:34,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233960920] [2024-06-14 13:06:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:34,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233960920] [2024-06-14 13:06:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233960920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:35,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:35,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562533966] [2024-06-14 13:06:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:35,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:35,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:35,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 405 transitions, 5705 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:35,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:35,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:35,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:36,728 INFO L124 PetriNetUnfolderBase]: 3949/6072 cut-off events. [2024-06-14 13:06:36,728 INFO L125 PetriNetUnfolderBase]: For 529697/529699 co-relation queries the response was YES. [2024-06-14 13:06:36,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45620 conditions, 6072 events. 3949/6072 cut-off events. For 529697/529699 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 34686 event pairs, 816 based on Foata normal form. 4/6074 useless extension candidates. Maximal degree in co-relation 45475. Up to 5647 conditions per place. [2024-06-14 13:06:36,813 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 381 selfloop transitions, 68 changer transitions 0/452 dead transitions. [2024-06-14 13:06:36,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 452 transitions, 7271 flow [2024-06-14 13:06:36,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:06:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:06:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-14 13:06:36,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-14 13:06:36,815 INFO L175 Difference]: Start difference. First operand has 300 places, 405 transitions, 5705 flow. Second operand 8 states and 139 transitions. [2024-06-14 13:06:36,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 452 transitions, 7271 flow [2024-06-14 13:06:37,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 452 transitions, 7136 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 13:06:37,752 INFO L231 Difference]: Finished difference. Result has 303 places, 423 transitions, 6048 flow [2024-06-14 13:06:37,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5583, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6048, PETRI_PLACES=303, PETRI_TRANSITIONS=423} [2024-06-14 13:06:37,752 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 261 predicate places. [2024-06-14 13:06:37,752 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 423 transitions, 6048 flow [2024-06-14 13:06:37,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:37,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:37,753 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-14 13:06:37,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 13:06:37,753 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:37,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1046925825, now seen corresponding path program 2 times [2024-06-14 13:06:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:37,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456193371] [2024-06-14 13:06:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:38,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456193371] [2024-06-14 13:06:38,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456193371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:38,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:38,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957740481] [2024-06-14 13:06:38,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:38,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:38,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:38,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:38,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:38,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:38,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 423 transitions, 6048 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:38,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:38,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:38,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:39,827 INFO L124 PetriNetUnfolderBase]: 3979/6114 cut-off events. [2024-06-14 13:06:39,827 INFO L125 PetriNetUnfolderBase]: For 534702/534704 co-relation queries the response was YES. [2024-06-14 13:06:39,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47085 conditions, 6114 events. 3979/6114 cut-off events. For 534702/534704 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 34967 event pairs, 907 based on Foata normal form. 6/6118 useless extension candidates. Maximal degree in co-relation 46938. Up to 5941 conditions per place. [2024-06-14 13:06:39,911 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 394 selfloop transitions, 55 changer transitions 0/452 dead transitions. [2024-06-14 13:06:39,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 452 transitions, 7179 flow [2024-06-14 13:06:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:06:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:06:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-14 13:06:39,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-14 13:06:39,913 INFO L175 Difference]: Start difference. First operand has 303 places, 423 transitions, 6048 flow. Second operand 8 states and 129 transitions. [2024-06-14 13:06:39,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 452 transitions, 7179 flow [2024-06-14 13:06:40,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 452 transitions, 7040 flow, removed 58 selfloop flow, removed 2 redundant places. [2024-06-14 13:06:40,952 INFO L231 Difference]: Finished difference. Result has 309 places, 431 transitions, 6211 flow [2024-06-14 13:06:40,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5933, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6211, PETRI_PLACES=309, PETRI_TRANSITIONS=431} [2024-06-14 13:06:40,952 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 267 predicate places. [2024-06-14 13:06:40,952 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 431 transitions, 6211 flow [2024-06-14 13:06:40,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:40,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:40,953 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-14 13:06:40,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 13:06:40,953 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:40,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:40,953 INFO L85 PathProgramCache]: Analyzing trace with hash -21007361, now seen corresponding path program 1 times [2024-06-14 13:06:40,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:40,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614445610] [2024-06-14 13:06:40,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:40,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:41,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614445610] [2024-06-14 13:06:41,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614445610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:41,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:41,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:41,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722097344] [2024-06-14 13:06:41,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:41,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:41,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:41,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:41,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:41,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:41,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 431 transitions, 6211 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:41,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:41,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:41,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:42,912 INFO L124 PetriNetUnfolderBase]: 4029/6184 cut-off events. [2024-06-14 13:06:42,912 INFO L125 PetriNetUnfolderBase]: For 555232/555234 co-relation queries the response was YES. [2024-06-14 13:06:42,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47716 conditions, 6184 events. 4029/6184 cut-off events. For 555232/555234 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 35375 event pairs, 875 based on Foata normal form. 8/6190 useless extension candidates. Maximal degree in co-relation 47566. Up to 5393 conditions per place. [2024-06-14 13:06:42,992 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 285 selfloop transitions, 185 changer transitions 0/473 dead transitions. [2024-06-14 13:06:42,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 473 transitions, 7787 flow [2024-06-14 13:06:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:06:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:06:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-14 13:06:42,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-14 13:06:42,994 INFO L175 Difference]: Start difference. First operand has 309 places, 431 transitions, 6211 flow. Second operand 8 states and 143 transitions. [2024-06-14 13:06:42,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 473 transitions, 7787 flow [2024-06-14 13:06:44,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 473 transitions, 7628 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-14 13:06:44,125 INFO L231 Difference]: Finished difference. Result has 313 places, 447 transitions, 6722 flow [2024-06-14 13:06:44,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6052, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6722, PETRI_PLACES=313, PETRI_TRANSITIONS=447} [2024-06-14 13:06:44,126 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 271 predicate places. [2024-06-14 13:06:44,126 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 447 transitions, 6722 flow [2024-06-14 13:06:44,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:44,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:44,126 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-14 13:06:44,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 13:06:44,127 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:44,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash -869794305, now seen corresponding path program 3 times [2024-06-14 13:06:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291180359] [2024-06-14 13:06:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:44,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:44,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291180359] [2024-06-14 13:06:44,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291180359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:44,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:44,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391761445] [2024-06-14 13:06:44,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:44,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:44,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:44,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:44,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 447 transitions, 6722 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:44,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:44,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:44,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:46,346 INFO L124 PetriNetUnfolderBase]: 4081/6256 cut-off events. [2024-06-14 13:06:46,346 INFO L125 PetriNetUnfolderBase]: For 578259/578261 co-relation queries the response was YES. [2024-06-14 13:06:46,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49301 conditions, 6256 events. 4081/6256 cut-off events. For 578259/578261 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 35822 event pairs, 899 based on Foata normal form. 6/6260 useless extension candidates. Maximal degree in co-relation 49149. Up to 6037 conditions per place. [2024-06-14 13:06:46,424 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 416 selfloop transitions, 59 changer transitions 0/478 dead transitions. [2024-06-14 13:06:46,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 478 transitions, 8080 flow [2024-06-14 13:06:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:06:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:06:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-14 13:06:46,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3794037940379404 [2024-06-14 13:06:46,426 INFO L175 Difference]: Start difference. First operand has 313 places, 447 transitions, 6722 flow. Second operand 9 states and 140 transitions. [2024-06-14 13:06:46,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 478 transitions, 8080 flow [2024-06-14 13:06:47,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 478 transitions, 7679 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 13:06:47,456 INFO L231 Difference]: Finished difference. Result has 318 places, 456 transitions, 6645 flow [2024-06-14 13:06:47,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6321, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6645, PETRI_PLACES=318, PETRI_TRANSITIONS=456} [2024-06-14 13:06:47,457 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 276 predicate places. [2024-06-14 13:06:47,457 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 456 transitions, 6645 flow [2024-06-14 13:06:47,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:47,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:47,457 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-14 13:06:47,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 13:06:47,457 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:47,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash -869794119, now seen corresponding path program 2 times [2024-06-14 13:06:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752540208] [2024-06-14 13:06:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:48,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:48,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752540208] [2024-06-14 13:06:48,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752540208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:48,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:48,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836004614] [2024-06-14 13:06:48,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:48,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:48,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:48,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:48,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:48,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 456 transitions, 6645 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:48,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:48,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:48,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:49,550 INFO L124 PetriNetUnfolderBase]: 4111/6298 cut-off events. [2024-06-14 13:06:49,550 INFO L125 PetriNetUnfolderBase]: For 595866/595868 co-relation queries the response was YES. [2024-06-14 13:06:49,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49421 conditions, 6298 events. 4111/6298 cut-off events. For 595866/595868 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 35972 event pairs, 894 based on Foata normal form. 8/6304 useless extension candidates. Maximal degree in co-relation 49267. Up to 5487 conditions per place. [2024-06-14 13:06:49,630 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 311 selfloop transitions, 173 changer transitions 0/487 dead transitions. [2024-06-14 13:06:49,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 487 transitions, 8263 flow [2024-06-14 13:06:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:06:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:06:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-14 13:06:49,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-14 13:06:49,631 INFO L175 Difference]: Start difference. First operand has 318 places, 456 transitions, 6645 flow. Second operand 8 states and 141 transitions. [2024-06-14 13:06:49,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 487 transitions, 8263 flow [2024-06-14 13:06:50,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 487 transitions, 8106 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-06-14 13:06:50,774 INFO L231 Difference]: Finished difference. Result has 322 places, 463 transitions, 6972 flow [2024-06-14 13:06:50,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6488, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6972, PETRI_PLACES=322, PETRI_TRANSITIONS=463} [2024-06-14 13:06:50,774 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 280 predicate places. [2024-06-14 13:06:50,774 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 463 transitions, 6972 flow [2024-06-14 13:06:50,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:50,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:50,775 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-14 13:06:50,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 13:06:50,775 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:50,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash -869556969, now seen corresponding path program 3 times [2024-06-14 13:06:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:50,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363550104] [2024-06-14 13:06:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:51,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363550104] [2024-06-14 13:06:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363550104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:51,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:51,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465225909] [2024-06-14 13:06:51,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:51,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:51,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:51,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 463 transitions, 6972 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:51,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:51,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:51,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:52,847 INFO L124 PetriNetUnfolderBase]: 4089/6268 cut-off events. [2024-06-14 13:06:52,847 INFO L125 PetriNetUnfolderBase]: For 593103/593105 co-relation queries the response was YES. [2024-06-14 13:06:52,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49197 conditions, 6268 events. 4089/6268 cut-off events. For 593103/593105 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 35836 event pairs, 881 based on Foata normal form. 8/6274 useless extension candidates. Maximal degree in co-relation 49043. Up to 5471 conditions per place. [2024-06-14 13:06:52,923 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 305 selfloop transitions, 178 changer transitions 0/486 dead transitions. [2024-06-14 13:06:52,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 486 transitions, 8312 flow [2024-06-14 13:06:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:06:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:06:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-14 13:06:52,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-14 13:06:52,925 INFO L175 Difference]: Start difference. First operand has 322 places, 463 transitions, 6972 flow. Second operand 8 states and 140 transitions. [2024-06-14 13:06:52,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 486 transitions, 8312 flow [2024-06-14 13:06:54,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 486 transitions, 8007 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 13:06:54,073 INFO L231 Difference]: Finished difference. Result has 322 places, 463 transitions, 7046 flow [2024-06-14 13:06:54,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6675, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7046, PETRI_PLACES=322, PETRI_TRANSITIONS=463} [2024-06-14 13:06:54,073 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 280 predicate places. [2024-06-14 13:06:54,074 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 463 transitions, 7046 flow [2024-06-14 13:06:54,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:54,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:54,075 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-14 13:06:54,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 13:06:54,075 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:54,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash -869548041, now seen corresponding path program 1 times [2024-06-14 13:06:54,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:54,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144905281] [2024-06-14 13:06:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:55,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:55,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144905281] [2024-06-14 13:06:55,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144905281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:55,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:55,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:06:55,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839770218] [2024-06-14 13:06:55,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:55,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:06:55,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:55,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:06:55,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:06:55,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:55,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 463 transitions, 7046 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:55,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:55,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:55,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:56,529 INFO L124 PetriNetUnfolderBase]: 4097/6279 cut-off events. [2024-06-14 13:06:56,529 INFO L125 PetriNetUnfolderBase]: For 567967/567967 co-relation queries the response was YES. [2024-06-14 13:06:56,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49143 conditions, 6279 events. 4097/6279 cut-off events. For 567967/567967 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 35956 event pairs, 886 based on Foata normal form. 2/6279 useless extension candidates. Maximal degree in co-relation 48991. Up to 6209 conditions per place. [2024-06-14 13:06:56,616 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 449 selfloop transitions, 33 changer transitions 0/485 dead transitions. [2024-06-14 13:06:56,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 485 transitions, 8104 flow [2024-06-14 13:06:56,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:06:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:06:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-14 13:06:56,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 13:06:56,618 INFO L175 Difference]: Start difference. First operand has 322 places, 463 transitions, 7046 flow. Second operand 8 states and 123 transitions. [2024-06-14 13:06:56,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 485 transitions, 8104 flow [2024-06-14 13:06:57,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 485 transitions, 7806 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 13:06:57,835 INFO L231 Difference]: Finished difference. Result has 325 places, 465 transitions, 6865 flow [2024-06-14 13:06:57,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6748, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6865, PETRI_PLACES=325, PETRI_TRANSITIONS=465} [2024-06-14 13:06:57,835 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 283 predicate places. [2024-06-14 13:06:57,835 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 465 transitions, 6865 flow [2024-06-14 13:06:57,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:57,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:06:57,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:06:57,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 13:06:57,836 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:06:57,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:06:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1900521531, now seen corresponding path program 4 times [2024-06-14 13:06:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:06:57,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149006757] [2024-06-14 13:06:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:06:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:06:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:06:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:06:58,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:06:58,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149006757] [2024-06-14 13:06:58,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149006757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:06:58,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:06:58,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:06:58,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701325962] [2024-06-14 13:06:58,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:06:58,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:06:58,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:06:58,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:06:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:06:58,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:06:58,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 465 transitions, 6865 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:06:58,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:06:58,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:06:58,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:06:59,870 INFO L124 PetriNetUnfolderBase]: 4123/6315 cut-off events. [2024-06-14 13:06:59,870 INFO L125 PetriNetUnfolderBase]: For 588409/588409 co-relation queries the response was YES. [2024-06-14 13:06:59,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49370 conditions, 6315 events. 4123/6315 cut-off events. For 588409/588409 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 36162 event pairs, 891 based on Foata normal form. 2/6315 useless extension candidates. Maximal degree in co-relation 49217. Up to 6227 conditions per place. [2024-06-14 13:06:59,962 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 458 selfloop transitions, 33 changer transitions 0/494 dead transitions. [2024-06-14 13:06:59,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 494 transitions, 8187 flow [2024-06-14 13:06:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:06:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:06:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-14 13:06:59,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-14 13:06:59,963 INFO L175 Difference]: Start difference. First operand has 325 places, 465 transitions, 6865 flow. Second operand 8 states and 126 transitions. [2024-06-14 13:06:59,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 494 transitions, 8187 flow [2024-06-14 13:07:01,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 494 transitions, 8086 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 13:07:01,306 INFO L231 Difference]: Finished difference. Result has 327 places, 471 transitions, 6962 flow [2024-06-14 13:07:01,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6764, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6962, PETRI_PLACES=327, PETRI_TRANSITIONS=471} [2024-06-14 13:07:01,306 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 285 predicate places. [2024-06-14 13:07:01,306 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 471 transitions, 6962 flow [2024-06-14 13:07:01,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:01,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:01,307 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-14 13:07:01,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 13:07:01,307 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:01,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1911949371, now seen corresponding path program 5 times [2024-06-14 13:07:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:01,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505312765] [2024-06-14 13:07:01,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:01,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:01,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505312765] [2024-06-14 13:07:01,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505312765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:01,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:01,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:01,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660812015] [2024-06-14 13:07:01,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:01,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:02,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:02,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 471 transitions, 6962 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:02,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:02,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:02,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:03,402 INFO L124 PetriNetUnfolderBase]: 4133/6329 cut-off events. [2024-06-14 13:07:03,402 INFO L125 PetriNetUnfolderBase]: For 603763/603763 co-relation queries the response was YES. [2024-06-14 13:07:03,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49738 conditions, 6329 events. 4133/6329 cut-off events. For 603763/603763 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 36239 event pairs, 907 based on Foata normal form. 2/6329 useless extension candidates. Maximal degree in co-relation 49584. Up to 6274 conditions per place. [2024-06-14 13:07:03,488 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 461 selfloop transitions, 29 changer transitions 0/493 dead transitions. [2024-06-14 13:07:03,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 493 transitions, 8065 flow [2024-06-14 13:07:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:07:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:07:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-14 13:07:03,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-14 13:07:03,489 INFO L175 Difference]: Start difference. First operand has 327 places, 471 transitions, 6962 flow. Second operand 8 states and 120 transitions. [2024-06-14 13:07:03,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 493 transitions, 8065 flow [2024-06-14 13:07:04,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 493 transitions, 7950 flow, removed 39 selfloop flow, removed 4 redundant places. [2024-06-14 13:07:04,822 INFO L231 Difference]: Finished difference. Result has 331 places, 475 transitions, 6992 flow [2024-06-14 13:07:04,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6862, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6992, PETRI_PLACES=331, PETRI_TRANSITIONS=475} [2024-06-14 13:07:04,823 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 289 predicate places. [2024-06-14 13:07:04,823 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 475 transitions, 6992 flow [2024-06-14 13:07:04,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:04,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:04,823 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-14 13:07:04,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 13:07:04,823 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:04,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1672620381, now seen corresponding path program 6 times [2024-06-14 13:07:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:04,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639879557] [2024-06-14 13:07:04,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:05,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-14 13:07:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639879557] [2024-06-14 13:07:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639879557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:05,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:05,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335198791] [2024-06-14 13:07:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:05,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:05,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:05,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 475 transitions, 6992 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:05,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:05,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:05,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:06,858 INFO L124 PetriNetUnfolderBase]: 4143/6343 cut-off events. [2024-06-14 13:07:06,858 INFO L125 PetriNetUnfolderBase]: For 617833/617833 co-relation queries the response was YES. [2024-06-14 13:07:06,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49998 conditions, 6343 events. 4143/6343 cut-off events. For 617833/617833 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 36294 event pairs, 900 based on Foata normal form. 2/6343 useless extension candidates. Maximal degree in co-relation 49843. Up to 6190 conditions per place. [2024-06-14 13:07:06,957 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 453 selfloop transitions, 52 changer transitions 0/508 dead transitions. [2024-06-14 13:07:06,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 508 transitions, 8550 flow [2024-06-14 13:07:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:07:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:07:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-14 13:07:06,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-14 13:07:06,959 INFO L175 Difference]: Start difference. First operand has 331 places, 475 transitions, 6992 flow. Second operand 8 states and 130 transitions. [2024-06-14 13:07:06,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 508 transitions, 8550 flow [2024-06-14 13:07:08,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 508 transitions, 8460 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-14 13:07:08,209 INFO L231 Difference]: Finished difference. Result has 335 places, 483 transitions, 7189 flow [2024-06-14 13:07:08,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6902, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7189, PETRI_PLACES=335, PETRI_TRANSITIONS=483} [2024-06-14 13:07:08,209 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 293 predicate places. [2024-06-14 13:07:08,209 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 483 transitions, 7189 flow [2024-06-14 13:07:08,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:08,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:08,210 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-14 13:07:08,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 13:07:08,210 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:08,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1672740537, now seen corresponding path program 4 times [2024-06-14 13:07:08,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:08,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630348158] [2024-06-14 13:07:08,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:08,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630348158] [2024-06-14 13:07:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630348158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:08,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454967693] [2024-06-14 13:07:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:08,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:08,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:08,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:08,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:08,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:08,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 483 transitions, 7189 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:08,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:08,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:08,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:10,315 INFO L124 PetriNetUnfolderBase]: 4129/6323 cut-off events. [2024-06-14 13:07:10,315 INFO L125 PetriNetUnfolderBase]: For 626455/626455 co-relation queries the response was YES. [2024-06-14 13:07:10,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50048 conditions, 6323 events. 4129/6323 cut-off events. For 626455/626455 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 36194 event pairs, 899 based on Foata normal form. 2/6323 useless extension candidates. Maximal degree in co-relation 49891. Up to 6213 conditions per place. [2024-06-14 13:07:10,403 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 448 selfloop transitions, 52 changer transitions 0/503 dead transitions. [2024-06-14 13:07:10,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 503 transitions, 8403 flow [2024-06-14 13:07:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:07:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:07:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-14 13:07:10,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-14 13:07:10,404 INFO L175 Difference]: Start difference. First operand has 335 places, 483 transitions, 7189 flow. Second operand 8 states and 127 transitions. [2024-06-14 13:07:10,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 503 transitions, 8403 flow [2024-06-14 13:07:12,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 503 transitions, 8246 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-14 13:07:12,021 INFO L231 Difference]: Finished difference. Result has 338 places, 483 transitions, 7142 flow [2024-06-14 13:07:12,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7032, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7142, PETRI_PLACES=338, PETRI_TRANSITIONS=483} [2024-06-14 13:07:12,022 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 296 predicate places. [2024-06-14 13:07:12,022 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 483 transitions, 7142 flow [2024-06-14 13:07:12,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:12,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:12,022 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-14 13:07:12,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 13:07:12,023 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:12,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:12,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1672740351, now seen corresponding path program 7 times [2024-06-14 13:07:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:12,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988458214] [2024-06-14 13:07:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:12,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:12,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988458214] [2024-06-14 13:07:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988458214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:12,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:12,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032485910] [2024-06-14 13:07:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:12,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:12,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:12,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:12,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:12,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:12,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 483 transitions, 7142 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:12,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:12,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:12,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:14,285 INFO L124 PetriNetUnfolderBase]: 4123/6315 cut-off events. [2024-06-14 13:07:14,285 INFO L125 PetriNetUnfolderBase]: For 631770/631770 co-relation queries the response was YES. [2024-06-14 13:07:14,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49788 conditions, 6315 events. 4123/6315 cut-off events. For 631770/631770 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 36078 event pairs, 894 based on Foata normal form. 2/6315 useless extension candidates. Maximal degree in co-relation 49630. Up to 6261 conditions per place. [2024-06-14 13:07:14,362 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 472 selfloop transitions, 27 changer transitions 0/502 dead transitions. [2024-06-14 13:07:14,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 502 transitions, 8213 flow [2024-06-14 13:07:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:07:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:07:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-14 13:07:14,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-14 13:07:14,364 INFO L175 Difference]: Start difference. First operand has 338 places, 483 transitions, 7142 flow. Second operand 8 states and 120 transitions. [2024-06-14 13:07:14,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 502 transitions, 8213 flow [2024-06-14 13:07:15,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 502 transitions, 7626 flow, removed 14 selfloop flow, removed 12 redundant places. [2024-06-14 13:07:15,779 INFO L231 Difference]: Finished difference. Result has 334 places, 484 transitions, 6642 flow [2024-06-14 13:07:15,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6555, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6642, PETRI_PLACES=334, PETRI_TRANSITIONS=484} [2024-06-14 13:07:15,779 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 292 predicate places. [2024-06-14 13:07:15,779 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 484 transitions, 6642 flow [2024-06-14 13:07:15,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:15,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:15,780 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-14 13:07:15,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 13:07:15,780 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:15,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1431270027, now seen corresponding path program 5 times [2024-06-14 13:07:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:15,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345709113] [2024-06-14 13:07:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:15,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:16,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:16,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345709113] [2024-06-14 13:07:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345709113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:16,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459524703] [2024-06-14 13:07:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:16,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:16,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:16,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:16,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 484 transitions, 6642 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:16,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:16,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:16,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:17,828 INFO L124 PetriNetUnfolderBase]: 4133/6329 cut-off events. [2024-06-14 13:07:17,829 INFO L125 PetriNetUnfolderBase]: For 640732/640732 co-relation queries the response was YES. [2024-06-14 13:07:17,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49419 conditions, 6329 events. 4133/6329 cut-off events. For 640732/640732 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 36183 event pairs, 902 based on Foata normal form. 2/6329 useless extension candidates. Maximal degree in co-relation 49262. Up to 6266 conditions per place. [2024-06-14 13:07:17,918 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 462 selfloop transitions, 38 changer transitions 0/503 dead transitions. [2024-06-14 13:07:17,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 503 transitions, 7724 flow [2024-06-14 13:07:17,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:07:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:07:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-14 13:07:17,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36890243902439024 [2024-06-14 13:07:17,919 INFO L175 Difference]: Start difference. First operand has 334 places, 484 transitions, 6642 flow. Second operand 8 states and 121 transitions. [2024-06-14 13:07:17,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 503 transitions, 7724 flow [2024-06-14 13:07:19,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 503 transitions, 7640 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-14 13:07:19,341 INFO L231 Difference]: Finished difference. Result has 337 places, 488 transitions, 6696 flow [2024-06-14 13:07:19,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6558, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6696, PETRI_PLACES=337, PETRI_TRANSITIONS=488} [2024-06-14 13:07:19,341 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 295 predicate places. [2024-06-14 13:07:19,341 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 488 transitions, 6696 flow [2024-06-14 13:07:19,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:19,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:19,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:07:19,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 13:07:19,342 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:19,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2027240541, now seen corresponding path program 8 times [2024-06-14 13:07:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:19,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127669756] [2024-06-14 13:07:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:20,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-14 13:07:20,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127669756] [2024-06-14 13:07:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127669756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:20,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:20,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:20,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814074893] [2024-06-14 13:07:20,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:20,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:20,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:20,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:20,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:20,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 488 transitions, 6696 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:20,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:20,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:20,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:21,437 INFO L124 PetriNetUnfolderBase]: 4143/6343 cut-off events. [2024-06-14 13:07:21,437 INFO L125 PetriNetUnfolderBase]: For 655164/655164 co-relation queries the response was YES. [2024-06-14 13:07:21,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49709 conditions, 6343 events. 4143/6343 cut-off events. For 655164/655164 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 36282 event pairs, 903 based on Foata normal form. 2/6343 useless extension candidates. Maximal degree in co-relation 49550. Up to 6303 conditions per place. [2024-06-14 13:07:21,530 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 482 selfloop transitions, 22 changer transitions 0/507 dead transitions. [2024-06-14 13:07:21,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 507 transitions, 7810 flow [2024-06-14 13:07:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:07:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:07:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-14 13:07:21,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35365853658536583 [2024-06-14 13:07:21,531 INFO L175 Difference]: Start difference. First operand has 337 places, 488 transitions, 6696 flow. Second operand 8 states and 116 transitions. [2024-06-14 13:07:21,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 507 transitions, 7810 flow [2024-06-14 13:07:22,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 507 transitions, 7746 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 13:07:22,967 INFO L231 Difference]: Finished difference. Result has 342 places, 492 transitions, 6760 flow [2024-06-14 13:07:22,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6632, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6760, PETRI_PLACES=342, PETRI_TRANSITIONS=492} [2024-06-14 13:07:22,968 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 300 predicate places. [2024-06-14 13:07:22,968 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 492 transitions, 6760 flow [2024-06-14 13:07:22,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:22,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:22,969 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-14 13:07:22,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 13:07:22,969 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:22,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:22,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2027003577, now seen corresponding path program 6 times [2024-06-14 13:07:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:22,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834382346] [2024-06-14 13:07:22,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:22,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:23,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834382346] [2024-06-14 13:07:23,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834382346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:23,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:23,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974015497] [2024-06-14 13:07:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:23,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:23,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:23,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:23,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:23,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 492 transitions, 6760 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:23,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:23,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:23,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:25,075 INFO L124 PetriNetUnfolderBase]: 4166/6375 cut-off events. [2024-06-14 13:07:25,075 INFO L125 PetriNetUnfolderBase]: For 673899/673899 co-relation queries the response was YES. [2024-06-14 13:07:25,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50219 conditions, 6375 events. 4166/6375 cut-off events. For 673899/673899 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 36476 event pairs, 899 based on Foata normal form. 2/6375 useless extension candidates. Maximal degree in co-relation 50058. Up to 6299 conditions per place. [2024-06-14 13:07:25,165 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 470 selfloop transitions, 45 changer transitions 0/518 dead transitions. [2024-06-14 13:07:25,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 518 transitions, 8129 flow [2024-06-14 13:07:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:07:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:07:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-14 13:07:25,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-14 13:07:25,167 INFO L175 Difference]: Start difference. First operand has 342 places, 492 transitions, 6760 flow. Second operand 8 states and 125 transitions. [2024-06-14 13:07:25,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 518 transitions, 8129 flow [2024-06-14 13:07:26,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 518 transitions, 8049 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-14 13:07:26,712 INFO L231 Difference]: Finished difference. Result has 346 places, 501 transitions, 6931 flow [2024-06-14 13:07:26,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6680, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6931, PETRI_PLACES=346, PETRI_TRANSITIONS=501} [2024-06-14 13:07:26,712 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 304 predicate places. [2024-06-14 13:07:26,712 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 501 transitions, 6931 flow [2024-06-14 13:07:26,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:26,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:26,713 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-14 13:07:26,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 13:07:26,713 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:26,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1682917341, now seen corresponding path program 9 times [2024-06-14 13:07:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:26,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273488652] [2024-06-14 13:07:26,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:27,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:27,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273488652] [2024-06-14 13:07:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273488652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:27,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:27,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048274520] [2024-06-14 13:07:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:27,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:27,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:27,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 501 transitions, 6931 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:27,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:27,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:27,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:28,895 INFO L124 PetriNetUnfolderBase]: 4176/6389 cut-off events. [2024-06-14 13:07:28,895 INFO L125 PetriNetUnfolderBase]: For 688918/688918 co-relation queries the response was YES. [2024-06-14 13:07:28,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50573 conditions, 6389 events. 4176/6389 cut-off events. For 688918/688918 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 36611 event pairs, 900 based on Foata normal form. 2/6389 useless extension candidates. Maximal degree in co-relation 50410. Up to 6340 conditions per place. [2024-06-14 13:07:28,979 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 490 selfloop transitions, 28 changer transitions 0/521 dead transitions. [2024-06-14 13:07:28,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 521 transitions, 8076 flow [2024-06-14 13:07:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:07:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:07:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-14 13:07:28,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34959349593495936 [2024-06-14 13:07:28,980 INFO L175 Difference]: Start difference. First operand has 346 places, 501 transitions, 6931 flow. Second operand 9 states and 129 transitions. [2024-06-14 13:07:28,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 521 transitions, 8076 flow [2024-06-14 13:07:30,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 521 transitions, 7994 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 13:07:30,527 INFO L231 Difference]: Finished difference. Result has 350 places, 504 transitions, 6978 flow [2024-06-14 13:07:30,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6849, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6978, PETRI_PLACES=350, PETRI_TRANSITIONS=504} [2024-06-14 13:07:30,528 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 308 predicate places. [2024-06-14 13:07:30,528 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 504 transitions, 6978 flow [2024-06-14 13:07:30,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:30,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:30,528 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-14 13:07:30,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 13:07:30,529 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:30,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1387925911, now seen corresponding path program 7 times [2024-06-14 13:07:30,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:30,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086232185] [2024-06-14 13:07:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:30,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:31,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:31,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086232185] [2024-06-14 13:07:31,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086232185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:31,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:31,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593002023] [2024-06-14 13:07:31,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:31,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:31,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:31,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:31,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:31,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 504 transitions, 6978 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:31,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:31,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:31,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:32,633 INFO L124 PetriNetUnfolderBase]: 4170/6381 cut-off events. [2024-06-14 13:07:32,634 INFO L125 PetriNetUnfolderBase]: For 696934/696934 co-relation queries the response was YES. [2024-06-14 13:07:32,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50505 conditions, 6381 events. 4170/6381 cut-off events. For 696934/696934 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 36539 event pairs, 898 based on Foata normal form. 2/6381 useless extension candidates. Maximal degree in co-relation 50341. Up to 6261 conditions per place. [2024-06-14 13:07:32,728 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 456 selfloop transitions, 64 changer transitions 0/523 dead transitions. [2024-06-14 13:07:32,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 523 transitions, 8242 flow [2024-06-14 13:07:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:07:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:07:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-14 13:07:32,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-14 13:07:32,731 INFO L175 Difference]: Start difference. First operand has 350 places, 504 transitions, 6978 flow. Second operand 7 states and 116 transitions. [2024-06-14 13:07:32,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 523 transitions, 8242 flow [2024-06-14 13:07:34,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 523 transitions, 8156 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 13:07:34,632 INFO L231 Difference]: Finished difference. Result has 351 places, 504 transitions, 7034 flow [2024-06-14 13:07:34,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6892, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7034, PETRI_PLACES=351, PETRI_TRANSITIONS=504} [2024-06-14 13:07:34,633 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 309 predicate places. [2024-06-14 13:07:34,633 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 504 transitions, 7034 flow [2024-06-14 13:07:34,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:34,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:34,633 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-14 13:07:34,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 13:07:34,633 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:34,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1610528851, now seen corresponding path program 8 times [2024-06-14 13:07:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:34,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102640590] [2024-06-14 13:07:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:34,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:35,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-14 13:07:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102640590] [2024-06-14 13:07:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102640590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777092467] [2024-06-14 13:07:35,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:35,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:35,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:35,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:35,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:35,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 504 transitions, 7034 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:35,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:35,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:35,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:36,729 INFO L124 PetriNetUnfolderBase]: 4158/6366 cut-off events. [2024-06-14 13:07:36,729 INFO L125 PetriNetUnfolderBase]: For 704225/704227 co-relation queries the response was YES. [2024-06-14 13:07:36,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50304 conditions, 6366 events. 4158/6366 cut-off events. For 704225/704227 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 36491 event pairs, 905 based on Foata normal form. 6/6370 useless extension candidates. Maximal degree in co-relation 50139. Up to 6242 conditions per place. [2024-06-14 13:07:36,822 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 466 selfloop transitions, 48 changer transitions 0/517 dead transitions. [2024-06-14 13:07:36,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 517 transitions, 8272 flow [2024-06-14 13:07:36,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:07:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:07:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-14 13:07:36,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-14 13:07:36,824 INFO L175 Difference]: Start difference. First operand has 351 places, 504 transitions, 7034 flow. Second operand 7 states and 109 transitions. [2024-06-14 13:07:36,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 517 transitions, 8272 flow [2024-06-14 13:07:38,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 517 transitions, 8172 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 13:07:38,700 INFO L231 Difference]: Finished difference. Result has 353 places, 504 transitions, 7042 flow [2024-06-14 13:07:38,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6938, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7042, PETRI_PLACES=353, PETRI_TRANSITIONS=504} [2024-06-14 13:07:38,701 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 311 predicate places. [2024-06-14 13:07:38,701 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 504 transitions, 7042 flow [2024-06-14 13:07:38,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:38,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:38,702 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-14 13:07:38,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 13:07:38,702 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:38,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash -390440769, now seen corresponding path program 10 times [2024-06-14 13:07:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:38,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033435553] [2024-06-14 13:07:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:39,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-14 13:07:39,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:39,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033435553] [2024-06-14 13:07:39,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033435553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:39,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:39,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:39,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641551744] [2024-06-14 13:07:39,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:39,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:39,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:39,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:39,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:39,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:39,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 504 transitions, 7042 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:39,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:39,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:39,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:40,773 INFO L124 PetriNetUnfolderBase]: 4162/6372 cut-off events. [2024-06-14 13:07:40,774 INFO L125 PetriNetUnfolderBase]: For 683004/683006 co-relation queries the response was YES. [2024-06-14 13:07:40,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50041 conditions, 6372 events. 4162/6372 cut-off events. For 683004/683006 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 36517 event pairs, 803 based on Foata normal form. 6/6376 useless extension candidates. Maximal degree in co-relation 49876. Up to 6008 conditions per place. [2024-06-14 13:07:40,864 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 458 selfloop transitions, 75 changer transitions 0/536 dead transitions. [2024-06-14 13:07:40,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 536 transitions, 8430 flow [2024-06-14 13:07:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:07:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:07:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-14 13:07:40,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-14 13:07:40,866 INFO L175 Difference]: Start difference. First operand has 353 places, 504 transitions, 7042 flow. Second operand 8 states and 139 transitions. [2024-06-14 13:07:40,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 536 transitions, 8430 flow [2024-06-14 13:07:42,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 536 transitions, 8313 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-14 13:07:42,438 INFO L231 Difference]: Finished difference. Result has 358 places, 507 transitions, 7210 flow [2024-06-14 13:07:42,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6925, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7210, PETRI_PLACES=358, PETRI_TRANSITIONS=507} [2024-06-14 13:07:42,438 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 316 predicate places. [2024-06-14 13:07:42,438 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 507 transitions, 7210 flow [2024-06-14 13:07:42,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:42,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:42,439 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-14 13:07:42,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 13:07:42,439 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:42,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -358463065, now seen corresponding path program 11 times [2024-06-14 13:07:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743423327] [2024-06-14 13:07:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:43,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:43,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743423327] [2024-06-14 13:07:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743423327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:43,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:43,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583937622] [2024-06-14 13:07:43,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:43,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:43,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:43,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:43,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:43,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:43,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 507 transitions, 7210 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:43,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:43,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:43,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:44,589 INFO L124 PetriNetUnfolderBase]: 4156/6363 cut-off events. [2024-06-14 13:07:44,590 INFO L125 PetriNetUnfolderBase]: For 683733/683733 co-relation queries the response was YES. [2024-06-14 13:07:44,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50292 conditions, 6363 events. 4156/6363 cut-off events. For 683733/683733 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 36518 event pairs, 875 based on Foata normal form. 2/6363 useless extension candidates. Maximal degree in co-relation 50125. Up to 6239 conditions per place. [2024-06-14 13:07:44,685 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 479 selfloop transitions, 51 changer transitions 0/533 dead transitions. [2024-06-14 13:07:44,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 533 transitions, 8518 flow [2024-06-14 13:07:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:07:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:07:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-14 13:07:44,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-14 13:07:44,690 INFO L175 Difference]: Start difference. First operand has 358 places, 507 transitions, 7210 flow. Second operand 8 states and 131 transitions. [2024-06-14 13:07:44,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 533 transitions, 8518 flow [2024-06-14 13:07:46,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 533 transitions, 8269 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-14 13:07:46,481 INFO L231 Difference]: Finished difference. Result has 359 places, 507 transitions, 7077 flow [2024-06-14 13:07:46,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6961, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7077, PETRI_PLACES=359, PETRI_TRANSITIONS=507} [2024-06-14 13:07:46,482 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 317 predicate places. [2024-06-14 13:07:46,482 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 507 transitions, 7077 flow [2024-06-14 13:07:46,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:46,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:46,482 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-14 13:07:46,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 13:07:46,483 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:46,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:46,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1388341621, now seen corresponding path program 9 times [2024-06-14 13:07:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:46,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656603156] [2024-06-14 13:07:46,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:46,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:47,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:47,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656603156] [2024-06-14 13:07:47,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656603156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:47,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:47,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088261808] [2024-06-14 13:07:47,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:47,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:47,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:47,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:47,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:47,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 507 transitions, 7077 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:47,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:47,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:47,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:48,565 INFO L124 PetriNetUnfolderBase]: 4166/6377 cut-off events. [2024-06-14 13:07:48,566 INFO L125 PetriNetUnfolderBase]: For 696695/696695 co-relation queries the response was YES. [2024-06-14 13:07:48,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50161 conditions, 6377 events. 4166/6377 cut-off events. For 696695/696695 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 36541 event pairs, 895 based on Foata normal form. 2/6377 useless extension candidates. Maximal degree in co-relation 49994. Up to 6308 conditions per place. [2024-06-14 13:07:48,652 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 480 selfloop transitions, 42 changer transitions 0/525 dead transitions. [2024-06-14 13:07:48,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 525 transitions, 8214 flow [2024-06-14 13:07:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:07:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:07:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-14 13:07:48,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-14 13:07:48,653 INFO L175 Difference]: Start difference. First operand has 359 places, 507 transitions, 7077 flow. Second operand 7 states and 109 transitions. [2024-06-14 13:07:48,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 525 transitions, 8214 flow [2024-06-14 13:07:50,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 525 transitions, 8122 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 13:07:50,607 INFO L231 Difference]: Finished difference. Result has 360 places, 511 transitions, 7152 flow [2024-06-14 13:07:50,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6985, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7152, PETRI_PLACES=360, PETRI_TRANSITIONS=511} [2024-06-14 13:07:50,607 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 318 predicate places. [2024-06-14 13:07:50,607 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 511 transitions, 7152 flow [2024-06-14 13:07:50,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:50,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:50,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:07:50,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 13:07:50,608 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:50,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:50,608 INFO L85 PathProgramCache]: Analyzing trace with hash -390440583, now seen corresponding path program 10 times [2024-06-14 13:07:50,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337210875] [2024-06-14 13:07:50,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337210875] [2024-06-14 13:07:51,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337210875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:51,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:51,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002461681] [2024-06-14 13:07:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:51,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:51,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:51,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:51,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 511 transitions, 7152 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:51,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:51,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:51,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:52,872 INFO L124 PetriNetUnfolderBase]: 4196/6420 cut-off events. [2024-06-14 13:07:52,872 INFO L125 PetriNetUnfolderBase]: For 697446/697448 co-relation queries the response was YES. [2024-06-14 13:07:52,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50230 conditions, 6420 events. 4196/6420 cut-off events. For 697446/697448 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 36799 event pairs, 870 based on Foata normal form. 8/6426 useless extension candidates. Maximal degree in co-relation 50062. Up to 5593 conditions per place. [2024-06-14 13:07:52,949 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 328 selfloop transitions, 211 changer transitions 0/542 dead transitions. [2024-06-14 13:07:52,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 542 transitions, 8736 flow [2024-06-14 13:07:52,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:07:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:07:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-14 13:07:52,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-14 13:07:52,950 INFO L175 Difference]: Start difference. First operand has 360 places, 511 transitions, 7152 flow. Second operand 7 states and 128 transitions. [2024-06-14 13:07:52,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 542 transitions, 8736 flow [2024-06-14 13:07:54,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 542 transitions, 8675 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-14 13:07:54,760 INFO L231 Difference]: Finished difference. Result has 364 places, 518 transitions, 7641 flow [2024-06-14 13:07:54,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7095, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7641, PETRI_PLACES=364, PETRI_TRANSITIONS=518} [2024-06-14 13:07:54,760 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 322 predicate places. [2024-06-14 13:07:54,760 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 518 transitions, 7641 flow [2024-06-14 13:07:54,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:54,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:54,761 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-14 13:07:54,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 13:07:54,761 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:54,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1210800901, now seen corresponding path program 11 times [2024-06-14 13:07:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244585246] [2024-06-14 13:07:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244585246] [2024-06-14 13:07:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244585246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:55,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:55,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201303869] [2024-06-14 13:07:55,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:55,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:55,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:55,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:55,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:55,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 518 transitions, 7641 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:55,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:55,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:55,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:07:56,809 INFO L124 PetriNetUnfolderBase]: 4169/6382 cut-off events. [2024-06-14 13:07:56,809 INFO L125 PetriNetUnfolderBase]: For 676318/676320 co-relation queries the response was YES. [2024-06-14 13:07:56,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50256 conditions, 6382 events. 4169/6382 cut-off events. For 676318/676320 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 36589 event pairs, 860 based on Foata normal form. 8/6388 useless extension candidates. Maximal degree in co-relation 50087. Up to 5572 conditions per place. [2024-06-14 13:07:56,902 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 333 selfloop transitions, 202 changer transitions 0/538 dead transitions. [2024-06-14 13:07:56,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 538 transitions, 8941 flow [2024-06-14 13:07:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:07:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:07:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-14 13:07:56,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 13:07:56,903 INFO L175 Difference]: Start difference. First operand has 364 places, 518 transitions, 7641 flow. Second operand 7 states and 123 transitions. [2024-06-14 13:07:56,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 538 transitions, 8941 flow [2024-06-14 13:07:58,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 538 transitions, 8598 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 13:07:58,837 INFO L231 Difference]: Finished difference. Result has 365 places, 518 transitions, 7732 flow [2024-06-14 13:07:58,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7302, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7732, PETRI_PLACES=365, PETRI_TRANSITIONS=518} [2024-06-14 13:07:58,838 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 323 predicate places. [2024-06-14 13:07:58,838 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 518 transitions, 7732 flow [2024-06-14 13:07:58,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:58,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:07:58,838 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-14 13:07:58,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 13:07:58,839 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:07:58,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:07:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash -358225915, now seen corresponding path program 12 times [2024-06-14 13:07:58,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:07:58,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086480838] [2024-06-14 13:07:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:07:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:07:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:07:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:07:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:07:59,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086480838] [2024-06-14 13:07:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086480838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:07:59,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:07:59,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:07:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959197170] [2024-06-14 13:07:59,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:07:59,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:07:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:07:59,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:07:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:07:59,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:07:59,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 518 transitions, 7732 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:07:59,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:07:59,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:07:59,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:00,939 INFO L124 PetriNetUnfolderBase]: 4163/6373 cut-off events. [2024-06-14 13:08:00,939 INFO L125 PetriNetUnfolderBase]: For 641121/641121 co-relation queries the response was YES. [2024-06-14 13:08:01,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49939 conditions, 6373 events. 4163/6373 cut-off events. For 641121/641121 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 36555 event pairs, 884 based on Foata normal form. 2/6373 useless extension candidates. Maximal degree in co-relation 49771. Up to 6297 conditions per place. [2024-06-14 13:08:01,029 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 502 selfloop transitions, 33 changer transitions 0/538 dead transitions. [2024-06-14 13:08:01,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 538 transitions, 8856 flow [2024-06-14 13:08:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-14 13:08:01,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-14 13:08:01,030 INFO L175 Difference]: Start difference. First operand has 365 places, 518 transitions, 7732 flow. Second operand 7 states and 113 transitions. [2024-06-14 13:08:01,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 538 transitions, 8856 flow [2024-06-14 13:08:03,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 538 transitions, 8339 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 13:08:03,069 INFO L231 Difference]: Finished difference. Result has 365 places, 518 transitions, 7295 flow [2024-06-14 13:08:03,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7215, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7295, PETRI_PLACES=365, PETRI_TRANSITIONS=518} [2024-06-14 13:08:03,070 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 323 predicate places. [2024-06-14 13:08:03,070 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 518 transitions, 7295 flow [2024-06-14 13:08:03,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:03,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:03,070 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-14 13:08:03,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 13:08:03,071 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:03,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1616242771, now seen corresponding path program 12 times [2024-06-14 13:08:03,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:03,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791384665] [2024-06-14 13:08:03,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:03,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:03,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791384665] [2024-06-14 13:08:03,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791384665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:03,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:03,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:08:03,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314102914] [2024-06-14 13:08:03,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:03,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:08:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:03,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:08:03,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:08:03,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:03,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 518 transitions, 7295 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:03,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:03,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:03,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:05,148 INFO L124 PetriNetUnfolderBase]: 4151/6357 cut-off events. [2024-06-14 13:08:05,148 INFO L125 PetriNetUnfolderBase]: For 629763/629765 co-relation queries the response was YES. [2024-06-14 13:08:05,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48918 conditions, 6357 events. 4151/6357 cut-off events. For 629763/629765 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 36441 event pairs, 899 based on Foata normal form. 4/6359 useless extension candidates. Maximal degree in co-relation 48750. Up to 6293 conditions per place. [2024-06-14 13:08:05,242 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 487 selfloop transitions, 39 changer transitions 0/529 dead transitions. [2024-06-14 13:08:05,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 529 transitions, 8375 flow [2024-06-14 13:08:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-14 13:08:05,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3623693379790941 [2024-06-14 13:08:05,244 INFO L175 Difference]: Start difference. First operand has 365 places, 518 transitions, 7295 flow. Second operand 7 states and 104 transitions. [2024-06-14 13:08:05,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 529 transitions, 8375 flow [2024-06-14 13:08:07,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 529 transitions, 8277 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 13:08:07,051 INFO L231 Difference]: Finished difference. Result has 365 places, 518 transitions, 7281 flow [2024-06-14 13:08:07,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7197, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7281, PETRI_PLACES=365, PETRI_TRANSITIONS=518} [2024-06-14 13:08:07,052 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 323 predicate places. [2024-06-14 13:08:07,052 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 518 transitions, 7281 flow [2024-06-14 13:08:07,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:07,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:07,052 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-14 13:08:07,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 13:08:07,052 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:07,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1211040469, now seen corresponding path program 2 times [2024-06-14 13:08:07,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:07,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446669769] [2024-06-14 13:08:07,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:07,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:08,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:08,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446669769] [2024-06-14 13:08:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446669769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:08,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:08,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865525796] [2024-06-14 13:08:08,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:08,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:08,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:08,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:08,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 518 transitions, 7281 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:08,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:08,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:08,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:09,525 INFO L124 PetriNetUnfolderBase]: 4159/6368 cut-off events. [2024-06-14 13:08:09,525 INFO L125 PetriNetUnfolderBase]: For 629353/629353 co-relation queries the response was YES. [2024-06-14 13:08:09,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49002 conditions, 6368 events. 4159/6368 cut-off events. For 629353/629353 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 36502 event pairs, 869 based on Foata normal form. 2/6368 useless extension candidates. Maximal degree in co-relation 48833. Up to 6292 conditions per place. [2024-06-14 13:08:09,621 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 501 selfloop transitions, 35 changer transitions 0/539 dead transitions. [2024-06-14 13:08:09,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 539 transitions, 8451 flow [2024-06-14 13:08:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-14 13:08:09,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:08:09,623 INFO L175 Difference]: Start difference. First operand has 365 places, 518 transitions, 7281 flow. Second operand 7 states and 112 transitions. [2024-06-14 13:08:09,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 539 transitions, 8451 flow [2024-06-14 13:08:11,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 539 transitions, 8308 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 13:08:11,548 INFO L231 Difference]: Finished difference. Result has 363 places, 520 transitions, 7268 flow [2024-06-14 13:08:11,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7138, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7268, PETRI_PLACES=363, PETRI_TRANSITIONS=520} [2024-06-14 13:08:11,548 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 321 predicate places. [2024-06-14 13:08:11,548 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 520 transitions, 7268 flow [2024-06-14 13:08:11,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:11,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:11,549 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-14 13:08:11,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 13:08:11,549 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:11,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1624346915, now seen corresponding path program 1 times [2024-06-14 13:08:11,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:11,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248194224] [2024-06-14 13:08:11,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:11,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:12,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248194224] [2024-06-14 13:08:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248194224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:12,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:12,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355456305] [2024-06-14 13:08:12,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:12,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:12,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:12,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:12,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:12,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 520 transitions, 7268 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:12,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:12,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:12,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:13,905 INFO L124 PetriNetUnfolderBase]: 4141/6340 cut-off events. [2024-06-14 13:08:13,906 INFO L125 PetriNetUnfolderBase]: For 636406/636408 co-relation queries the response was YES. [2024-06-14 13:08:13,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48906 conditions, 6340 events. 4141/6340 cut-off events. For 636406/636408 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 36350 event pairs, 883 based on Foata normal form. 4/6342 useless extension candidates. Maximal degree in co-relation 48738. Up to 6180 conditions per place. [2024-06-14 13:08:13,996 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 464 selfloop transitions, 66 changer transitions 0/533 dead transitions. [2024-06-14 13:08:13,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 533 transitions, 8538 flow [2024-06-14 13:08:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-14 13:08:13,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-14 13:08:13,997 INFO L175 Difference]: Start difference. First operand has 363 places, 520 transitions, 7268 flow. Second operand 7 states and 109 transitions. [2024-06-14 13:08:13,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 533 transitions, 8538 flow [2024-06-14 13:08:15,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 533 transitions, 8416 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-14 13:08:15,990 INFO L231 Difference]: Finished difference. Result has 365 places, 520 transitions, 7299 flow [2024-06-14 13:08:15,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7148, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7299, PETRI_PLACES=365, PETRI_TRANSITIONS=520} [2024-06-14 13:08:15,990 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 323 predicate places. [2024-06-14 13:08:15,990 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 520 transitions, 7299 flow [2024-06-14 13:08:15,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:15,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:15,991 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-14 13:08:15,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 13:08:15,991 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:15,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:15,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1624822579, now seen corresponding path program 3 times [2024-06-14 13:08:15,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:15,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681946087] [2024-06-14 13:08:15,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681946087] [2024-06-14 13:08:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681946087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005162125] [2024-06-14 13:08:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:16,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:16,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:16,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:16,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:16,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 520 transitions, 7299 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:16,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:16,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:16,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:18,352 INFO L124 PetriNetUnfolderBase]: 4149/6351 cut-off events. [2024-06-14 13:08:18,353 INFO L125 PetriNetUnfolderBase]: For 635224/635224 co-relation queries the response was YES. [2024-06-14 13:08:18,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48949 conditions, 6351 events. 4149/6351 cut-off events. For 635224/635224 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 36365 event pairs, 885 based on Foata normal form. 2/6351 useless extension candidates. Maximal degree in co-relation 48780. Up to 6315 conditions per place. [2024-06-14 13:08:18,437 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 515 selfloop transitions, 16 changer transitions 0/534 dead transitions. [2024-06-14 13:08:18,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 534 transitions, 8437 flow [2024-06-14 13:08:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-14 13:08:18,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519163763066202 [2024-06-14 13:08:18,438 INFO L175 Difference]: Start difference. First operand has 365 places, 520 transitions, 7299 flow. Second operand 7 states and 101 transitions. [2024-06-14 13:08:18,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 534 transitions, 8437 flow [2024-06-14 13:08:20,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 534 transitions, 7983 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-14 13:08:20,364 INFO L231 Difference]: Finished difference. Result has 363 places, 522 transitions, 6934 flow [2024-06-14 13:08:20,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6845, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6934, PETRI_PLACES=363, PETRI_TRANSITIONS=522} [2024-06-14 13:08:20,365 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 321 predicate places. [2024-06-14 13:08:20,365 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 522 transitions, 6934 flow [2024-06-14 13:08:20,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:20,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:20,365 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-14 13:08:20,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 13:08:20,366 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:20,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1624347349, now seen corresponding path program 4 times [2024-06-14 13:08:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764480589] [2024-06-14 13:08:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:21,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:21,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764480589] [2024-06-14 13:08:21,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764480589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:21,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:21,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:21,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734809362] [2024-06-14 13:08:21,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:21,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:21,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:21,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:21,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:21,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:21,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 522 transitions, 6934 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:21,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:21,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:21,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:22,857 INFO L124 PetriNetUnfolderBase]: 4144/6344 cut-off events. [2024-06-14 13:08:22,857 INFO L125 PetriNetUnfolderBase]: For 600146/600146 co-relation queries the response was YES. [2024-06-14 13:08:22,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47737 conditions, 6344 events. 4144/6344 cut-off events. For 600146/600146 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 36379 event pairs, 882 based on Foata normal form. 2/6344 useless extension candidates. Maximal degree in co-relation 47570. Up to 6305 conditions per place. [2024-06-14 13:08:22,936 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 513 selfloop transitions, 20 changer transitions 0/536 dead transitions. [2024-06-14 13:08:22,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 536 transitions, 8082 flow [2024-06-14 13:08:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-14 13:08:22,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3554006968641115 [2024-06-14 13:08:22,937 INFO L175 Difference]: Start difference. First operand has 363 places, 522 transitions, 6934 flow. Second operand 7 states and 102 transitions. [2024-06-14 13:08:22,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 536 transitions, 8082 flow [2024-06-14 13:08:24,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 536 transitions, 8009 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-14 13:08:24,537 INFO L231 Difference]: Finished difference. Result has 365 places, 524 transitions, 6963 flow [2024-06-14 13:08:24,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6861, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6963, PETRI_PLACES=365, PETRI_TRANSITIONS=524} [2024-06-14 13:08:24,537 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 323 predicate places. [2024-06-14 13:08:24,537 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 524 transitions, 6963 flow [2024-06-14 13:08:24,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:24,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:24,538 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-14 13:08:24,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 13:08:24,538 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:24,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:24,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1436026605, now seen corresponding path program 1 times [2024-06-14 13:08:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:24,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241233656] [2024-06-14 13:08:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241233656] [2024-06-14 13:08:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241233656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:25,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:25,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678683013] [2024-06-14 13:08:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:25,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:25,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:25,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:25,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:25,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:25,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 524 transitions, 6963 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:25,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:25,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:25,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:27,143 INFO L124 PetriNetUnfolderBase]: 4152/6356 cut-off events. [2024-06-14 13:08:27,143 INFO L125 PetriNetUnfolderBase]: For 613972/613972 co-relation queries the response was YES. [2024-06-14 13:08:27,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48003 conditions, 6356 events. 4152/6356 cut-off events. For 613972/613972 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 36397 event pairs, 841 based on Foata normal form. 2/6356 useless extension candidates. Maximal degree in co-relation 47835. Up to 6248 conditions per place. [2024-06-14 13:08:27,220 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 509 selfloop transitions, 39 changer transitions 0/551 dead transitions. [2024-06-14 13:08:27,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 551 transitions, 8357 flow [2024-06-14 13:08:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:08:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:08:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-14 13:08:27,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-14 13:08:27,221 INFO L175 Difference]: Start difference. First operand has 365 places, 524 transitions, 6963 flow. Second operand 8 states and 125 transitions. [2024-06-14 13:08:27,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 551 transitions, 8357 flow [2024-06-14 13:08:28,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 551 transitions, 8273 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 13:08:28,740 INFO L231 Difference]: Finished difference. Result has 368 places, 528 transitions, 7034 flow [2024-06-14 13:08:28,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6879, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7034, PETRI_PLACES=368, PETRI_TRANSITIONS=528} [2024-06-14 13:08:28,741 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 326 predicate places. [2024-06-14 13:08:28,741 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 528 transitions, 7034 flow [2024-06-14 13:08:28,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:28,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:28,741 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-14 13:08:28,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 13:08:28,741 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:28,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1909161789, now seen corresponding path program 2 times [2024-06-14 13:08:28,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:28,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405684560] [2024-06-14 13:08:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:29,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:29,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405684560] [2024-06-14 13:08:29,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405684560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:29,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:29,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:29,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331021613] [2024-06-14 13:08:29,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:29,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:29,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:29,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:29,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:29,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 528 transitions, 7034 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:29,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:29,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:29,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:31,279 INFO L124 PetriNetUnfolderBase]: 4160/6368 cut-off events. [2024-06-14 13:08:31,279 INFO L125 PetriNetUnfolderBase]: For 627601/627601 co-relation queries the response was YES. [2024-06-14 13:08:31,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48325 conditions, 6368 events. 4160/6368 cut-off events. For 627601/627601 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 36516 event pairs, 884 based on Foata normal form. 2/6368 useless extension candidates. Maximal degree in co-relation 48156. Up to 6293 conditions per place. [2024-06-14 13:08:31,513 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 508 selfloop transitions, 37 changer transitions 0/548 dead transitions. [2024-06-14 13:08:31,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 548 transitions, 8206 flow [2024-06-14 13:08:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:08:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:08:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-14 13:08:31,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36890243902439024 [2024-06-14 13:08:31,514 INFO L175 Difference]: Start difference. First operand has 368 places, 528 transitions, 7034 flow. Second operand 8 states and 121 transitions. [2024-06-14 13:08:31,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 548 transitions, 8206 flow [2024-06-14 13:08:33,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 548 transitions, 8109 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-14 13:08:33,100 INFO L231 Difference]: Finished difference. Result has 372 places, 530 transitions, 7058 flow [2024-06-14 13:08:33,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6951, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7058, PETRI_PLACES=372, PETRI_TRANSITIONS=530} [2024-06-14 13:08:33,101 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 330 predicate places. [2024-06-14 13:08:33,101 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 530 transitions, 7058 flow [2024-06-14 13:08:33,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:33,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:33,101 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-14 13:08:33,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 13:08:33,102 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:33,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:33,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2078077531, now seen corresponding path program 3 times [2024-06-14 13:08:33,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:33,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816963061] [2024-06-14 13:08:33,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:34,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:34,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816963061] [2024-06-14 13:08:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816963061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:34,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:34,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753377330] [2024-06-14 13:08:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:34,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:34,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:34,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:34,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 530 transitions, 7058 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:34,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:34,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:34,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:35,611 INFO L124 PetriNetUnfolderBase]: 4168/6380 cut-off events. [2024-06-14 13:08:35,611 INFO L125 PetriNetUnfolderBase]: For 641238/641238 co-relation queries the response was YES. [2024-06-14 13:08:35,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48521 conditions, 6380 events. 4168/6380 cut-off events. For 641238/641238 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 36608 event pairs, 880 based on Foata normal form. 2/6380 useless extension candidates. Maximal degree in co-relation 48350. Up to 6337 conditions per place. [2024-06-14 13:08:35,705 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 521 selfloop transitions, 23 changer transitions 0/547 dead transitions. [2024-06-14 13:08:35,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 547 transitions, 8210 flow [2024-06-14 13:08:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:08:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:08:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-14 13:08:35,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35365853658536583 [2024-06-14 13:08:35,707 INFO L175 Difference]: Start difference. First operand has 372 places, 530 transitions, 7058 flow. Second operand 8 states and 116 transitions. [2024-06-14 13:08:35,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 547 transitions, 8210 flow [2024-06-14 13:08:37,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 547 transitions, 8123 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 13:08:37,684 INFO L231 Difference]: Finished difference. Result has 374 places, 532 transitions, 7054 flow [2024-06-14 13:08:37,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6971, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7054, PETRI_PLACES=374, PETRI_TRANSITIONS=532} [2024-06-14 13:08:37,685 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 332 predicate places. [2024-06-14 13:08:37,685 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 532 transitions, 7054 flow [2024-06-14 13:08:37,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:37,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:37,685 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-14 13:08:37,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 13:08:37,686 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:37,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2027434167, now seen corresponding path program 1 times [2024-06-14 13:08:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290049213] [2024-06-14 13:08:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:37,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290049213] [2024-06-14 13:08:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290049213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:38,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:38,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986304290] [2024-06-14 13:08:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:38,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:38,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:38,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:38,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:38,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 532 transitions, 7054 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:38,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:38,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:38,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:40,258 INFO L124 PetriNetUnfolderBase]: 4176/6392 cut-off events. [2024-06-14 13:08:40,259 INFO L125 PetriNetUnfolderBase]: For 654856/654856 co-relation queries the response was YES. [2024-06-14 13:08:40,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48709 conditions, 6392 events. 4176/6392 cut-off events. For 654856/654856 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 36673 event pairs, 882 based on Foata normal form. 2/6392 useless extension candidates. Maximal degree in co-relation 48537. Up to 6329 conditions per place. [2024-06-14 13:08:40,351 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 510 selfloop transitions, 36 changer transitions 0/549 dead transitions. [2024-06-14 13:08:40,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 549 transitions, 8216 flow [2024-06-14 13:08:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:08:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:08:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-14 13:08:40,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-14 13:08:40,353 INFO L175 Difference]: Start difference. First operand has 374 places, 532 transitions, 7054 flow. Second operand 8 states and 120 transitions. [2024-06-14 13:08:40,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 549 transitions, 8216 flow [2024-06-14 13:08:42,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 549 transitions, 8153 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 13:08:42,411 INFO L231 Difference]: Finished difference. Result has 376 places, 534 transitions, 7106 flow [2024-06-14 13:08:42,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6991, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7106, PETRI_PLACES=376, PETRI_TRANSITIONS=534} [2024-06-14 13:08:42,412 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 334 predicate places. [2024-06-14 13:08:42,412 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 534 transitions, 7106 flow [2024-06-14 13:08:42,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:42,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:42,412 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-14 13:08:42,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 13:08:42,412 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:42,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1193024257, now seen corresponding path program 2 times [2024-06-14 13:08:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:42,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565402002] [2024-06-14 13:08:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:43,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565402002] [2024-06-14 13:08:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565402002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:43,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:43,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:43,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974333089] [2024-06-14 13:08:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:43,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:43,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:43,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:43,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:43,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 534 transitions, 7106 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:43,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:43,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:43,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:44,960 INFO L124 PetriNetUnfolderBase]: 4184/6404 cut-off events. [2024-06-14 13:08:44,960 INFO L125 PetriNetUnfolderBase]: For 669235/669235 co-relation queries the response was YES. [2024-06-14 13:08:45,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49038 conditions, 6404 events. 4184/6404 cut-off events. For 669235/669235 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 36749 event pairs, 886 based on Foata normal form. 2/6404 useless extension candidates. Maximal degree in co-relation 48865. Up to 6335 conditions per place. [2024-06-14 13:08:45,057 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 509 selfloop transitions, 38 changer transitions 0/550 dead transitions. [2024-06-14 13:08:45,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 550 transitions, 8272 flow [2024-06-14 13:08:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-14 13:08:45,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-14 13:08:45,059 INFO L175 Difference]: Start difference. First operand has 376 places, 534 transitions, 7106 flow. Second operand 7 states and 109 transitions. [2024-06-14 13:08:45,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 550 transitions, 8272 flow [2024-06-14 13:08:46,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 550 transitions, 8173 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 13:08:46,996 INFO L231 Difference]: Finished difference. Result has 377 places, 536 transitions, 7133 flow [2024-06-14 13:08:46,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7007, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7133, PETRI_PLACES=377, PETRI_TRANSITIONS=536} [2024-06-14 13:08:46,996 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 335 predicate places. [2024-06-14 13:08:46,996 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 536 transitions, 7133 flow [2024-06-14 13:08:46,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:46,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:46,997 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-14 13:08:46,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 13:08:46,997 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:46,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1388171803, now seen corresponding path program 4 times [2024-06-14 13:08:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669247750] [2024-06-14 13:08:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:47,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:47,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669247750] [2024-06-14 13:08:47,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669247750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:47,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:47,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:47,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581452410] [2024-06-14 13:08:47,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:47,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:47,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:47,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:47,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:48,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:48,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 536 transitions, 7133 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:48,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:48,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:48,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:49,563 INFO L124 PetriNetUnfolderBase]: 4179/6397 cut-off events. [2024-06-14 13:08:49,563 INFO L125 PetriNetUnfolderBase]: For 674969/674969 co-relation queries the response was YES. [2024-06-14 13:08:49,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49019 conditions, 6397 events. 4179/6397 cut-off events. For 674969/674969 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 36619 event pairs, 846 based on Foata normal form. 2/6397 useless extension candidates. Maximal degree in co-relation 48845. Up to 6306 conditions per place. [2024-06-14 13:08:49,658 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 517 selfloop transitions, 36 changer transitions 0/556 dead transitions. [2024-06-14 13:08:49,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 556 transitions, 8289 flow [2024-06-14 13:08:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-14 13:08:49,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-14 13:08:49,659 INFO L175 Difference]: Start difference. First operand has 377 places, 536 transitions, 7133 flow. Second operand 7 states and 113 transitions. [2024-06-14 13:08:49,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 556 transitions, 8289 flow [2024-06-14 13:08:51,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 556 transitions, 8169 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-14 13:08:51,747 INFO L231 Difference]: Finished difference. Result has 379 places, 536 transitions, 7096 flow [2024-06-14 13:08:51,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7013, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7096, PETRI_PLACES=379, PETRI_TRANSITIONS=536} [2024-06-14 13:08:51,747 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 337 predicate places. [2024-06-14 13:08:51,747 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 536 transitions, 7096 flow [2024-06-14 13:08:51,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:51,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:51,748 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-14 13:08:51,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 13:08:51,748 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:51,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1624828531, now seen corresponding path program 3 times [2024-06-14 13:08:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:51,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80213538] [2024-06-14 13:08:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:51,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:52,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-14 13:08:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:52,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80213538] [2024-06-14 13:08:52,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80213538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:52,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:52,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:52,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876784686] [2024-06-14 13:08:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:52,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:52,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:52,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:52,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:52,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 536 transitions, 7096 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:52,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:52,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:52,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:54,104 INFO L124 PetriNetUnfolderBase]: 4187/6410 cut-off events. [2024-06-14 13:08:54,104 INFO L125 PetriNetUnfolderBase]: For 674964/674966 co-relation queries the response was YES. [2024-06-14 13:08:54,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48984 conditions, 6410 events. 4187/6410 cut-off events. For 674964/674966 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 36741 event pairs, 885 based on Foata normal form. 4/6412 useless extension candidates. Maximal degree in co-relation 48809. Up to 6317 conditions per place. [2024-06-14 13:08:54,198 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 509 selfloop transitions, 41 changer transitions 0/553 dead transitions. [2024-06-14 13:08:54,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 553 transitions, 8486 flow [2024-06-14 13:08:54,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-14 13:08:54,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-14 13:08:54,204 INFO L175 Difference]: Start difference. First operand has 379 places, 536 transitions, 7096 flow. Second operand 7 states and 105 transitions. [2024-06-14 13:08:54,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 553 transitions, 8486 flow [2024-06-14 13:08:56,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 553 transitions, 8403 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 13:08:56,417 INFO L231 Difference]: Finished difference. Result has 380 places, 540 transitions, 7182 flow [2024-06-14 13:08:56,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7015, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7182, PETRI_PLACES=380, PETRI_TRANSITIONS=540} [2024-06-14 13:08:56,418 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 338 predicate places. [2024-06-14 13:08:56,418 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 540 transitions, 7182 flow [2024-06-14 13:08:56,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:56,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:08:56,418 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-14 13:08:56,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 13:08:56,418 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:08:56,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:08:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1624531861, now seen corresponding path program 4 times [2024-06-14 13:08:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:08:56,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502069631] [2024-06-14 13:08:56,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:08:56,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:08:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:08:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:08:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:08:57,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502069631] [2024-06-14 13:08:57,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502069631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:08:57,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:08:57,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:08:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088473516] [2024-06-14 13:08:57,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:08:57,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:08:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:08:57,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:08:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:08:57,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:08:57,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 540 transitions, 7182 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:08:57,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:08:57,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:08:57,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:08:58,775 INFO L124 PetriNetUnfolderBase]: 4182/6403 cut-off events. [2024-06-14 13:08:58,776 INFO L125 PetriNetUnfolderBase]: For 667065/667067 co-relation queries the response was YES. [2024-06-14 13:08:58,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48829 conditions, 6403 events. 4182/6403 cut-off events. For 667065/667067 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 36763 event pairs, 890 based on Foata normal form. 4/6405 useless extension candidates. Maximal degree in co-relation 48653. Up to 6339 conditions per place. [2024-06-14 13:08:58,868 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 513 selfloop transitions, 35 changer transitions 0/551 dead transitions. [2024-06-14 13:08:58,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 551 transitions, 8304 flow [2024-06-14 13:08:58,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:08:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:08:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-14 13:08:58,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3623693379790941 [2024-06-14 13:08:58,870 INFO L175 Difference]: Start difference. First operand has 380 places, 540 transitions, 7182 flow. Second operand 7 states and 104 transitions. [2024-06-14 13:08:58,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 551 transitions, 8304 flow [2024-06-14 13:09:00,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 551 transitions, 8207 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-14 13:09:00,928 INFO L231 Difference]: Finished difference. Result has 384 places, 540 transitions, 7160 flow [2024-06-14 13:09:00,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7085, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7160, PETRI_PLACES=384, PETRI_TRANSITIONS=540} [2024-06-14 13:09:00,929 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 342 predicate places. [2024-06-14 13:09:00,929 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 540 transitions, 7160 flow [2024-06-14 13:09:00,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:00,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:00,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:00,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 13:09:00,930 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:00,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:00,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1031897365, now seen corresponding path program 1 times [2024-06-14 13:09:00,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:00,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263296101] [2024-06-14 13:09:00,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:00,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:09:01,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:01,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263296101] [2024-06-14 13:09:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263296101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:01,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:09:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275638890] [2024-06-14 13:09:01,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:01,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:09:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:09:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:09:01,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:01,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 540 transitions, 7160 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:01,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:01,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:01,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:03,398 INFO L124 PetriNetUnfolderBase]: 4372/6693 cut-off events. [2024-06-14 13:09:03,399 INFO L125 PetriNetUnfolderBase]: For 831741/831743 co-relation queries the response was YES. [2024-06-14 13:09:03,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52651 conditions, 6693 events. 4372/6693 cut-off events. For 831741/831743 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 38505 event pairs, 779 based on Foata normal form. 18/6709 useless extension candidates. Maximal degree in co-relation 52473. Up to 5494 conditions per place. [2024-06-14 13:09:03,505 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 363 selfloop transitions, 223 changer transitions 0/589 dead transitions. [2024-06-14 13:09:03,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 589 transitions, 8975 flow [2024-06-14 13:09:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:09:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:09:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-14 13:09:03,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 13:09:03,507 INFO L175 Difference]: Start difference. First operand has 384 places, 540 transitions, 7160 flow. Second operand 9 states and 164 transitions. [2024-06-14 13:09:03,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 589 transitions, 8975 flow [2024-06-14 13:09:05,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 589 transitions, 8890 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 13:09:05,570 INFO L231 Difference]: Finished difference. Result has 388 places, 547 transitions, 7651 flow [2024-06-14 13:09:05,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7075, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7651, PETRI_PLACES=388, PETRI_TRANSITIONS=547} [2024-06-14 13:09:05,570 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 346 predicate places. [2024-06-14 13:09:05,570 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 547 transitions, 7651 flow [2024-06-14 13:09:05,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:05,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:05,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:05,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-14 13:09:05,571 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:05,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:05,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1759496525, now seen corresponding path program 2 times [2024-06-14 13:09:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:05,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799589297] [2024-06-14 13:09:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:06,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-14 13:09:06,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:06,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799589297] [2024-06-14 13:09:06,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799589297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:06,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:06,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:09:06,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078447790] [2024-06-14 13:09:06,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:06,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:09:06,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:06,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:09:06,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:09:06,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:06,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 547 transitions, 7651 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:06,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:06,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:06,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:08,068 INFO L124 PetriNetUnfolderBase]: 4588/7021 cut-off events. [2024-06-14 13:09:08,069 INFO L125 PetriNetUnfolderBase]: For 963078/963080 co-relation queries the response was YES. [2024-06-14 13:09:08,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58228 conditions, 7021 events. 4588/7021 cut-off events. For 963078/963080 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 40763 event pairs, 932 based on Foata normal form. 18/7037 useless extension candidates. Maximal degree in co-relation 58048. Up to 5977 conditions per place. [2024-06-14 13:09:08,190 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 371 selfloop transitions, 220 changer transitions 0/594 dead transitions. [2024-06-14 13:09:08,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 594 transitions, 9504 flow [2024-06-14 13:09:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:09:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:09:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-14 13:09:08,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44173441734417346 [2024-06-14 13:09:08,191 INFO L175 Difference]: Start difference. First operand has 388 places, 547 transitions, 7651 flow. Second operand 9 states and 163 transitions. [2024-06-14 13:09:08,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 594 transitions, 9504 flow [2024-06-14 13:09:10,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 594 transitions, 9184 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-14 13:09:10,892 INFO L231 Difference]: Finished difference. Result has 394 places, 554 transitions, 7926 flow [2024-06-14 13:09:10,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7335, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7926, PETRI_PLACES=394, PETRI_TRANSITIONS=554} [2024-06-14 13:09:10,892 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 352 predicate places. [2024-06-14 13:09:10,892 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 554 transitions, 7926 flow [2024-06-14 13:09:10,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:10,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:10,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:10,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-14 13:09:10,893 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:10,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:10,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1759487225, now seen corresponding path program 3 times [2024-06-14 13:09:10,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:10,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560148963] [2024-06-14 13:09:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:10,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:09:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560148963] [2024-06-14 13:09:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560148963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:11,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:11,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:09:11,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455762654] [2024-06-14 13:09:11,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:11,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:09:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:11,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:09:11,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:09:11,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:11,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 554 transitions, 7926 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:11,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:11,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:11,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:13,539 INFO L124 PetriNetUnfolderBase]: 4650/7119 cut-off events. [2024-06-14 13:09:13,540 INFO L125 PetriNetUnfolderBase]: For 1001165/1001167 co-relation queries the response was YES. [2024-06-14 13:09:13,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59244 conditions, 7119 events. 4650/7119 cut-off events. For 1001165/1001167 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 41453 event pairs, 950 based on Foata normal form. 26/7143 useless extension candidates. Maximal degree in co-relation 59061. Up to 6227 conditions per place. [2024-06-14 13:09:13,654 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 370 selfloop transitions, 219 changer transitions 0/592 dead transitions. [2024-06-14 13:09:13,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 592 transitions, 9498 flow [2024-06-14 13:09:13,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:09:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:09:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-14 13:09:13,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-14 13:09:13,656 INFO L175 Difference]: Start difference. First operand has 394 places, 554 transitions, 7926 flow. Second operand 9 states and 161 transitions. [2024-06-14 13:09:13,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 592 transitions, 9498 flow [2024-06-14 13:09:15,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 592 transitions, 9180 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-14 13:09:15,432 INFO L231 Difference]: Finished difference. Result has 398 places, 557 transitions, 8142 flow [2024-06-14 13:09:15,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7608, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8142, PETRI_PLACES=398, PETRI_TRANSITIONS=557} [2024-06-14 13:09:15,433 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 356 predicate places. [2024-06-14 13:09:15,433 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 557 transitions, 8142 flow [2024-06-14 13:09:15,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:15,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:15,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:15,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-14 13:09:15,433 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:15,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1500882125, now seen corresponding path program 4 times [2024-06-14 13:09:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381092179] [2024-06-14 13:09:15,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:09:16,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381092179] [2024-06-14 13:09:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381092179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:16,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:16,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:09:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562517026] [2024-06-14 13:09:16,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:16,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:09:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:09:16,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:09:16,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:16,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 557 transitions, 8142 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:16,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:16,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:16,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:18,188 INFO L124 PetriNetUnfolderBase]: 4696/7193 cut-off events. [2024-06-14 13:09:18,188 INFO L125 PetriNetUnfolderBase]: For 963316/963318 co-relation queries the response was YES. [2024-06-14 13:09:18,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59794 conditions, 7193 events. 4696/7193 cut-off events. For 963316/963318 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 41987 event pairs, 960 based on Foata normal form. 22/7213 useless extension candidates. Maximal degree in co-relation 59609. Up to 6581 conditions per place. [2024-06-14 13:09:18,298 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 433 selfloop transitions, 165 changer transitions 0/601 dead transitions. [2024-06-14 13:09:18,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 601 transitions, 9819 flow [2024-06-14 13:09:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:09:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:09:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-14 13:09:18,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281842818428184 [2024-06-14 13:09:18,300 INFO L175 Difference]: Start difference. First operand has 398 places, 557 transitions, 8142 flow. Second operand 9 states and 158 transitions. [2024-06-14 13:09:18,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 601 transitions, 9819 flow [2024-06-14 13:09:20,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 601 transitions, 9406 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 13:09:20,443 INFO L231 Difference]: Finished difference. Result has 402 places, 567 transitions, 8280 flow [2024-06-14 13:09:20,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7737, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8280, PETRI_PLACES=402, PETRI_TRANSITIONS=567} [2024-06-14 13:09:20,443 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 360 predicate places. [2024-06-14 13:09:20,444 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 567 transitions, 8280 flow [2024-06-14 13:09:20,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:20,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:20,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:20,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-14 13:09:20,444 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:20,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1904710915, now seen corresponding path program 1 times [2024-06-14 13:09:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051017470] [2024-06-14 13:09:20,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:21,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-14 13:09:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051017470] [2024-06-14 13:09:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051017470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:21,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:21,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:09:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613386827] [2024-06-14 13:09:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:21,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:09:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:09:21,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:09:21,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:21,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 567 transitions, 8280 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:21,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:21,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:21,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:22,833 INFO L124 PetriNetUnfolderBase]: 4738/7251 cut-off events. [2024-06-14 13:09:22,833 INFO L125 PetriNetUnfolderBase]: For 917667/917669 co-relation queries the response was YES. [2024-06-14 13:09:22,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60512 conditions, 7251 events. 4738/7251 cut-off events. For 917667/917669 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 42400 event pairs, 926 based on Foata normal form. 2/7251 useless extension candidates. Maximal degree in co-relation 60325. Up to 6714 conditions per place. [2024-06-14 13:09:22,946 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 474 selfloop transitions, 131 changer transitions 0/608 dead transitions. [2024-06-14 13:09:22,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 608 transitions, 10164 flow [2024-06-14 13:09:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:09:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:09:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-14 13:09:22,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-14 13:09:22,947 INFO L175 Difference]: Start difference. First operand has 402 places, 567 transitions, 8280 flow. Second operand 8 states and 142 transitions. [2024-06-14 13:09:22,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 608 transitions, 10164 flow [2024-06-14 13:09:25,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 608 transitions, 9743 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 13:09:25,416 INFO L231 Difference]: Finished difference. Result has 404 places, 576 transitions, 8319 flow [2024-06-14 13:09:25,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7859, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8319, PETRI_PLACES=404, PETRI_TRANSITIONS=576} [2024-06-14 13:09:25,417 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 362 predicate places. [2024-06-14 13:09:25,417 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 576 transitions, 8319 flow [2024-06-14 13:09:25,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:25,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:25,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:25,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-14 13:09:25,418 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:25,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:25,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1895778265, now seen corresponding path program 2 times [2024-06-14 13:09:25,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:25,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601220679] [2024-06-14 13:09:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:25,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:26,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-14 13:09:26,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:26,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601220679] [2024-06-14 13:09:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601220679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:26,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:26,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:09:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939107183] [2024-06-14 13:09:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:26,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:09:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:09:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:09:26,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:26,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 576 transitions, 8319 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:26,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:26,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:26,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:28,130 INFO L124 PetriNetUnfolderBase]: 4748/7265 cut-off events. [2024-06-14 13:09:28,130 INFO L125 PetriNetUnfolderBase]: For 932547/932549 co-relation queries the response was YES. [2024-06-14 13:09:28,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60333 conditions, 7265 events. 4748/7265 cut-off events. For 932547/932549 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 42498 event pairs, 1024 based on Foata normal form. 4/7267 useless extension candidates. Maximal degree in co-relation 60145. Up to 7095 conditions per place. [2024-06-14 13:09:28,240 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 537 selfloop transitions, 63 changer transitions 0/603 dead transitions. [2024-06-14 13:09:28,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 603 transitions, 9639 flow [2024-06-14 13:09:28,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:09:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:09:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-14 13:09:28,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-14 13:09:28,241 INFO L175 Difference]: Start difference. First operand has 404 places, 576 transitions, 8319 flow. Second operand 8 states and 131 transitions. [2024-06-14 13:09:28,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 603 transitions, 9639 flow [2024-06-14 13:09:30,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 603 transitions, 9251 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-14 13:09:30,478 INFO L231 Difference]: Finished difference. Result has 406 places, 579 transitions, 8125 flow [2024-06-14 13:09:30,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7941, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8125, PETRI_PLACES=406, PETRI_TRANSITIONS=579} [2024-06-14 13:09:30,479 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 364 predicate places. [2024-06-14 13:09:30,479 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 579 transitions, 8125 flow [2024-06-14 13:09:30,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:30,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:30,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:30,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-14 13:09:30,488 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:30,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1901020675, now seen corresponding path program 3 times [2024-06-14 13:09:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408362005] [2024-06-14 13:09:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:09:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408362005] [2024-06-14 13:09:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408362005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:31,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:09:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354648046] [2024-06-14 13:09:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:31,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:09:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:09:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:09:31,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:31,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 579 transitions, 8125 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:31,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:31,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:31,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:32,918 INFO L124 PetriNetUnfolderBase]: 4790/7323 cut-off events. [2024-06-14 13:09:32,918 INFO L125 PetriNetUnfolderBase]: For 968942/968944 co-relation queries the response was YES. [2024-06-14 13:09:33,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60993 conditions, 7323 events. 4790/7323 cut-off events. For 968942/968944 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 42830 event pairs, 933 based on Foata normal form. 2/7323 useless extension candidates. Maximal degree in co-relation 60805. Up to 6764 conditions per place. [2024-06-14 13:09:33,028 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 484 selfloop transitions, 131 changer transitions 0/618 dead transitions. [2024-06-14 13:09:33,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 618 transitions, 10241 flow [2024-06-14 13:09:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:09:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:09:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-14 13:09:33,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-14 13:09:33,029 INFO L175 Difference]: Start difference. First operand has 406 places, 579 transitions, 8125 flow. Second operand 8 states and 139 transitions. [2024-06-14 13:09:33,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 618 transitions, 10241 flow [2024-06-14 13:09:35,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 618 transitions, 10093 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-14 13:09:35,622 INFO L231 Difference]: Finished difference. Result has 409 places, 588 transitions, 8449 flow [2024-06-14 13:09:35,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7977, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8449, PETRI_PLACES=409, PETRI_TRANSITIONS=588} [2024-06-14 13:09:35,623 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 367 predicate places. [2024-06-14 13:09:35,623 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 588 transitions, 8449 flow [2024-06-14 13:09:35,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:35,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:35,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:35,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-14 13:09:35,624 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:35,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1904894125, now seen corresponding path program 4 times [2024-06-14 13:09:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:35,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563300192] [2024-06-14 13:09:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:09:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:36,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563300192] [2024-06-14 13:09:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563300192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:36,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:36,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:09:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775039722] [2024-06-14 13:09:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:36,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:09:36,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:36,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:09:36,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:09:36,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:36,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 588 transitions, 8449 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:36,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:36,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:36,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:38,099 INFO L124 PetriNetUnfolderBase]: 4784/7315 cut-off events. [2024-06-14 13:09:38,099 INFO L125 PetriNetUnfolderBase]: For 978758/978760 co-relation queries the response was YES. [2024-06-14 13:09:38,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61202 conditions, 7315 events. 4784/7315 cut-off events. For 978758/978760 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 42730 event pairs, 942 based on Foata normal form. 2/7315 useless extension candidates. Maximal degree in co-relation 61013. Up to 6759 conditions per place. [2024-06-14 13:09:38,207 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 485 selfloop transitions, 126 changer transitions 0/614 dead transitions. [2024-06-14 13:09:38,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 614 transitions, 10149 flow [2024-06-14 13:09:38,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:09:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:09:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-14 13:09:38,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-14 13:09:38,209 INFO L175 Difference]: Start difference. First operand has 409 places, 588 transitions, 8449 flow. Second operand 8 states and 135 transitions. [2024-06-14 13:09:38,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 614 transitions, 10149 flow [2024-06-14 13:09:40,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 614 transitions, 9886 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-14 13:09:40,587 INFO L231 Difference]: Finished difference. Result has 413 places, 588 transitions, 8445 flow [2024-06-14 13:09:40,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8186, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8445, PETRI_PLACES=413, PETRI_TRANSITIONS=588} [2024-06-14 13:09:40,588 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 371 predicate places. [2024-06-14 13:09:40,588 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 588 transitions, 8445 flow [2024-06-14 13:09:40,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:40,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:40,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:40,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-14 13:09:40,588 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:40,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1901319577, now seen corresponding path program 1 times [2024-06-14 13:09:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:40,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083296168] [2024-06-14 13:09:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:09:41,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:41,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083296168] [2024-06-14 13:09:41,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083296168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:41,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:41,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:09:41,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741636030] [2024-06-14 13:09:41,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:41,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:09:41,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:41,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:09:41,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:09:41,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:41,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 588 transitions, 8445 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:41,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:41,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:41,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:43,228 INFO L124 PetriNetUnfolderBase]: 5012/7631 cut-off events. [2024-06-14 13:09:43,228 INFO L125 PetriNetUnfolderBase]: For 1152231/1152233 co-relation queries the response was YES. [2024-06-14 13:09:43,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65416 conditions, 7631 events. 5012/7631 cut-off events. For 1152231/1152233 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 44524 event pairs, 909 based on Foata normal form. 12/7641 useless extension candidates. Maximal degree in co-relation 65226. Up to 5378 conditions per place. [2024-06-14 13:09:43,343 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 384 selfloop transitions, 261 changer transitions 0/648 dead transitions. [2024-06-14 13:09:43,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 648 transitions, 11061 flow [2024-06-14 13:09:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:09:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:09:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-14 13:09:43,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 13:09:43,345 INFO L175 Difference]: Start difference. First operand has 413 places, 588 transitions, 8445 flow. Second operand 9 states and 171 transitions. [2024-06-14 13:09:43,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 648 transitions, 11061 flow [2024-06-14 13:09:46,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 648 transitions, 10784 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-14 13:09:46,146 INFO L231 Difference]: Finished difference. Result has 417 places, 604 transitions, 9036 flow [2024-06-14 13:09:46,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8168, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9036, PETRI_PLACES=417, PETRI_TRANSITIONS=604} [2024-06-14 13:09:46,147 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 375 predicate places. [2024-06-14 13:09:46,147 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 604 transitions, 9036 flow [2024-06-14 13:09:46,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:46,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:46,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:46,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-14 13:09:46,148 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:46,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:46,148 INFO L85 PathProgramCache]: Analyzing trace with hash 408868599, now seen corresponding path program 5 times [2024-06-14 13:09:46,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:46,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884245111] [2024-06-14 13:09:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:46,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:09:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884245111] [2024-06-14 13:09:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884245111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:46,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:46,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:09:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172798627] [2024-06-14 13:09:46,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:46,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:09:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:46,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:09:46,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:09:46,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:46,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 604 transitions, 9036 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:46,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:46,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:46,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:48,814 INFO L124 PetriNetUnfolderBase]: 5006/7623 cut-off events. [2024-06-14 13:09:48,815 INFO L125 PetriNetUnfolderBase]: For 1119935/1119937 co-relation queries the response was YES. [2024-06-14 13:09:48,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67040 conditions, 7623 events. 5006/7623 cut-off events. For 1119935/1119937 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 44551 event pairs, 1073 based on Foata normal form. 4/7625 useless extension candidates. Maximal degree in co-relation 66848. Up to 7398 conditions per place. [2024-06-14 13:09:48,936 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 551 selfloop transitions, 73 changer transitions 0/627 dead transitions. [2024-06-14 13:09:48,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 627 transitions, 10554 flow [2024-06-14 13:09:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:09:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:09:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2024-06-14 13:09:48,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36829268292682926 [2024-06-14 13:09:48,937 INFO L175 Difference]: Start difference. First operand has 417 places, 604 transitions, 9036 flow. Second operand 10 states and 151 transitions. [2024-06-14 13:09:48,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 627 transitions, 10554 flow [2024-06-14 13:09:51,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 627 transitions, 10262 flow, removed 69 selfloop flow, removed 3 redundant places. [2024-06-14 13:09:51,970 INFO L231 Difference]: Finished difference. Result has 424 places, 604 transitions, 8896 flow [2024-06-14 13:09:51,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8744, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8896, PETRI_PLACES=424, PETRI_TRANSITIONS=604} [2024-06-14 13:09:51,970 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 382 predicate places. [2024-06-14 13:09:51,970 INFO L495 AbstractCegarLoop]: Abstraction has has 424 places, 604 transitions, 8896 flow [2024-06-14 13:09:51,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:51,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:51,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:51,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-14 13:09:51,971 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:51,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 408874551, now seen corresponding path program 2 times [2024-06-14 13:09:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215811] [2024-06-14 13:09:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:51,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:52,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-14 13:09:52,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215811] [2024-06-14 13:09:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:52,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:52,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:09:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506924476] [2024-06-14 13:09:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:52,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:09:52,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:52,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:09:52,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:09:52,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:52,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 604 transitions, 8896 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:52,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:52,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:52,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:09:54,740 INFO L124 PetriNetUnfolderBase]: 5186/7873 cut-off events. [2024-06-14 13:09:54,741 INFO L125 PetriNetUnfolderBase]: For 1271340/1271342 co-relation queries the response was YES. [2024-06-14 13:09:54,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69926 conditions, 7873 events. 5186/7873 cut-off events. For 1271340/1271342 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 46031 event pairs, 1019 based on Foata normal form. 14/7885 useless extension candidates. Maximal degree in co-relation 69732. Up to 6892 conditions per place. [2024-06-14 13:09:54,870 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 425 selfloop transitions, 218 changer transitions 0/646 dead transitions. [2024-06-14 13:09:54,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 646 transitions, 11110 flow [2024-06-14 13:09:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:09:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:09:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-14 13:09:54,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-14 13:09:54,871 INFO L175 Difference]: Start difference. First operand has 424 places, 604 transitions, 8896 flow. Second operand 9 states and 161 transitions. [2024-06-14 13:09:54,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 646 transitions, 11110 flow [2024-06-14 13:09:57,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 646 transitions, 10907 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 13:09:57,959 INFO L231 Difference]: Finished difference. Result has 426 places, 614 transitions, 9353 flow [2024-06-14 13:09:57,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8693, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9353, PETRI_PLACES=426, PETRI_TRANSITIONS=614} [2024-06-14 13:09:57,960 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 384 predicate places. [2024-06-14 13:09:57,960 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 614 transitions, 9353 flow [2024-06-14 13:09:57,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:57,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:09:57,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:09:57,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-14 13:09:57,960 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:09:57,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:09:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1405688165, now seen corresponding path program 3 times [2024-06-14 13:09:57,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:09:57,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142405350] [2024-06-14 13:09:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:09:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:09:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:09:58,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-14 13:09:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:09:58,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142405350] [2024-06-14 13:09:58,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142405350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:09:58,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:09:58,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:09:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909951963] [2024-06-14 13:09:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:09:58,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:09:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:09:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:09:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:09:58,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:09:58,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 614 transitions, 9353 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:09:58,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:09:58,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:09:58,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:10:00,848 INFO L124 PetriNetUnfolderBase]: 5182/7869 cut-off events. [2024-06-14 13:10:00,849 INFO L125 PetriNetUnfolderBase]: For 1252287/1252289 co-relation queries the response was YES. [2024-06-14 13:10:00,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70109 conditions, 7869 events. 5182/7869 cut-off events. For 1252287/1252289 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 45976 event pairs, 1023 based on Foata normal form. 14/7881 useless extension candidates. Maximal degree in co-relation 69913. Up to 6896 conditions per place. [2024-06-14 13:10:00,976 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 425 selfloop transitions, 226 changer transitions 0/654 dead transitions. [2024-06-14 13:10:00,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 654 transitions, 11467 flow [2024-06-14 13:10:00,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 13:10:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 13:10:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-14 13:10:00,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212860310421286 [2024-06-14 13:10:00,978 INFO L175 Difference]: Start difference. First operand has 426 places, 614 transitions, 9353 flow. Second operand 11 states and 190 transitions. [2024-06-14 13:10:00,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 654 transitions, 11467 flow [2024-06-14 13:10:04,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 654 transitions, 11099 flow, removed 53 selfloop flow, removed 5 redundant places. [2024-06-14 13:10:04,047 INFO L231 Difference]: Finished difference. Result has 432 places, 618 transitions, 9528 flow [2024-06-14 13:10:04,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8995, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9528, PETRI_PLACES=432, PETRI_TRANSITIONS=618} [2024-06-14 13:10:04,048 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 390 predicate places. [2024-06-14 13:10:04,048 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 618 transitions, 9528 flow [2024-06-14 13:10:04,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:04,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:10:04,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:10:04,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-14 13:10:04,048 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:10:04,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:10:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash 408874179, now seen corresponding path program 6 times [2024-06-14 13:10:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:10:04,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123633387] [2024-06-14 13:10:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:10:04,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:10:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:10:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:10:04,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:10:04,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123633387] [2024-06-14 13:10:04,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123633387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:10:04,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:10:04,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:10:04,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481803847] [2024-06-14 13:10:04,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:10:04,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:10:04,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:10:04,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:10:04,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:10:04,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:10:04,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 618 transitions, 9528 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:04,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:10:04,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:10:04,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:10:06,782 INFO L124 PetriNetUnfolderBase]: 5176/7861 cut-off events. [2024-06-14 13:10:06,782 INFO L125 PetriNetUnfolderBase]: For 1205555/1205557 co-relation queries the response was YES. [2024-06-14 13:10:06,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70422 conditions, 7861 events. 5176/7861 cut-off events. For 1205555/1205557 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 45965 event pairs, 1112 based on Foata normal form. 4/7863 useless extension candidates. Maximal degree in co-relation 70224. Up to 7639 conditions per place. [2024-06-14 13:10:06,916 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 566 selfloop transitions, 68 changer transitions 0/637 dead transitions. [2024-06-14 13:10:06,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 637 transitions, 10850 flow [2024-06-14 13:10:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:10:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:10:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-14 13:10:06,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-14 13:10:06,918 INFO L175 Difference]: Start difference. First operand has 432 places, 618 transitions, 9528 flow. Second operand 8 states and 126 transitions. [2024-06-14 13:10:06,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 637 transitions, 10850 flow [2024-06-14 13:10:10,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 637 transitions, 10298 flow, removed 51 selfloop flow, removed 9 redundant places. [2024-06-14 13:10:10,496 INFO L231 Difference]: Finished difference. Result has 431 places, 618 transitions, 9120 flow [2024-06-14 13:10:10,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8976, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9120, PETRI_PLACES=431, PETRI_TRANSITIONS=618} [2024-06-14 13:10:10,497 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 389 predicate places. [2024-06-14 13:10:10,497 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 618 transitions, 9120 flow [2024-06-14 13:10:10,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:10,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:10:10,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:10:10,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-14 13:10:10,498 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:10:10,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:10:10,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1604989955, now seen corresponding path program 4 times [2024-06-14 13:10:10,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:10:10,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137703373] [2024-06-14 13:10:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:10:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:10:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:10:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:10:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:10:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137703373] [2024-06-14 13:10:11,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137703373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:10:11,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:10:11,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:10:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314036874] [2024-06-14 13:10:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:10:11,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:10:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:10:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:10:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:10:11,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:10:11,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 618 transitions, 9120 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:11,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:10:11,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:10:11,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:10:13,445 INFO L124 PetriNetUnfolderBase]: 5556/8385 cut-off events. [2024-06-14 13:10:13,445 INFO L125 PetriNetUnfolderBase]: For 1514638/1514640 co-relation queries the response was YES. [2024-06-14 13:10:13,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77914 conditions, 8385 events. 5556/8385 cut-off events. For 1514638/1514640 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 49010 event pairs, 1072 based on Foata normal form. 14/8397 useless extension candidates. Maximal degree in co-relation 77715. Up to 6906 conditions per place. [2024-06-14 13:10:13,593 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 449 selfloop transitions, 225 changer transitions 0/677 dead transitions. [2024-06-14 13:10:13,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 677 transitions, 11920 flow [2024-06-14 13:10:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 13:10:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 13:10:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 204 transitions. [2024-06-14 13:10:13,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 13:10:13,595 INFO L175 Difference]: Start difference. First operand has 431 places, 618 transitions, 9120 flow. Second operand 12 states and 204 transitions. [2024-06-14 13:10:13,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 677 transitions, 11920 flow [2024-06-14 13:10:17,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 677 transitions, 11784 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-14 13:10:17,830 INFO L231 Difference]: Finished difference. Result has 439 places, 636 transitions, 9886 flow [2024-06-14 13:10:17,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8984, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9886, PETRI_PLACES=439, PETRI_TRANSITIONS=636} [2024-06-14 13:10:17,831 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 397 predicate places. [2024-06-14 13:10:17,831 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 636 transitions, 9886 flow [2024-06-14 13:10:17,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:17,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:10:17,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:10:17,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-14 13:10:17,831 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:10:17,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:10:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1612341605, now seen corresponding path program 5 times [2024-06-14 13:10:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:10:17,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813132593] [2024-06-14 13:10:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:10:17,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:10:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:10:18,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-14 13:10:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:10:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813132593] [2024-06-14 13:10:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813132593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:10:18,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:10:18,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:10:18,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741217808] [2024-06-14 13:10:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:10:18,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:10:18,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:10:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:10:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:10:18,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:10:18,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 636 transitions, 9886 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:18,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:10:18,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:10:18,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:10:20,940 INFO L124 PetriNetUnfolderBase]: 5584/8425 cut-off events. [2024-06-14 13:10:20,941 INFO L125 PetriNetUnfolderBase]: For 1530667/1530669 co-relation queries the response was YES. [2024-06-14 13:10:21,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79568 conditions, 8425 events. 5584/8425 cut-off events. For 1530667/1530669 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 49301 event pairs, 1037 based on Foata normal form. 14/8437 useless extension candidates. Maximal degree in co-relation 79365. Up to 6938 conditions per place. [2024-06-14 13:10:21,100 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 432 selfloop transitions, 244 changer transitions 0/679 dead transitions. [2024-06-14 13:10:21,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 679 transitions, 12221 flow [2024-06-14 13:10:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 13:10:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 13:10:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-14 13:10:21,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 13:10:21,101 INFO L175 Difference]: Start difference. First operand has 439 places, 636 transitions, 9886 flow. Second operand 11 states and 187 transitions. [2024-06-14 13:10:21,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 679 transitions, 12221 flow [2024-06-14 13:10:25,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 679 transitions, 11640 flow, removed 97 selfloop flow, removed 7 redundant places. [2024-06-14 13:10:25,812 INFO L231 Difference]: Finished difference. Result has 444 places, 645 transitions, 10060 flow [2024-06-14 13:10:25,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9329, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10060, PETRI_PLACES=444, PETRI_TRANSITIONS=645} [2024-06-14 13:10:25,812 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 402 predicate places. [2024-06-14 13:10:25,813 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 645 transitions, 10060 flow [2024-06-14 13:10:25,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:25,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:10:25,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:10:25,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-14 13:10:25,813 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:10:25,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:10:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1604984375, now seen corresponding path program 6 times [2024-06-14 13:10:25,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:10:25,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118230030] [2024-06-14 13:10:25,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:10:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:10:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:10:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:10:26,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:10:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118230030] [2024-06-14 13:10:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118230030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:10:26,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:10:26,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:10:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844108634] [2024-06-14 13:10:26,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:10:26,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:10:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:10:26,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:10:26,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:10:26,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:10:26,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 645 transitions, 10060 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:26,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:10:26,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:10:26,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:10:29,200 INFO L124 PetriNetUnfolderBase]: 5556/8389 cut-off events. [2024-06-14 13:10:29,201 INFO L125 PetriNetUnfolderBase]: For 1485337/1485339 co-relation queries the response was YES. [2024-06-14 13:10:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77967 conditions, 8389 events. 5556/8389 cut-off events. For 1485337/1485339 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 49105 event pairs, 1060 based on Foata normal form. 14/8401 useless extension candidates. Maximal degree in co-relation 77762. Up to 6930 conditions per place. [2024-06-14 13:10:29,330 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 448 selfloop transitions, 226 changer transitions 0/677 dead transitions. [2024-06-14 13:10:29,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 677 transitions, 12184 flow [2024-06-14 13:10:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:10:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:10:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-14 13:10:29,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-14 13:10:29,331 INFO L175 Difference]: Start difference. First operand has 444 places, 645 transitions, 10060 flow. Second operand 10 states and 174 transitions. [2024-06-14 13:10:29,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 677 transitions, 12184 flow [2024-06-14 13:10:33,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 677 transitions, 11764 flow, removed 89 selfloop flow, removed 6 redundant places. [2024-06-14 13:10:33,242 INFO L231 Difference]: Finished difference. Result has 448 places, 645 transitions, 10101 flow [2024-06-14 13:10:33,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9640, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10101, PETRI_PLACES=448, PETRI_TRANSITIONS=645} [2024-06-14 13:10:33,243 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 406 predicate places. [2024-06-14 13:10:33,243 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 645 transitions, 10101 flow [2024-06-14 13:10:33,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:33,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:10:33,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:10:33,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-14 13:10:33,243 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:10:33,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:10:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1612230377, now seen corresponding path program 1 times [2024-06-14 13:10:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:10:33,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425354634] [2024-06-14 13:10:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:10:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:10:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:10:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:10:34,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:10:34,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425354634] [2024-06-14 13:10:34,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425354634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:10:34,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:10:34,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:10:34,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631443541] [2024-06-14 13:10:34,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:10:34,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:10:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:10:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:10:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:10:34,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:10:34,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 645 transitions, 10101 flow. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:34,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:10:34,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:10:34,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:10:36,486 INFO L124 PetriNetUnfolderBase]: 5572/8413 cut-off events. [2024-06-14 13:10:36,487 INFO L125 PetriNetUnfolderBase]: For 1462275/1462277 co-relation queries the response was YES. [2024-06-14 13:10:36,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78547 conditions, 8413 events. 5572/8413 cut-off events. For 1462275/1462277 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 49382 event pairs, 1096 based on Foata normal form. 6/8417 useless extension candidates. Maximal degree in co-relation 78340. Up to 7907 conditions per place. [2024-06-14 13:10:36,891 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 539 selfloop transitions, 129 changer transitions 0/671 dead transitions. [2024-06-14 13:10:36,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 671 transitions, 11807 flow [2024-06-14 13:10:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:10:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:10:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-14 13:10:36,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-14 13:10:36,893 INFO L175 Difference]: Start difference. First operand has 448 places, 645 transitions, 10101 flow. Second operand 9 states and 145 transitions. [2024-06-14 13:10:36,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 671 transitions, 11807 flow [2024-06-14 13:10:41,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 671 transitions, 11355 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 13:10:41,733 INFO L231 Difference]: Finished difference. Result has 448 places, 648 transitions, 10011 flow [2024-06-14 13:10:41,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9649, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10011, PETRI_PLACES=448, PETRI_TRANSITIONS=648} [2024-06-14 13:10:41,733 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 406 predicate places. [2024-06-14 13:10:41,733 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 648 transitions, 10011 flow [2024-06-14 13:10:41,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:41,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:10:41,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:10:41,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-14 13:10:41,734 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:10:41,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:10:41,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1197297583, now seen corresponding path program 2 times [2024-06-14 13:10:41,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:10:41,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087075213] [2024-06-14 13:10:41,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:10:41,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:10:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:10:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:10:42,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:10:42,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087075213] [2024-06-14 13:10:42,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087075213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:10:42,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:10:42,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:10:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451784064] [2024-06-14 13:10:42,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:10:42,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:10:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:10:42,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:10:42,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:10:42,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:10:42,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 648 transitions, 10011 flow. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:42,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:10:42,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:10:42,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:10:45,030 INFO L124 PetriNetUnfolderBase]: 5660/8549 cut-off events. [2024-06-14 13:10:45,030 INFO L125 PetriNetUnfolderBase]: For 1608317/1608319 co-relation queries the response was YES. [2024-06-14 13:10:45,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79540 conditions, 8549 events. 5660/8549 cut-off events. For 1608317/1608319 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 50290 event pairs, 1100 based on Foata normal form. 26/8573 useless extension candidates. Maximal degree in co-relation 79332. Up to 7649 conditions per place. [2024-06-14 13:10:45,190 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 486 selfloop transitions, 190 changer transitions 0/679 dead transitions. [2024-06-14 13:10:45,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 679 transitions, 11775 flow [2024-06-14 13:10:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:10:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:10:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-14 13:10:45,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-14 13:10:45,191 INFO L175 Difference]: Start difference. First operand has 448 places, 648 transitions, 10011 flow. Second operand 9 states and 155 transitions. [2024-06-14 13:10:45,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 679 transitions, 11775 flow [2024-06-14 13:10:48,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 679 transitions, 11534 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-14 13:10:48,878 INFO L231 Difference]: Finished difference. Result has 452 places, 651 transitions, 10262 flow [2024-06-14 13:10:48,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9770, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10262, PETRI_PLACES=452, PETRI_TRANSITIONS=651} [2024-06-14 13:10:48,879 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 410 predicate places. [2024-06-14 13:10:48,879 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 651 transitions, 10262 flow [2024-06-14 13:10:48,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:48,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:10:48,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:10:48,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-14 13:10:48,880 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:10:48,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:10:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1186185013, now seen corresponding path program 3 times [2024-06-14 13:10:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:10:48,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725001538] [2024-06-14 13:10:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:10:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:10:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:10:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:10:50,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:10:50,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725001538] [2024-06-14 13:10:50,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725001538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:10:50,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:10:50,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:10:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504874725] [2024-06-14 13:10:50,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:10:50,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:10:50,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:10:50,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:10:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:10:50,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:10:50,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 651 transitions, 10262 flow. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:50,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:10:50,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:10:50,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:10:52,800 INFO L124 PetriNetUnfolderBase]: 5705/8616 cut-off events. [2024-06-14 13:10:52,800 INFO L125 PetriNetUnfolderBase]: For 1541088/1541090 co-relation queries the response was YES. [2024-06-14 13:10:53,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81295 conditions, 8616 events. 5705/8616 cut-off events. For 1541088/1541090 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 50765 event pairs, 1116 based on Foata normal form. 6/8620 useless extension candidates. Maximal degree in co-relation 81086. Up to 8013 conditions per place. [2024-06-14 13:10:53,041 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 549 selfloop transitions, 133 changer transitions 0/685 dead transitions. [2024-06-14 13:10:53,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 685 transitions, 12416 flow [2024-06-14 13:10:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:10:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:10:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-14 13:10:53,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3956639566395664 [2024-06-14 13:10:53,042 INFO L175 Difference]: Start difference. First operand has 452 places, 651 transitions, 10262 flow. Second operand 9 states and 146 transitions. [2024-06-14 13:10:53,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 685 transitions, 12416 flow [2024-06-14 13:10:56,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 685 transitions, 11926 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-14 13:10:56,608 INFO L231 Difference]: Finished difference. Result has 455 places, 659 transitions, 10339 flow [2024-06-14 13:10:56,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9812, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10339, PETRI_PLACES=455, PETRI_TRANSITIONS=659} [2024-06-14 13:10:56,609 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 413 predicate places. [2024-06-14 13:10:56,609 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 659 transitions, 10339 flow [2024-06-14 13:10:56,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:56,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:10:56,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:10:56,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-14 13:10:56,609 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:10:56,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:10:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1186584727, now seen corresponding path program 5 times [2024-06-14 13:10:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:10:56,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093747734] [2024-06-14 13:10:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:10:56,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:10:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:10:57,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-14 13:10:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:10:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093747734] [2024-06-14 13:10:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093747734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:10:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:10:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:10:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524519651] [2024-06-14 13:10:57,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:10:57,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:10:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:10:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:10:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:10:57,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:10:57,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 659 transitions, 10339 flow. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:10:57,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:10:57,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:10:57,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:11:00,380 INFO L124 PetriNetUnfolderBase]: 5797/8756 cut-off events. [2024-06-14 13:11:00,380 INFO L125 PetriNetUnfolderBase]: For 1669824/1669826 co-relation queries the response was YES. [2024-06-14 13:11:00,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82249 conditions, 8756 events. 5797/8756 cut-off events. For 1669824/1669826 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 51743 event pairs, 1105 based on Foata normal form. 22/8776 useless extension candidates. Maximal degree in co-relation 82038. Up to 7844 conditions per place. [2024-06-14 13:11:00,537 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 489 selfloop transitions, 203 changer transitions 0/695 dead transitions. [2024-06-14 13:11:00,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 695 transitions, 12181 flow [2024-06-14 13:11:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:11:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:11:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-14 13:11:00,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4073170731707317 [2024-06-14 13:11:00,538 INFO L175 Difference]: Start difference. First operand has 455 places, 659 transitions, 10339 flow. Second operand 10 states and 167 transitions. [2024-06-14 13:11:00,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 695 transitions, 12181 flow [2024-06-14 13:11:04,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 695 transitions, 11907 flow, removed 65 selfloop flow, removed 5 redundant places. [2024-06-14 13:11:04,488 INFO L231 Difference]: Finished difference. Result has 461 places, 665 transitions, 10626 flow [2024-06-14 13:11:04,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10065, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10626, PETRI_PLACES=461, PETRI_TRANSITIONS=665} [2024-06-14 13:11:04,488 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 419 predicate places. [2024-06-14 13:11:04,489 INFO L495 AbstractCegarLoop]: Abstraction has has 461 places, 665 transitions, 10626 flow [2024-06-14 13:11:04,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:04,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:11:04,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:11:04,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-14 13:11:04,489 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:11:04,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:11:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1197309487, now seen corresponding path program 6 times [2024-06-14 13:11:04,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:11:04,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376581735] [2024-06-14 13:11:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:11:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:11:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:11:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:11:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:11:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376581735] [2024-06-14 13:11:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376581735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:11:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:11:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:11:05,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713630100] [2024-06-14 13:11:05,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:11:05,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:11:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:11:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:11:05,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:11:05,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:11:05,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 665 transitions, 10626 flow. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:05,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:11:05,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:11:05,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:11:08,518 INFO L124 PetriNetUnfolderBase]: 5869/8868 cut-off events. [2024-06-14 13:11:08,518 INFO L125 PetriNetUnfolderBase]: For 1704569/1704571 co-relation queries the response was YES. [2024-06-14 13:11:08,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83795 conditions, 8868 events. 5869/8868 cut-off events. For 1704569/1704571 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 52501 event pairs, 1135 based on Foata normal form. 22/8888 useless extension candidates. Maximal degree in co-relation 83581. Up to 7872 conditions per place. [2024-06-14 13:11:08,673 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 497 selfloop transitions, 197 changer transitions 0/697 dead transitions. [2024-06-14 13:11:08,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 697 transitions, 12404 flow [2024-06-14 13:11:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:11:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:11:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-14 13:11:08,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097560975609756 [2024-06-14 13:11:08,675 INFO L175 Difference]: Start difference. First operand has 461 places, 665 transitions, 10626 flow. Second operand 10 states and 168 transitions. [2024-06-14 13:11:08,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 697 transitions, 12404 flow [2024-06-14 13:11:12,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 697 transitions, 11964 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-14 13:11:12,841 INFO L231 Difference]: Finished difference. Result has 464 places, 667 transitions, 10661 flow [2024-06-14 13:11:12,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10186, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10661, PETRI_PLACES=464, PETRI_TRANSITIONS=667} [2024-06-14 13:11:12,842 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 422 predicate places. [2024-06-14 13:11:12,842 INFO L495 AbstractCegarLoop]: Abstraction has has 464 places, 667 transitions, 10661 flow [2024-06-14 13:11:12,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:12,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:11:12,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:11:12,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-14 13:11:12,842 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:11:12,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:11:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1197635917, now seen corresponding path program 7 times [2024-06-14 13:11:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:11:12,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285145650] [2024-06-14 13:11:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:11:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:11:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:11:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:11:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:11:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285145650] [2024-06-14 13:11:13,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285145650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:11:13,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:11:13,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:11:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229696838] [2024-06-14 13:11:13,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:11:13,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:11:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:11:13,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:11:13,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:11:13,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:11:13,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 667 transitions, 10661 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:13,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:11:13,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:11:13,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:11:16,583 INFO L124 PetriNetUnfolderBase]: 6007/9082 cut-off events. [2024-06-14 13:11:16,583 INFO L125 PetriNetUnfolderBase]: For 1789303/1789305 co-relation queries the response was YES. [2024-06-14 13:11:16,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86890 conditions, 9082 events. 6007/9082 cut-off events. For 1789303/1789305 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 53906 event pairs, 1155 based on Foata normal form. 18/9098 useless extension candidates. Maximal degree in co-relation 86675. Up to 7832 conditions per place. [2024-06-14 13:11:16,735 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 499 selfloop transitions, 204 changer transitions 0/706 dead transitions. [2024-06-14 13:11:16,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 706 transitions, 12806 flow [2024-06-14 13:11:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:11:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:11:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-14 13:11:16,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-14 13:11:16,736 INFO L175 Difference]: Start difference. First operand has 464 places, 667 transitions, 10661 flow. Second operand 9 states and 157 transitions. [2024-06-14 13:11:16,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 706 transitions, 12806 flow [2024-06-14 13:11:21,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 706 transitions, 12368 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-14 13:11:21,418 INFO L231 Difference]: Finished difference. Result has 466 places, 674 transitions, 10840 flow [2024-06-14 13:11:21,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10223, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10840, PETRI_PLACES=466, PETRI_TRANSITIONS=674} [2024-06-14 13:11:21,418 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 424 predicate places. [2024-06-14 13:11:21,419 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 674 transitions, 10840 flow [2024-06-14 13:11:21,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:21,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:11:21,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:11:21,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-14 13:11:21,419 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:11:21,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:11:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 471419673, now seen corresponding path program 7 times [2024-06-14 13:11:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:11:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381969672] [2024-06-14 13:11:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:11:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:11:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:11:22,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-14 13:11:22,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:11:22,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381969672] [2024-06-14 13:11:22,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381969672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:11:22,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:11:22,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:11:22,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616204590] [2024-06-14 13:11:22,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:11:22,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:11:22,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:11:22,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:11:22,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:11:22,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:11:22,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 674 transitions, 10840 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:22,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:11:22,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:11:22,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:11:25,112 INFO L124 PetriNetUnfolderBase]: 6059/9153 cut-off events. [2024-06-14 13:11:25,112 INFO L125 PetriNetUnfolderBase]: For 1767893/1767893 co-relation queries the response was YES. [2024-06-14 13:11:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88224 conditions, 9153 events. 6059/9153 cut-off events. For 1767893/1767893 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 54541 event pairs, 1292 based on Foata normal form. 4/9155 useless extension candidates. Maximal degree in co-relation 88008. Up to 8606 conditions per place. [2024-06-14 13:11:25,267 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 595 selfloop transitions, 120 changer transitions 0/718 dead transitions. [2024-06-14 13:11:25,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 718 transitions, 13082 flow [2024-06-14 13:11:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:11:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:11:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-14 13:11:25,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41192411924119243 [2024-06-14 13:11:25,268 INFO L175 Difference]: Start difference. First operand has 466 places, 674 transitions, 10840 flow. Second operand 9 states and 152 transitions. [2024-06-14 13:11:25,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 718 transitions, 13082 flow [2024-06-14 13:11:30,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 718 transitions, 12787 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-14 13:11:30,205 INFO L231 Difference]: Finished difference. Result has 471 places, 685 transitions, 11047 flow [2024-06-14 13:11:30,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10545, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11047, PETRI_PLACES=471, PETRI_TRANSITIONS=685} [2024-06-14 13:11:30,206 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 429 predicate places. [2024-06-14 13:11:30,206 INFO L495 AbstractCegarLoop]: Abstraction has has 471 places, 685 transitions, 11047 flow [2024-06-14 13:11:30,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:30,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:11:30,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:11:30,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-14 13:11:30,206 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:11:30,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:11:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash 315349763, now seen corresponding path program 8 times [2024-06-14 13:11:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:11:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032106385] [2024-06-14 13:11:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:11:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:11:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:11:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:11:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:11:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032106385] [2024-06-14 13:11:30,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032106385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:11:30,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:11:30,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:11:30,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748780691] [2024-06-14 13:11:30,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:11:30,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:11:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:11:30,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:11:30,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:11:31,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:11:31,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 685 transitions, 11047 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:31,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:11:31,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:11:31,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:11:33,892 INFO L124 PetriNetUnfolderBase]: 6079/9181 cut-off events. [2024-06-14 13:11:33,892 INFO L125 PetriNetUnfolderBase]: For 1792831/1792831 co-relation queries the response was YES. [2024-06-14 13:11:34,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88820 conditions, 9181 events. 6079/9181 cut-off events. For 1792831/1792831 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 54634 event pairs, 1311 based on Foata normal form. 4/9183 useless extension candidates. Maximal degree in co-relation 88601. Up to 9014 conditions per place. [2024-06-14 13:11:34,058 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 640 selfloop transitions, 75 changer transitions 0/718 dead transitions. [2024-06-14 13:11:34,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 718 transitions, 13133 flow [2024-06-14 13:11:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 13:11:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 13:11:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2024-06-14 13:11:34,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36807095343680707 [2024-06-14 13:11:34,060 INFO L175 Difference]: Start difference. First operand has 471 places, 685 transitions, 11047 flow. Second operand 11 states and 166 transitions. [2024-06-14 13:11:34,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 718 transitions, 13133 flow [2024-06-14 13:11:39,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 718 transitions, 12977 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-14 13:11:39,275 INFO L231 Difference]: Finished difference. Result has 478 places, 689 transitions, 11155 flow [2024-06-14 13:11:39,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10903, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11155, PETRI_PLACES=478, PETRI_TRANSITIONS=689} [2024-06-14 13:11:39,276 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 436 predicate places. [2024-06-14 13:11:39,276 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 689 transitions, 11155 flow [2024-06-14 13:11:39,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:39,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:11:39,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:11:39,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-06-14 13:11:39,277 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:11:39,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:11:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1213384431, now seen corresponding path program 7 times [2024-06-14 13:11:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:11:39,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138114506] [2024-06-14 13:11:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:11:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:11:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:11:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:11:40,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:11:40,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138114506] [2024-06-14 13:11:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138114506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:11:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:11:40,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:11:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546516399] [2024-06-14 13:11:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:11:40,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:11:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:11:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:11:40,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:11:40,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:11:40,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 689 transitions, 11155 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:40,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:11:40,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:11:40,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:11:42,732 INFO L124 PetriNetUnfolderBase]: 6089/9196 cut-off events. [2024-06-14 13:11:42,733 INFO L125 PetriNetUnfolderBase]: For 1805464/1805466 co-relation queries the response was YES. [2024-06-14 13:11:42,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89012 conditions, 9196 events. 6089/9196 cut-off events. For 1805464/1805466 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 54815 event pairs, 1313 based on Foata normal form. 4/9198 useless extension candidates. Maximal degree in co-relation 88791. Up to 9041 conditions per place. [2024-06-14 13:11:42,891 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 663 selfloop transitions, 50 changer transitions 0/716 dead transitions. [2024-06-14 13:11:42,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 716 transitions, 12954 flow [2024-06-14 13:11:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:11:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:11:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-14 13:11:42,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:11:42,893 INFO L175 Difference]: Start difference. First operand has 478 places, 689 transitions, 11155 flow. Second operand 8 states and 128 transitions. [2024-06-14 13:11:42,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 716 transitions, 12954 flow [2024-06-14 13:11:48,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 716 transitions, 12832 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 13:11:48,821 INFO L231 Difference]: Finished difference. Result has 479 places, 692 transitions, 11208 flow [2024-06-14 13:11:48,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11033, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11208, PETRI_PLACES=479, PETRI_TRANSITIONS=692} [2024-06-14 13:11:48,822 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 437 predicate places. [2024-06-14 13:11:48,822 INFO L495 AbstractCegarLoop]: Abstraction has has 479 places, 692 transitions, 11208 flow [2024-06-14 13:11:48,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:48,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:11:48,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:11:48,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-06-14 13:11:48,823 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:11:48,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:11:48,823 INFO L85 PathProgramCache]: Analyzing trace with hash 475138743, now seen corresponding path program 9 times [2024-06-14 13:11:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:11:48,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045652557] [2024-06-14 13:11:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:11:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:11:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:11:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:11:49,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:11:49,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045652557] [2024-06-14 13:11:49,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045652557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:11:49,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:11:49,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:11:49,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816333847] [2024-06-14 13:11:49,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:11:49,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:11:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:11:49,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:11:49,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:11:49,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:11:49,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 692 transitions, 11208 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:49,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:11:49,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:11:49,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:11:52,449 INFO L124 PetriNetUnfolderBase]: 6077/9179 cut-off events. [2024-06-14 13:11:52,449 INFO L125 PetriNetUnfolderBase]: For 1825708/1825708 co-relation queries the response was YES. [2024-06-14 13:11:52,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88665 conditions, 9179 events. 6077/9179 cut-off events. For 1825708/1825708 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 54692 event pairs, 1275 based on Foata normal form. 4/9181 useless extension candidates. Maximal degree in co-relation 88442. Up to 9020 conditions per place. [2024-06-14 13:11:52,605 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 640 selfloop transitions, 74 changer transitions 0/717 dead transitions. [2024-06-14 13:11:52,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 717 transitions, 12946 flow [2024-06-14 13:11:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:11:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:11:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-14 13:11:52,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 13:11:52,607 INFO L175 Difference]: Start difference. First operand has 479 places, 692 transitions, 11208 flow. Second operand 9 states and 144 transitions. [2024-06-14 13:11:52,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 717 transitions, 12946 flow [2024-06-14 13:11:58,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 717 transitions, 12638 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-06-14 13:11:58,537 INFO L231 Difference]: Finished difference. Result has 481 places, 692 transitions, 11054 flow [2024-06-14 13:11:58,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10900, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11054, PETRI_PLACES=481, PETRI_TRANSITIONS=692} [2024-06-14 13:11:58,538 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 439 predicate places. [2024-06-14 13:11:58,538 INFO L495 AbstractCegarLoop]: Abstraction has has 481 places, 692 transitions, 11054 flow [2024-06-14 13:11:58,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:58,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:11:58,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:11:58,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-06-14 13:11:58,539 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:11:58,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:11:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1438940749, now seen corresponding path program 10 times [2024-06-14 13:11:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:11:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330465529] [2024-06-14 13:11:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:11:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:11:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:11:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:11:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:11:59,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330465529] [2024-06-14 13:11:59,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330465529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:11:59,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:11:59,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:11:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113028005] [2024-06-14 13:11:59,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:11:59,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:11:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:11:59,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:11:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:11:59,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:11:59,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 692 transitions, 11054 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:11:59,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:11:59,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:11:59,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:12:02,011 INFO L124 PetriNetUnfolderBase]: 6109/9224 cut-off events. [2024-06-14 13:12:02,011 INFO L125 PetriNetUnfolderBase]: For 1861464/1861464 co-relation queries the response was YES. [2024-06-14 13:12:02,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89170 conditions, 9224 events. 6109/9224 cut-off events. For 1861464/1861464 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 54949 event pairs, 1295 based on Foata normal form. 4/9226 useless extension candidates. Maximal degree in co-relation 88946. Up to 8865 conditions per place. [2024-06-14 13:12:02,187 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 640 selfloop transitions, 86 changer transitions 0/729 dead transitions. [2024-06-14 13:12:02,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 729 transitions, 13250 flow [2024-06-14 13:12:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:12:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:12:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-14 13:12:02,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037940379403794 [2024-06-14 13:12:02,189 INFO L175 Difference]: Start difference. First operand has 481 places, 692 transitions, 11054 flow. Second operand 9 states and 149 transitions. [2024-06-14 13:12:02,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 729 transitions, 13250 flow [2024-06-14 13:12:09,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 729 transitions, 13102 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-14 13:12:09,008 INFO L231 Difference]: Finished difference. Result has 483 places, 698 transitions, 11241 flow [2024-06-14 13:12:09,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10906, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11241, PETRI_PLACES=483, PETRI_TRANSITIONS=698} [2024-06-14 13:12:09,009 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 441 predicate places. [2024-06-14 13:12:09,009 INFO L495 AbstractCegarLoop]: Abstraction has has 483 places, 698 transitions, 11241 flow [2024-06-14 13:12:09,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:12:09,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:12:09,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:12:09,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2024-06-14 13:12:09,010 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:12:09,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:12:09,010 INFO L85 PathProgramCache]: Analyzing trace with hash 370507679, now seen corresponding path program 8 times [2024-06-14 13:12:09,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:12:09,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520025729] [2024-06-14 13:12:09,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:12:09,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:12:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:12:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:12:09,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:12:09,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520025729] [2024-06-14 13:12:09,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520025729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:12:09,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:12:09,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:12:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839229157] [2024-06-14 13:12:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:12:09,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:12:09,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:12:09,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:12:09,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:12:09,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:12:09,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 698 transitions, 11241 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:12:09,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:12:09,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:12:09,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:12:12,458 INFO L124 PetriNetUnfolderBase]: 6119/9239 cut-off events. [2024-06-14 13:12:12,458 INFO L125 PetriNetUnfolderBase]: For 1878223/1878225 co-relation queries the response was YES. [2024-06-14 13:12:12,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89742 conditions, 9239 events. 6119/9239 cut-off events. For 1878223/1878225 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 55135 event pairs, 1306 based on Foata normal form. 4/9241 useless extension candidates. Maximal degree in co-relation 89516. Up to 9080 conditions per place. [2024-06-14 13:12:12,623 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 669 selfloop transitions, 50 changer transitions 0/722 dead transitions. [2024-06-14 13:12:12,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 722 transitions, 13037 flow [2024-06-14 13:12:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:12:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:12:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-14 13:12:12,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-14 13:12:12,624 INFO L175 Difference]: Start difference. First operand has 483 places, 698 transitions, 11241 flow. Second operand 8 states and 126 transitions. [2024-06-14 13:12:12,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 722 transitions, 13037 flow [2024-06-14 13:12:18,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 722 transitions, 12750 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-14 13:12:18,765 INFO L231 Difference]: Finished difference. Result has 485 places, 701 transitions, 11116 flow [2024-06-14 13:12:18,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10954, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11116, PETRI_PLACES=485, PETRI_TRANSITIONS=701} [2024-06-14 13:12:18,766 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 443 predicate places. [2024-06-14 13:12:18,766 INFO L495 AbstractCegarLoop]: Abstraction has has 485 places, 701 transitions, 11116 flow [2024-06-14 13:12:18,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:12:18,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:12:18,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:12:18,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-06-14 13:12:18,767 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 13:12:18,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:12:18,767 INFO L85 PathProgramCache]: Analyzing trace with hash -797169124, now seen corresponding path program 1 times [2024-06-14 13:12:18,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:12:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360289986] [2024-06-14 13:12:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:12:18,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:12:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:12:19,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-14 13:12:19,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:12:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360289986] [2024-06-14 13:12:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360289986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:12:19,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:12:19,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:12:19,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322544848] [2024-06-14 13:12:19,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:12:19,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:12:19,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:12:19,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:12:19,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:12:19,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 13:12:19,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 701 transitions, 11116 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:12:19,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:12:19,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 13:12:19,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:12:22,623 INFO L124 PetriNetUnfolderBase]: 6112/9228 cut-off events. [2024-06-14 13:12:22,623 INFO L125 PetriNetUnfolderBase]: For 1891399/1891399 co-relation queries the response was YES. [2024-06-14 13:12:22,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89383 conditions, 9228 events. 6112/9228 cut-off events. For 1891399/1891399 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 55056 event pairs, 1297 based on Foata normal form. 1/9227 useless extension candidates. Maximal degree in co-relation 89156. Up to 9095 conditions per place. [2024-06-14 13:12:23,007 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 667 selfloop transitions, 57 changer transitions 0/727 dead transitions. [2024-06-14 13:12:23,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 727 transitions, 12952 flow [2024-06-14 13:12:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:12:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:12:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-14 13:12:23,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-14 13:12:23,008 INFO L175 Difference]: Start difference. First operand has 485 places, 701 transitions, 11116 flow. Second operand 8 states and 127 transitions. [2024-06-14 13:12:23,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 727 transitions, 12952 flow