./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/mix041_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/protection/mix041_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:33:07,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:33:07,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:33:07,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:33:07,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:33:07,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:33:07,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:33:07,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:33:07,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:33:07,257 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:33:07,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:33:07,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:33:07,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:33:07,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:33:07,259 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:33:07,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:33:07,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:33:07,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:33:07,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:33:07,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:33:07,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:33:07,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:33:07,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:33:07,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:33:07,262 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:33:07,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:33:07,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:33:07,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:33:07,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:33:07,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:33:07,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:33:07,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:33:07,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:33:07,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:33:07,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:33:07,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:33:07,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:33:07,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:33:07,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:33:07,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:33:07,266 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:33:07,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:33:07,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:33:07,266 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:33:07,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:33:07,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:33:07,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:33:07,523 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:33:07,523 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:33:07,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/mix041_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 18:33:07,658 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:33:07,658 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:33:07,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 18:33:08,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:33:08,928 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:33:08,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 18:33:08,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd1c9555/15b4a5a81f354acf9fd8724bf55b79f1/FLAGcc7349072 [2024-06-27 18:33:08,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd1c9555/15b4a5a81f354acf9fd8724bf55b79f1 [2024-06-27 18:33:08,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:33:08,952 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:33:08,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:33:08,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:33:08,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:33:08,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:33:07" (1/2) ... [2024-06-27 18:33:08,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ecc99 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:33:08, skipping insertion in model container [2024-06-27 18:33:08,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:33:07" (1/2) ... [2024-06-27 18:33:08,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5ed4b509 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:33:08, skipping insertion in model container [2024-06-27 18:33:08,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:33:08" (2/2) ... [2024-06-27 18:33:08,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ecc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:08, skipping insertion in model container [2024-06-27 18:33:08,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:33:08" (2/2) ... [2024-06-27 18:33:08,960 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:33:09,000 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:33:09,001 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] (((((((((((((((! multithreaded || z$r_buff1_thd0 == (_Bool)0) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0) [2024-06-27 18:33:09,001 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((! multithreaded || z$r_buff1_thd0 == (_Bool)0) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0) [2024-06-27 18:33:09,002 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:33:09,002 INFO L106 edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1; [2024-06-27 18:33:09,025 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:33:09,168 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-27 18:33:09,333 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:33:09,341 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:33:09,373 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:33:09,456 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:33:09,493 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:33:09,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09 WrapperNode [2024-06-27 18:33:09,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:33:09,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:33:09,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:33:09,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:33:09,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,556 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2024-06-27 18:33:09,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:33:09,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:33:09,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:33:09,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:33:09,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,596 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 18:33:09,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:33:09,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:33:09,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:33:09,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:33:09,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (1/1) ... [2024-06-27 18:33:09,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:33:09,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:33:09,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 18:33:09,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 18:33:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:33:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:33:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:33:09,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:33:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:33:09,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:33:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:33:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:33:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:33:09,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:33:09,676 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:33:09,812 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:33:09,814 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:33:10,086 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:33:10,086 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:33:10,195 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:33:10,195 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:33:10,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:33:10 BoogieIcfgContainer [2024-06-27 18:33:10,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:33:10,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:33:10,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:33:10,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:33:10,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:33:07" (1/4) ... [2024-06-27 18:33:10,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d82a9af and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:33:10, skipping insertion in model container [2024-06-27 18:33:10,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:33:08" (2/4) ... [2024-06-27 18:33:10,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d82a9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:33:10, skipping insertion in model container [2024-06-27 18:33:10,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:33:09" (3/4) ... [2024-06-27 18:33:10,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d82a9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:33:10, skipping insertion in model container [2024-06-27 18:33:10,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:33:10" (4/4) ... [2024-06-27 18:33:10,206 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 18:33:10,218 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:33:10,219 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 18:33:10,219 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:33:10,251 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:33:10,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-06-27 18:33:10,304 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-06-27 18:33:10,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:33:10,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-06-27 18:33:10,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-06-27 18:33:10,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-06-27 18:33:10,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:33:10,329 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;@4c96ddf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:33:10,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 18:33:10,332 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:33:10,332 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:33:10,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:33:10,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:10,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:33:10,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:10,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:10,340 INFO L85 PathProgramCache]: Analyzing trace with hash 315654007, now seen corresponding path program 1 times [2024-06-27 18:33:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:10,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748934052] [2024-06-27 18:33:10,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:11,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:11,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748934052] [2024-06-27 18:33:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748934052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:11,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:11,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:33:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316060244] [2024-06-27 18:33:11,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:11,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:33:11,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:11,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:33:11,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:33:11,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:33:11,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:11,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:11,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:33:11,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:11,346 INFO L124 PetriNetUnfolderBase]: 559/1092 cut-off events. [2024-06-27 18:33:11,346 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 18:33:11,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 1092 events. 559/1092 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6092 event pairs, 397 based on Foata normal form. 43/1024 useless extension candidates. Maximal degree in co-relation 2030. Up to 920 conditions per place. [2024-06-27 18:33:11,353 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-27 18:33:11,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 169 flow [2024-06-27 18:33:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:33:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:33:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-27 18:33:11,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-06-27 18:33:11,364 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 76 flow. Second operand 3 states and 75 transitions. [2024-06-27 18:33:11,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 169 flow [2024-06-27 18:33:11,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:33:11,369 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 100 flow [2024-06-27 18:33:11,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-27 18:33:11,374 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-27 18:33:11,374 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 100 flow [2024-06-27 18:33:11,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:11,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:11,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:33:11,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:33:11,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:11,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash 315654920, now seen corresponding path program 1 times [2024-06-27 18:33:11,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:11,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532478023] [2024-06-27 18:33:11,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:11,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532478023] [2024-06-27 18:33:11,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532478023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:11,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:11,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:33:11,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730667752] [2024-06-27 18:33:11,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:11,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:33:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:11,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:33:11,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:33:11,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 37 [2024-06-27 18:33:11,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:11,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:11,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 37 [2024-06-27 18:33:11,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:11,493 INFO L124 PetriNetUnfolderBase]: 169/402 cut-off events. [2024-06-27 18:33:11,494 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-27 18:33:11,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 402 events. 169/402 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2151 event pairs, 96 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 759. Up to 256 conditions per place. [2024-06-27 18:33:11,497 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 23 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2024-06-27 18:33:11,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 171 flow [2024-06-27 18:33:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:33:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:33:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 18:33:11,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7657657657657657 [2024-06-27 18:33:11,501 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 100 flow. Second operand 3 states and 85 transitions. [2024-06-27 18:33:11,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 171 flow [2024-06-27 18:33:11,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:33:11,504 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 92 flow [2024-06-27 18:33:11,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-06-27 18:33:11,505 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-27 18:33:11,506 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 92 flow [2024-06-27 18:33:11,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:11,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:11,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:11,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:33:11,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:11,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1599155083, now seen corresponding path program 1 times [2024-06-27 18:33:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906468708] [2024-06-27 18:33:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:11,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906468708] [2024-06-27 18:33:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906468708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:11,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:11,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:33:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257870059] [2024-06-27 18:33:11,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:11,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:33:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:11,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:33:11,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:33:11,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:33:11,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:11,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:11,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:33:11,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:12,050 INFO L124 PetriNetUnfolderBase]: 402/815 cut-off events. [2024-06-27 18:33:12,050 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-06-27 18:33:12,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 815 events. 402/815 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4307 event pairs, 260 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 1667. Up to 658 conditions per place. [2024-06-27 18:33:12,054 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 35 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-06-27 18:33:12,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 220 flow [2024-06-27 18:33:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:33:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:33:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-06-27 18:33:12,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-06-27 18:33:12,056 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 92 flow. Second operand 4 states and 89 transitions. [2024-06-27 18:33:12,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 220 flow [2024-06-27 18:33:12,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:33:12,058 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 135 flow [2024-06-27 18:33:12,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-06-27 18:33:12,059 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-27 18:33:12,059 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 135 flow [2024-06-27 18:33:12,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:12,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:12,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:12,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:33:12,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:12,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1965800764, now seen corresponding path program 1 times [2024-06-27 18:33:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978936979] [2024-06-27 18:33:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978936979] [2024-06-27 18:33:12,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978936979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:12,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:12,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:33:12,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265109472] [2024-06-27 18:33:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:12,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:33:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:12,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:33:12,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:33:12,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:33:12,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:12,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:12,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:33:12,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:12,625 INFO L124 PetriNetUnfolderBase]: 418/854 cut-off events. [2024-06-27 18:33:12,625 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-06-27 18:33:12,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 854 events. 418/854 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4623 event pairs, 147 based on Foata normal form. 3/820 useless extension candidates. Maximal degree in co-relation 1888. Up to 629 conditions per place. [2024-06-27 18:33:12,629 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 46 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-27 18:33:12,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 341 flow [2024-06-27 18:33:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:33:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:33:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-27 18:33:12,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2024-06-27 18:33:12,631 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 135 flow. Second operand 5 states and 116 transitions. [2024-06-27 18:33:12,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 341 flow [2024-06-27 18:33:12,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 334 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 18:33:12,633 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 216 flow [2024-06-27 18:33:12,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-06-27 18:33:12,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-06-27 18:33:12,635 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 216 flow [2024-06-27 18:33:12,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:12,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:12,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:12,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:33:12,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:12,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash 810282356, now seen corresponding path program 1 times [2024-06-27 18:33:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:12,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748704826] [2024-06-27 18:33:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748704826] [2024-06-27 18:33:13,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748704826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:13,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:13,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:33:13,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962597161] [2024-06-27 18:33:13,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:13,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:33:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:13,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:33:13,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:33:13,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:33:13,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-27 18:33:13,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:13,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:33:13,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:13,356 INFO L124 PetriNetUnfolderBase]: 428/794 cut-off events. [2024-06-27 18:33:13,357 INFO L125 PetriNetUnfolderBase]: For 798/798 co-relation queries the response was YES. [2024-06-27 18:33:13,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 794 events. 428/794 cut-off events. For 798/798 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4024 event pairs, 77 based on Foata normal form. 3/787 useless extension candidates. Maximal degree in co-relation 2200. Up to 593 conditions per place. [2024-06-27 18:33:13,361 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 56 selfloop transitions, 23 changer transitions 0/89 dead transitions. [2024-06-27 18:33:13,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 526 flow [2024-06-27 18:33:13,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:33:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:33:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-06-27 18:33:13,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6261261261261262 [2024-06-27 18:33:13,363 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 216 flow. Second operand 6 states and 139 transitions. [2024-06-27 18:33:13,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 526 flow [2024-06-27 18:33:13,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 522 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 18:33:13,367 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 364 flow [2024-06-27 18:33:13,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2024-06-27 18:33:13,367 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-06-27 18:33:13,368 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 364 flow [2024-06-27 18:33:13,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-27 18:33:13,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:13,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:13,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:33:13,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:13,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash -651049893, now seen corresponding path program 1 times [2024-06-27 18:33:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:13,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679619534] [2024-06-27 18:33:13,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:13,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-27 18:33:13,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:13,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679619534] [2024-06-27 18:33:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679619534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:33:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761336039] [2024-06-27 18:33:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:13,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:33:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:33:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:33:14,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:33:14,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:14,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:14,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:33:14,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:14,244 INFO L124 PetriNetUnfolderBase]: 448/894 cut-off events. [2024-06-27 18:33:14,244 INFO L125 PetriNetUnfolderBase]: For 1617/1617 co-relation queries the response was YES. [2024-06-27 18:33:14,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 894 events. 448/894 cut-off events. For 1617/1617 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4856 event pairs, 69 based on Foata normal form. 6/867 useless extension candidates. Maximal degree in co-relation 2824. Up to 606 conditions per place. [2024-06-27 18:33:14,250 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 68 selfloop transitions, 18 changer transitions 0/96 dead transitions. [2024-06-27 18:33:14,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 673 flow [2024-06-27 18:33:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:33:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:33:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 18:33:14,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6023166023166023 [2024-06-27 18:33:14,251 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 364 flow. Second operand 7 states and 156 transitions. [2024-06-27 18:33:14,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 673 flow [2024-06-27 18:33:14,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 96 transitions, 645 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-06-27 18:33:14,257 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 422 flow [2024-06-27 18:33:14,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=422, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-06-27 18:33:14,257 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2024-06-27 18:33:14,258 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 422 flow [2024-06-27 18:33:14,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:14,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:14,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:14,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:33:14,258 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:14,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash -981548492, now seen corresponding path program 1 times [2024-06-27 18:33:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:14,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080898244] [2024-06-27 18:33:14,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:14,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:14,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:14,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080898244] [2024-06-27 18:33:14,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080898244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:14,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:14,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:33:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684490693] [2024-06-27 18:33:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:14,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:33:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:33:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:33:14,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:33:14,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 422 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:14,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:14,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:33:14,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:14,881 INFO L124 PetriNetUnfolderBase]: 524/1046 cut-off events. [2024-06-27 18:33:14,881 INFO L125 PetriNetUnfolderBase]: For 2094/2094 co-relation queries the response was YES. [2024-06-27 18:33:14,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3370 conditions, 1046 events. 524/1046 cut-off events. For 2094/2094 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5790 event pairs, 157 based on Foata normal form. 1/1011 useless extension candidates. Maximal degree in co-relation 3340. Up to 856 conditions per place. [2024-06-27 18:33:14,888 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 56 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2024-06-27 18:33:14,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 578 flow [2024-06-27 18:33:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:33:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:33:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-27 18:33:14,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-27 18:33:14,890 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 422 flow. Second operand 5 states and 91 transitions. [2024-06-27 18:33:14,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 578 flow [2024-06-27 18:33:14,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 537 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 18:33:14,895 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 409 flow [2024-06-27 18:33:14,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=409, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-06-27 18:33:14,896 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2024-06-27 18:33:14,896 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 409 flow [2024-06-27 18:33:14,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:14,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:14,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:14,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:33:14,897 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:14,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash -364326629, now seen corresponding path program 1 times [2024-06-27 18:33:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:14,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779312657] [2024-06-27 18:33:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:15,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:15,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779312657] [2024-06-27 18:33:15,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779312657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:15,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:15,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:33:15,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735658344] [2024-06-27 18:33:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:15,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:33:15,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:15,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:33:15,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:33:15,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:15,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 409 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-27 18:33:15,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:15,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:15,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:15,672 INFO L124 PetriNetUnfolderBase]: 593/1153 cut-off events. [2024-06-27 18:33:15,673 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2024-06-27 18:33:15,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3571 conditions, 1153 events. 593/1153 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6318 event pairs, 179 based on Foata normal form. 1/1112 useless extension candidates. Maximal degree in co-relation 3539. Up to 955 conditions per place. [2024-06-27 18:33:15,678 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 62 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2024-06-27 18:33:15,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 605 flow [2024-06-27 18:33:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:33:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:33:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 18:33:15,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46396396396396394 [2024-06-27 18:33:15,679 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 409 flow. Second operand 6 states and 103 transitions. [2024-06-27 18:33:15,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 605 flow [2024-06-27 18:33:15,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 81 transitions, 580 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 18:33:15,683 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 428 flow [2024-06-27 18:33:15,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=428, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-06-27 18:33:15,684 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2024-06-27 18:33:15,684 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 428 flow [2024-06-27 18:33:15,685 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-27 18:33:15,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:15,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:15,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:33:15,685 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:15,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash 559023824, now seen corresponding path program 1 times [2024-06-27 18:33:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:15,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434821822] [2024-06-27 18:33:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:16,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434821822] [2024-06-27 18:33:16,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434821822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:16,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:16,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:33:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492907390] [2024-06-27 18:33:16,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:16,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:33:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:33:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:33:16,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:33:16,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 428 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 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-27 18:33:16,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:16,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:33:16,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:16,385 INFO L124 PetriNetUnfolderBase]: 550/1078 cut-off events. [2024-06-27 18:33:16,385 INFO L125 PetriNetUnfolderBase]: For 2512/2512 co-relation queries the response was YES. [2024-06-27 18:33:16,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3555 conditions, 1078 events. 550/1078 cut-off events. For 2512/2512 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5864 event pairs, 128 based on Foata normal form. 2/1040 useless extension candidates. Maximal degree in co-relation 3523. Up to 816 conditions per place. [2024-06-27 18:33:16,392 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 63 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2024-06-27 18:33:16,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 670 flow [2024-06-27 18:33:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:33:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:33:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 18:33:16,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-06-27 18:33:16,396 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 428 flow. Second operand 6 states and 115 transitions. [2024-06-27 18:33:16,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 670 flow [2024-06-27 18:33:16,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 646 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 18:33:16,402 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 463 flow [2024-06-27 18:33:16,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2024-06-27 18:33:16,403 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2024-06-27 18:33:16,403 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 463 flow [2024-06-27 18:33:16,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 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-27 18:33:16,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:16,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:16,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:33:16,404 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:16,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:16,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1932270666, now seen corresponding path program 2 times [2024-06-27 18:33:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:16,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469840681] [2024-06-27 18:33:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:16,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:16,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469840681] [2024-06-27 18:33:16,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469840681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:16,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:16,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:33:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157928757] [2024-06-27 18:33:16,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:16,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:33:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:33:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:33:16,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:33:16,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 463 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 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-27 18:33:16,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:16,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:33:16,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:17,176 INFO L124 PetriNetUnfolderBase]: 554/1089 cut-off events. [2024-06-27 18:33:17,176 INFO L125 PetriNetUnfolderBase]: For 2874/2874 co-relation queries the response was YES. [2024-06-27 18:33:17,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 1089 events. 554/1089 cut-off events. For 2874/2874 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6020 event pairs, 172 based on Foata normal form. 1/1054 useless extension candidates. Maximal degree in co-relation 3608. Up to 893 conditions per place. [2024-06-27 18:33:17,181 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 62 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2024-06-27 18:33:17,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 641 flow [2024-06-27 18:33:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:33:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:33:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-27 18:33:17,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-27 18:33:17,183 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 463 flow. Second operand 6 states and 106 transitions. [2024-06-27 18:33:17,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 641 flow [2024-06-27 18:33:17,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 81 transitions, 622 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 18:33:17,189 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 469 flow [2024-06-27 18:33:17,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-06-27 18:33:17,191 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2024-06-27 18:33:17,191 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 469 flow [2024-06-27 18:33:17,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 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-27 18:33:17,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:17,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:17,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:33:17,192 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:17,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1590777511, now seen corresponding path program 1 times [2024-06-27 18:33:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:17,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736269658] [2024-06-27 18:33:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736269658] [2024-06-27 18:33:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736269658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:17,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:17,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:33:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644237932] [2024-06-27 18:33:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:17,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:33:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:33:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:33:17,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:17,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 469 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:17,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:17,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:17,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:18,301 INFO L124 PetriNetUnfolderBase]: 591/1124 cut-off events. [2024-06-27 18:33:18,301 INFO L125 PetriNetUnfolderBase]: For 3171/3171 co-relation queries the response was YES. [2024-06-27 18:33:18,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 1124 events. 591/1124 cut-off events. For 3171/3171 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6051 event pairs, 168 based on Foata normal form. 3/1091 useless extension candidates. Maximal degree in co-relation 3736. Up to 917 conditions per place. [2024-06-27 18:33:18,307 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 71 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2024-06-27 18:33:18,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 707 flow [2024-06-27 18:33:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:33:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:33:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-27 18:33:18,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671814671814672 [2024-06-27 18:33:18,309 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 469 flow. Second operand 7 states and 121 transitions. [2024-06-27 18:33:18,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 707 flow [2024-06-27 18:33:18,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 92 transitions, 665 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:18,313 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 476 flow [2024-06-27 18:33:18,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2024-06-27 18:33:18,314 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2024-06-27 18:33:18,314 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 476 flow [2024-06-27 18:33:18,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:18,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:18,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:18,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:33:18,315 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:18,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash -834559091, now seen corresponding path program 1 times [2024-06-27 18:33:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:18,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564460973] [2024-06-27 18:33:18,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:18,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-27 18:33:18,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:18,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564460973] [2024-06-27 18:33:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564460973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:18,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:18,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:33:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410461875] [2024-06-27 18:33:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:18,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:33:18,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:33:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:33:18,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:18,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 476 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:18,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:18,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:18,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:19,129 INFO L124 PetriNetUnfolderBase]: 619/1140 cut-off events. [2024-06-27 18:33:19,129 INFO L125 PetriNetUnfolderBase]: For 3316/3316 co-relation queries the response was YES. [2024-06-27 18:33:19,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 1140 events. 619/1140 cut-off events. For 3316/3316 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6058 event pairs, 140 based on Foata normal form. 2/1108 useless extension candidates. Maximal degree in co-relation 3939. Up to 861 conditions per place. [2024-06-27 18:33:19,136 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 76 selfloop transitions, 20 changer transitions 0/103 dead transitions. [2024-06-27 18:33:19,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 103 transitions, 803 flow [2024-06-27 18:33:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:33:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:33:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 18:33:19,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2024-06-27 18:33:19,137 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 476 flow. Second operand 7 states and 129 transitions. [2024-06-27 18:33:19,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 103 transitions, 803 flow [2024-06-27 18:33:19,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 103 transitions, 769 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 18:33:19,143 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 551 flow [2024-06-27 18:33:19,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2024-06-27 18:33:19,145 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2024-06-27 18:33:19,145 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 551 flow [2024-06-27 18:33:19,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:19,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:19,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:19,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:33:19,146 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:19,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1172699507, now seen corresponding path program 2 times [2024-06-27 18:33:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:19,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970151662] [2024-06-27 18:33:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:19,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970151662] [2024-06-27 18:33:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970151662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:33:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184355680] [2024-06-27 18:33:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:19,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:33:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:19,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:33:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:33:19,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:19,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 551 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:19,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:19,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:19,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:19,912 INFO L124 PetriNetUnfolderBase]: 630/1186 cut-off events. [2024-06-27 18:33:19,913 INFO L125 PetriNetUnfolderBase]: For 3938/3938 co-relation queries the response was YES. [2024-06-27 18:33:19,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4321 conditions, 1186 events. 630/1186 cut-off events. For 3938/3938 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6493 event pairs, 185 based on Foata normal form. 1/1151 useless extension candidates. Maximal degree in co-relation 4285. Up to 1012 conditions per place. [2024-06-27 18:33:19,926 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 76 selfloop transitions, 13 changer transitions 0/96 dead transitions. [2024-06-27 18:33:19,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 96 transitions, 785 flow [2024-06-27 18:33:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:33:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:33:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-27 18:33:19,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44787644787644787 [2024-06-27 18:33:19,928 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 551 flow. Second operand 7 states and 116 transitions. [2024-06-27 18:33:19,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 96 transitions, 785 flow [2024-06-27 18:33:19,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 96 transitions, 770 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 18:33:19,940 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 585 flow [2024-06-27 18:33:19,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=585, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2024-06-27 18:33:19,942 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2024-06-27 18:33:19,942 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 585 flow [2024-06-27 18:33:19,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:19,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:19,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:19,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:33:19,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:19,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:19,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2069187869, now seen corresponding path program 3 times [2024-06-27 18:33:19,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:19,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66175942] [2024-06-27 18:33:19,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:20,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:20,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66175942] [2024-06-27 18:33:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66175942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:33:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53195339] [2024-06-27 18:33:20,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:20,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:33:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:20,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:33:20,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:33:20,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:20,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 585 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:20,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:20,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:20,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:20,779 INFO L124 PetriNetUnfolderBase]: 628/1179 cut-off events. [2024-06-27 18:33:20,779 INFO L125 PetriNetUnfolderBase]: For 4507/4507 co-relation queries the response was YES. [2024-06-27 18:33:20,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4400 conditions, 1179 events. 628/1179 cut-off events. For 4507/4507 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6414 event pairs, 183 based on Foata normal form. 1/1145 useless extension candidates. Maximal degree in co-relation 4361. Up to 989 conditions per place. [2024-06-27 18:33:20,788 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 77 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-06-27 18:33:20,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 100 transitions, 841 flow [2024-06-27 18:33:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:33:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:33:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-27 18:33:20,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-27 18:33:20,792 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 585 flow. Second operand 7 states and 119 transitions. [2024-06-27 18:33:20,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 100 transitions, 841 flow [2024-06-27 18:33:20,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 100 transitions, 800 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 18:33:20,800 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 603 flow [2024-06-27 18:33:20,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=603, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2024-06-27 18:33:20,800 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2024-06-27 18:33:20,801 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 603 flow [2024-06-27 18:33:20,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:20,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:20,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:20,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:33:20,801 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:20,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 347202575, now seen corresponding path program 1 times [2024-06-27 18:33:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:20,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951143368] [2024-06-27 18:33:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:21,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951143368] [2024-06-27 18:33:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951143368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:21,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:33:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188051242] [2024-06-27 18:33:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:21,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:33:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:33:21,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:33:21,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:33:21,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 603 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:21,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:21,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:33:21,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:21,653 INFO L124 PetriNetUnfolderBase]: 585/1105 cut-off events. [2024-06-27 18:33:21,654 INFO L125 PetriNetUnfolderBase]: For 4981/4981 co-relation queries the response was YES. [2024-06-27 18:33:21,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4269 conditions, 1105 events. 585/1105 cut-off events. For 4981/4981 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5979 event pairs, 123 based on Foata normal form. 1/1075 useless extension candidates. Maximal degree in co-relation 4230. Up to 806 conditions per place. [2024-06-27 18:33:21,660 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 81 selfloop transitions, 20 changer transitions 0/115 dead transitions. [2024-06-27 18:33:21,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 115 transitions, 909 flow [2024-06-27 18:33:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 18:33:21,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 18:33:21,662 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 603 flow. Second operand 8 states and 152 transitions. [2024-06-27 18:33:21,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 115 transitions, 909 flow [2024-06-27 18:33:21,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 115 transitions, 866 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 18:33:21,670 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 620 flow [2024-06-27 18:33:21,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2024-06-27 18:33:21,670 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2024-06-27 18:33:21,671 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 620 flow [2024-06-27 18:33:21,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:21,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:21,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:21,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:33:21,671 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:21,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:21,672 INFO L85 PathProgramCache]: Analyzing trace with hash 351017807, now seen corresponding path program 1 times [2024-06-27 18:33:21,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:21,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536165186] [2024-06-27 18:33:21,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:22,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-27 18:33:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:22,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536165186] [2024-06-27 18:33:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536165186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:22,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:22,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78577599] [2024-06-27 18:33:22,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:22,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:22,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:22,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:22,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:22,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 620 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:22,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:22,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:22,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:22,492 INFO L124 PetriNetUnfolderBase]: 753/1366 cut-off events. [2024-06-27 18:33:22,493 INFO L125 PetriNetUnfolderBase]: For 6669/6669 co-relation queries the response was YES. [2024-06-27 18:33:22,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5340 conditions, 1366 events. 753/1366 cut-off events. For 6669/6669 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7451 event pairs, 171 based on Foata normal form. 6/1335 useless extension candidates. Maximal degree in co-relation 5300. Up to 861 conditions per place. [2024-06-27 18:33:22,500 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 93 selfloop transitions, 26 changer transitions 0/126 dead transitions. [2024-06-27 18:33:22,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 126 transitions, 1042 flow [2024-06-27 18:33:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 18:33:22,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 18:33:22,502 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 620 flow. Second operand 8 states and 152 transitions. [2024-06-27 18:33:22,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 126 transitions, 1042 flow [2024-06-27 18:33:22,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 126 transitions, 1000 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:22,513 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 706 flow [2024-06-27 18:33:22,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=706, PETRI_PLACES=91, PETRI_TRANSITIONS=91} [2024-06-27 18:33:22,513 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2024-06-27 18:33:22,513 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 706 flow [2024-06-27 18:33:22,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:22,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:22,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:22,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:33:22,514 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:22,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash 351017590, now seen corresponding path program 1 times [2024-06-27 18:33:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661783731] [2024-06-27 18:33:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:22,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661783731] [2024-06-27 18:33:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661783731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:22,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:22,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:33:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506159792] [2024-06-27 18:33:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:22,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:33:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:22,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:33:22,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:33:23,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:23,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 706 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:23,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:23,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:23,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:23,260 INFO L124 PetriNetUnfolderBase]: 777/1421 cut-off events. [2024-06-27 18:33:23,261 INFO L125 PetriNetUnfolderBase]: For 7861/7861 co-relation queries the response was YES. [2024-06-27 18:33:23,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5976 conditions, 1421 events. 777/1421 cut-off events. For 7861/7861 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7950 event pairs, 183 based on Foata normal form. 1/1378 useless extension candidates. Maximal degree in co-relation 5934. Up to 1086 conditions per place. [2024-06-27 18:33:23,268 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 88 selfloop transitions, 26 changer transitions 0/121 dead transitions. [2024-06-27 18:33:23,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 121 transitions, 1110 flow [2024-06-27 18:33:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:33:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:33:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 18:33:23,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2024-06-27 18:33:23,270 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 706 flow. Second operand 7 states and 129 transitions. [2024-06-27 18:33:23,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 121 transitions, 1110 flow [2024-06-27 18:33:23,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 121 transitions, 1083 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 18:33:23,281 INFO L231 Difference]: Finished difference. Result has 95 places, 95 transitions, 773 flow [2024-06-27 18:33:23,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=773, PETRI_PLACES=95, PETRI_TRANSITIONS=95} [2024-06-27 18:33:23,281 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2024-06-27 18:33:23,282 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 95 transitions, 773 flow [2024-06-27 18:33:23,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:23,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:23,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:23,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:33:23,282 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:23,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:23,283 INFO L85 PathProgramCache]: Analyzing trace with hash 351012010, now seen corresponding path program 2 times [2024-06-27 18:33:23,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:23,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587353251] [2024-06-27 18:33:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:23,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:23,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:23,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587353251] [2024-06-27 18:33:23,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587353251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:23,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:23,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:33:23,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393499096] [2024-06-27 18:33:23,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:23,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:33:23,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:23,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:33:23,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:33:23,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:23,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 773 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:23,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:23,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:23,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:24,043 INFO L124 PetriNetUnfolderBase]: 775/1424 cut-off events. [2024-06-27 18:33:24,043 INFO L125 PetriNetUnfolderBase]: For 8222/8222 co-relation queries the response was YES. [2024-06-27 18:33:24,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5991 conditions, 1424 events. 775/1424 cut-off events. For 8222/8222 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7977 event pairs, 168 based on Foata normal form. 1/1379 useless extension candidates. Maximal degree in co-relation 5946. Up to 1084 conditions per place. [2024-06-27 18:33:24,050 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 87 selfloop transitions, 29 changer transitions 0/123 dead transitions. [2024-06-27 18:33:24,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 123 transitions, 1123 flow [2024-06-27 18:33:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:33:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:33:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 18:33:24,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096525096525096 [2024-06-27 18:33:24,052 INFO L175 Difference]: Start difference. First operand has 95 places, 95 transitions, 773 flow. Second operand 7 states and 132 transitions. [2024-06-27 18:33:24,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 123 transitions, 1123 flow [2024-06-27 18:33:24,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 123 transitions, 1082 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 18:33:24,063 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 795 flow [2024-06-27 18:33:24,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=795, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2024-06-27 18:33:24,064 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2024-06-27 18:33:24,064 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 795 flow [2024-06-27 18:33:24,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:24,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:24,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:24,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 18:33:24,065 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:24,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1993945444, now seen corresponding path program 3 times [2024-06-27 18:33:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607605985] [2024-06-27 18:33:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:24,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:24,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-27 18:33:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607605985] [2024-06-27 18:33:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607605985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:33:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87086185] [2024-06-27 18:33:24,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:24,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:33:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:24,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:33:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:33:24,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:24,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 795 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:24,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:24,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:24,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:24,797 INFO L124 PetriNetUnfolderBase]: 773/1437 cut-off events. [2024-06-27 18:33:24,798 INFO L125 PetriNetUnfolderBase]: For 9034/9034 co-relation queries the response was YES. [2024-06-27 18:33:24,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6049 conditions, 1437 events. 773/1437 cut-off events. For 9034/9034 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8139 event pairs, 234 based on Foata normal form. 1/1395 useless extension candidates. Maximal degree in co-relation 6003. Up to 1223 conditions per place. [2024-06-27 18:33:24,806 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 93 selfloop transitions, 14 changer transitions 0/114 dead transitions. [2024-06-27 18:33:24,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 114 transitions, 1065 flow [2024-06-27 18:33:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:33:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:33:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-27 18:33:24,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555984555984556 [2024-06-27 18:33:24,838 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 795 flow. Second operand 7 states and 118 transitions. [2024-06-27 18:33:24,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 114 transitions, 1065 flow [2024-06-27 18:33:24,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 114 transitions, 989 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:24,850 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 752 flow [2024-06-27 18:33:24,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=752, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2024-06-27 18:33:24,851 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2024-06-27 18:33:24,851 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 752 flow [2024-06-27 18:33:24,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:24,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:24,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:24,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 18:33:24,852 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:24,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1170812457, now seen corresponding path program 2 times [2024-06-27 18:33:24,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:24,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909070221] [2024-06-27 18:33:24,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:25,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:25,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909070221] [2024-06-27 18:33:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909070221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:25,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:25,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:25,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71368809] [2024-06-27 18:33:25,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:25,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:25,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:25,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:25,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:25,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 752 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:25,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:25,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:25,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:25,682 INFO L124 PetriNetUnfolderBase]: 806/1503 cut-off events. [2024-06-27 18:33:25,682 INFO L125 PetriNetUnfolderBase]: For 9970/9970 co-relation queries the response was YES. [2024-06-27 18:33:25,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6213 conditions, 1503 events. 806/1503 cut-off events. For 9970/9970 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8615 event pairs, 227 based on Foata normal form. 3/1459 useless extension candidates. Maximal degree in co-relation 6166. Up to 1256 conditions per place. [2024-06-27 18:33:25,691 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 96 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2024-06-27 18:33:25,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 1052 flow [2024-06-27 18:33:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-27 18:33:25,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44932432432432434 [2024-06-27 18:33:25,692 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 752 flow. Second operand 8 states and 133 transitions. [2024-06-27 18:33:25,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 1052 flow [2024-06-27 18:33:25,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 119 transitions, 1001 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 18:33:25,706 INFO L231 Difference]: Finished difference. Result has 101 places, 97 transitions, 762 flow [2024-06-27 18:33:25,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=762, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2024-06-27 18:33:25,707 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2024-06-27 18:33:25,707 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 762 flow [2024-06-27 18:33:25,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:25,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:25,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:25,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:33:25,708 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:25,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash -271438999, now seen corresponding path program 3 times [2024-06-27 18:33:25,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:25,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188761509] [2024-06-27 18:33:25,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:25,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188761509] [2024-06-27 18:33:26,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188761509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:26,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:26,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:26,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63767946] [2024-06-27 18:33:26,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:26,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:26,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:26,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:26,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:26,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:26,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 762 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:26,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:26,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:26,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:26,570 INFO L124 PetriNetUnfolderBase]: 839/1563 cut-off events. [2024-06-27 18:33:26,570 INFO L125 PetriNetUnfolderBase]: For 11374/11374 co-relation queries the response was YES. [2024-06-27 18:33:26,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6573 conditions, 1563 events. 839/1563 cut-off events. For 11374/11374 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9034 event pairs, 227 based on Foata normal form. 3/1516 useless extension candidates. Maximal degree in co-relation 6525. Up to 1265 conditions per place. [2024-06-27 18:33:26,579 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 99 selfloop transitions, 19 changer transitions 0/125 dead transitions. [2024-06-27 18:33:26,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 125 transitions, 1096 flow [2024-06-27 18:33:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-27 18:33:26,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2024-06-27 18:33:26,581 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 762 flow. Second operand 8 states and 138 transitions. [2024-06-27 18:33:26,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 125 transitions, 1096 flow [2024-06-27 18:33:26,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 125 transitions, 1039 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:26,594 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 776 flow [2024-06-27 18:33:26,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=776, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2024-06-27 18:33:26,594 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2024-06-27 18:33:26,595 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 776 flow [2024-06-27 18:33:26,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:26,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:26,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:26,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 18:33:26,595 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:26,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 42363607, now seen corresponding path program 4 times [2024-06-27 18:33:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:26,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552553215] [2024-06-27 18:33:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:27,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:27,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552553215] [2024-06-27 18:33:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552553215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:27,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878924697] [2024-06-27 18:33:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:27,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:27,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:27,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:27,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:27,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 776 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:27,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:27,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:27,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:27,469 INFO L124 PetriNetUnfolderBase]: 833/1541 cut-off events. [2024-06-27 18:33:27,469 INFO L125 PetriNetUnfolderBase]: For 11462/11462 co-relation queries the response was YES. [2024-06-27 18:33:27,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 1541 events. 833/1541 cut-off events. For 11462/11462 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8843 event pairs, 221 based on Foata normal form. 3/1498 useless extension candidates. Maximal degree in co-relation 6451. Up to 1203 conditions per place. [2024-06-27 18:33:27,477 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 99 selfloop transitions, 23 changer transitions 0/129 dead transitions. [2024-06-27 18:33:27,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 129 transitions, 1134 flow [2024-06-27 18:33:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 18:33:27,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2024-06-27 18:33:27,479 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 776 flow. Second operand 8 states and 141 transitions. [2024-06-27 18:33:27,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 129 transitions, 1134 flow [2024-06-27 18:33:27,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 129 transitions, 1081 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:27,494 INFO L231 Difference]: Finished difference. Result has 105 places, 101 transitions, 806 flow [2024-06-27 18:33:27,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=806, PETRI_PLACES=105, PETRI_TRANSITIONS=101} [2024-06-27 18:33:27,495 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2024-06-27 18:33:27,495 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 101 transitions, 806 flow [2024-06-27 18:33:27,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:27,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:27,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:27,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 18:33:27,496 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:27,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2121681546, now seen corresponding path program 1 times [2024-06-27 18:33:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:27,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650896606] [2024-06-27 18:33:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:28,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:28,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650896606] [2024-06-27 18:33:28,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650896606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:28,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:28,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:28,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124634954] [2024-06-27 18:33:28,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:28,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:28,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:28,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:28,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:28,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:33:28,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 806 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:28,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:28,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:33:28,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:28,599 INFO L124 PetriNetUnfolderBase]: 795/1501 cut-off events. [2024-06-27 18:33:28,599 INFO L125 PetriNetUnfolderBase]: For 12081/12085 co-relation queries the response was YES. [2024-06-27 18:33:28,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 1501 events. 795/1501 cut-off events. For 12081/12085 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8690 event pairs, 113 based on Foata normal form. 6/1459 useless extension candidates. Maximal degree in co-relation 6313. Up to 1024 conditions per place. [2024-06-27 18:33:28,610 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 102 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2024-06-27 18:33:28,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 138 transitions, 1216 flow [2024-06-27 18:33:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-27 18:33:28,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168918918918919 [2024-06-27 18:33:28,611 INFO L175 Difference]: Start difference. First operand has 105 places, 101 transitions, 806 flow. Second operand 8 states and 153 transitions. [2024-06-27 18:33:28,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 138 transitions, 1216 flow [2024-06-27 18:33:28,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 138 transitions, 1151 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:28,632 INFO L231 Difference]: Finished difference. Result has 107 places, 103 transitions, 803 flow [2024-06-27 18:33:28,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=803, PETRI_PLACES=107, PETRI_TRANSITIONS=103} [2024-06-27 18:33:28,632 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2024-06-27 18:33:28,633 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 803 flow [2024-06-27 18:33:28,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:28,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:28,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:28,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 18:33:28,633 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:28,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1029361582, now seen corresponding path program 1 times [2024-06-27 18:33:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033047887] [2024-06-27 18:33:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:29,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033047887] [2024-06-27 18:33:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033047887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:29,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294479697] [2024-06-27 18:33:29,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:29,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:29,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:29,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:29,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:29,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 803 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:29,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:29,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:29,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:29,652 INFO L124 PetriNetUnfolderBase]: 867/1594 cut-off events. [2024-06-27 18:33:29,652 INFO L125 PetriNetUnfolderBase]: For 11666/11666 co-relation queries the response was YES. [2024-06-27 18:33:29,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6613 conditions, 1594 events. 867/1594 cut-off events. For 11666/11666 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9173 event pairs, 172 based on Foata normal form. 1/1543 useless extension candidates. Maximal degree in co-relation 6563. Up to 1141 conditions per place. [2024-06-27 18:33:29,662 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 109 selfloop transitions, 34 changer transitions 0/150 dead transitions. [2024-06-27 18:33:29,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 150 transitions, 1297 flow [2024-06-27 18:33:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:33:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:33:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 18:33:29,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-27 18:33:29,663 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 803 flow. Second operand 10 states and 182 transitions. [2024-06-27 18:33:29,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 150 transitions, 1297 flow [2024-06-27 18:33:29,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 150 transitions, 1268 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 18:33:29,686 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 876 flow [2024-06-27 18:33:29,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=876, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2024-06-27 18:33:29,686 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2024-06-27 18:33:29,687 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 876 flow [2024-06-27 18:33:29,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:29,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:29,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:29,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 18:33:29,687 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:29,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:29,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1029361458, now seen corresponding path program 2 times [2024-06-27 18:33:29,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:29,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312174758] [2024-06-27 18:33:29,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:29,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:30,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312174758] [2024-06-27 18:33:30,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312174758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:30,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:30,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454895312] [2024-06-27 18:33:30,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:30,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:30,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:30,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:30,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:30,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:33:30,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 876 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:30,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:30,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:33:30,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:30,750 INFO L124 PetriNetUnfolderBase]: 810/1517 cut-off events. [2024-06-27 18:33:30,750 INFO L125 PetriNetUnfolderBase]: For 12512/12516 co-relation queries the response was YES. [2024-06-27 18:33:30,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6509 conditions, 1517 events. 810/1517 cut-off events. For 12512/12516 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8781 event pairs, 156 based on Foata normal form. 6/1476 useless extension candidates. Maximal degree in co-relation 6457. Up to 1123 conditions per place. [2024-06-27 18:33:30,758 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 106 selfloop transitions, 21 changer transitions 0/145 dead transitions. [2024-06-27 18:33:30,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 145 transitions, 1252 flow [2024-06-27 18:33:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:33:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:33:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 18:33:30,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-27 18:33:30,759 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 876 flow. Second operand 9 states and 169 transitions. [2024-06-27 18:33:30,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 145 transitions, 1252 flow [2024-06-27 18:33:30,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 145 transitions, 1201 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:30,779 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 871 flow [2024-06-27 18:33:30,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=871, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2024-06-27 18:33:30,780 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2024-06-27 18:33:30,780 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 871 flow [2024-06-27 18:33:30,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:30,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:30,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:30,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 18:33:30,781 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:30,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2003533292, now seen corresponding path program 2 times [2024-06-27 18:33:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:30,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466889377] [2024-06-27 18:33:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:31,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:31,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466889377] [2024-06-27 18:33:31,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466889377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:31,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:31,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:31,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884642264] [2024-06-27 18:33:31,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:31,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:31,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:31,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:31,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:31,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:31,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 871 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:31,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:31,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:31,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:31,888 INFO L124 PetriNetUnfolderBase]: 875/1599 cut-off events. [2024-06-27 18:33:31,889 INFO L125 PetriNetUnfolderBase]: For 12734/12734 co-relation queries the response was YES. [2024-06-27 18:33:31,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6910 conditions, 1599 events. 875/1599 cut-off events. For 12734/12734 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9224 event pairs, 172 based on Foata normal form. 1/1550 useless extension candidates. Maximal degree in co-relation 6856. Up to 1182 conditions per place. [2024-06-27 18:33:31,897 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 107 selfloop transitions, 36 changer transitions 0/150 dead transitions. [2024-06-27 18:33:31,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 150 transitions, 1349 flow [2024-06-27 18:33:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:33:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:33:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 18:33:31,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-27 18:33:31,898 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 871 flow. Second operand 9 states and 169 transitions. [2024-06-27 18:33:31,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 150 transitions, 1349 flow [2024-06-27 18:33:31,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 150 transitions, 1302 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-27 18:33:31,919 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 916 flow [2024-06-27 18:33:31,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=916, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2024-06-27 18:33:31,920 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2024-06-27 18:33:31,920 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 916 flow [2024-06-27 18:33:31,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:31,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:31,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:31,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 18:33:31,921 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:31,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2003528456, now seen corresponding path program 1 times [2024-06-27 18:33:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990497561] [2024-06-27 18:33:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:32,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990497561] [2024-06-27 18:33:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990497561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:32,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700480482] [2024-06-27 18:33:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:32,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:32,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:32,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:32,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 916 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:32,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:32,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:32,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:32,785 INFO L124 PetriNetUnfolderBase]: 908/1660 cut-off events. [2024-06-27 18:33:32,785 INFO L125 PetriNetUnfolderBase]: For 14362/14362 co-relation queries the response was YES. [2024-06-27 18:33:32,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7223 conditions, 1660 events. 908/1660 cut-off events. For 14362/14362 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9639 event pairs, 184 based on Foata normal form. 3/1612 useless extension candidates. Maximal degree in co-relation 7168. Up to 977 conditions per place. [2024-06-27 18:33:32,794 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 104 selfloop transitions, 39 changer transitions 0/150 dead transitions. [2024-06-27 18:33:32,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 150 transitions, 1394 flow [2024-06-27 18:33:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-27 18:33:32,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304054054054054 [2024-06-27 18:33:32,815 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 916 flow. Second operand 8 states and 157 transitions. [2024-06-27 18:33:32,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 150 transitions, 1394 flow [2024-06-27 18:33:32,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 150 transitions, 1318 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 18:33:32,840 INFO L231 Difference]: Finished difference. Result has 118 places, 111 transitions, 943 flow [2024-06-27 18:33:32,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=943, PETRI_PLACES=118, PETRI_TRANSITIONS=111} [2024-06-27 18:33:32,840 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 77 predicate places. [2024-06-27 18:33:32,840 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 111 transitions, 943 flow [2024-06-27 18:33:32,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:32,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:32,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:32,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 18:33:32,841 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:32,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1147633588, now seen corresponding path program 2 times [2024-06-27 18:33:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374804989] [2024-06-27 18:33:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374804989] [2024-06-27 18:33:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374804989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:33,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:33,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:33,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082797114] [2024-06-27 18:33:33,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:33,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:33,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:33,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:33,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:33,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 111 transitions, 943 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:33,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:33,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:33,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:33,696 INFO L124 PetriNetUnfolderBase]: 980/1730 cut-off events. [2024-06-27 18:33:33,696 INFO L125 PetriNetUnfolderBase]: For 16969/16969 co-relation queries the response was YES. [2024-06-27 18:33:33,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7885 conditions, 1730 events. 980/1730 cut-off events. For 16969/16969 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9798 event pairs, 193 based on Foata normal form. 3/1693 useless extension candidates. Maximal degree in co-relation 7829. Up to 1029 conditions per place. [2024-06-27 18:33:33,708 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 106 selfloop transitions, 39 changer transitions 0/152 dead transitions. [2024-06-27 18:33:33,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 152 transitions, 1501 flow [2024-06-27 18:33:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 18:33:33,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2024-06-27 18:33:33,710 INFO L175 Difference]: Start difference. First operand has 118 places, 111 transitions, 943 flow. Second operand 8 states and 154 transitions. [2024-06-27 18:33:33,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 152 transitions, 1501 flow [2024-06-27 18:33:33,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 152 transitions, 1403 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:33,789 INFO L231 Difference]: Finished difference. Result has 120 places, 115 transitions, 977 flow [2024-06-27 18:33:33,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=977, PETRI_PLACES=120, PETRI_TRANSITIONS=115} [2024-06-27 18:33:33,790 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places. [2024-06-27 18:33:33,790 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 977 flow [2024-06-27 18:33:33,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:33,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:33,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:33,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 18:33:33,791 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:33,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1472417624, now seen corresponding path program 3 times [2024-06-27 18:33:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:33,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673558933] [2024-06-27 18:33:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:34,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:34,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673558933] [2024-06-27 18:33:34,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673558933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:34,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:34,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042161267] [2024-06-27 18:33:34,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:34,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:34,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:34,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:34,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:34,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 115 transitions, 977 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:34,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:34,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:34,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:34,788 INFO L124 PetriNetUnfolderBase]: 991/1820 cut-off events. [2024-06-27 18:33:34,789 INFO L125 PetriNetUnfolderBase]: For 17115/17115 co-relation queries the response was YES. [2024-06-27 18:33:34,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 1820 events. 991/1820 cut-off events. For 17115/17115 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10815 event pairs, 213 based on Foata normal form. 1/1758 useless extension candidates. Maximal degree in co-relation 7997. Up to 1413 conditions per place. [2024-06-27 18:33:34,799 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 111 selfloop transitions, 28 changer transitions 0/146 dead transitions. [2024-06-27 18:33:34,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 146 transitions, 1363 flow [2024-06-27 18:33:34,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 18:33:34,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2024-06-27 18:33:34,801 INFO L175 Difference]: Start difference. First operand has 120 places, 115 transitions, 977 flow. Second operand 8 states and 143 transitions. [2024-06-27 18:33:34,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 146 transitions, 1363 flow [2024-06-27 18:33:34,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 146 transitions, 1300 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 18:33:34,830 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 993 flow [2024-06-27 18:33:34,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=993, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2024-06-27 18:33:34,832 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2024-06-27 18:33:34,832 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 993 flow [2024-06-27 18:33:34,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:34,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:34,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:34,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 18:33:34,833 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:34,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2003355476, now seen corresponding path program 3 times [2024-06-27 18:33:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:34,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829076404] [2024-06-27 18:33:34,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:35,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829076404] [2024-06-27 18:33:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829076404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:35,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:35,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:35,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784822235] [2024-06-27 18:33:35,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:35,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:35,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:35,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:35,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:35,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:35,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 993 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:35,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:35,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:35,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:35,796 INFO L124 PetriNetUnfolderBase]: 985/1741 cut-off events. [2024-06-27 18:33:35,797 INFO L125 PetriNetUnfolderBase]: For 17541/17541 co-relation queries the response was YES. [2024-06-27 18:33:35,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7760 conditions, 1741 events. 985/1741 cut-off events. For 17541/17541 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9934 event pairs, 191 based on Foata normal form. 3/1703 useless extension candidates. Maximal degree in co-relation 7702. Up to 1042 conditions per place. [2024-06-27 18:33:35,808 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 110 selfloop transitions, 38 changer transitions 0/155 dead transitions. [2024-06-27 18:33:35,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 155 transitions, 1465 flow [2024-06-27 18:33:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 18:33:35,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-27 18:33:35,809 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 993 flow. Second operand 8 states and 156 transitions. [2024-06-27 18:33:35,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 155 transitions, 1465 flow [2024-06-27 18:33:35,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 155 transitions, 1400 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:35,840 INFO L231 Difference]: Finished difference. Result has 126 places, 117 transitions, 1009 flow [2024-06-27 18:33:35,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1009, PETRI_PLACES=126, PETRI_TRANSITIONS=117} [2024-06-27 18:33:35,841 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 85 predicate places. [2024-06-27 18:33:35,841 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 117 transitions, 1009 flow [2024-06-27 18:33:35,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:35,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:35,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:35,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 18:33:35,841 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:35,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1673591048, now seen corresponding path program 4 times [2024-06-27 18:33:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:35,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783587440] [2024-06-27 18:33:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:36,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783587440] [2024-06-27 18:33:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783587440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:36,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333433191] [2024-06-27 18:33:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:36,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:36,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:36,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:36,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 117 transitions, 1009 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:36,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:36,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:36,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:36,872 INFO L124 PetriNetUnfolderBase]: 1018/1889 cut-off events. [2024-06-27 18:33:36,872 INFO L125 PetriNetUnfolderBase]: For 19396/19396 co-relation queries the response was YES. [2024-06-27 18:33:36,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8252 conditions, 1889 events. 1018/1889 cut-off events. For 19396/19396 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11396 event pairs, 273 based on Foata normal form. 3/1832 useless extension candidates. Maximal degree in co-relation 8193. Up to 1544 conditions per place. [2024-06-27 18:33:36,882 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 121 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2024-06-27 18:33:36,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 145 transitions, 1385 flow [2024-06-27 18:33:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-27 18:33:36,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46283783783783783 [2024-06-27 18:33:36,883 INFO L175 Difference]: Start difference. First operand has 126 places, 117 transitions, 1009 flow. Second operand 8 states and 137 transitions. [2024-06-27 18:33:36,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 145 transitions, 1385 flow [2024-06-27 18:33:36,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 145 transitions, 1293 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 18:33:36,910 INFO L231 Difference]: Finished difference. Result has 127 places, 119 transitions, 986 flow [2024-06-27 18:33:36,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=986, PETRI_PLACES=127, PETRI_TRANSITIONS=119} [2024-06-27 18:33:36,911 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places. [2024-06-27 18:33:36,911 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 119 transitions, 986 flow [2024-06-27 18:33:36,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:36,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:36,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:36,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 18:33:36,912 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:36,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1673265300, now seen corresponding path program 1 times [2024-06-27 18:33:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:36,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556776343] [2024-06-27 18:33:36,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556776343] [2024-06-27 18:33:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556776343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:37,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:37,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070040941] [2024-06-27 18:33:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:37,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:37,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:37,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:37,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:37,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 986 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:37,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:37,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:37,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:38,156 INFO L124 PetriNetUnfolderBase]: 1020/1879 cut-off events. [2024-06-27 18:33:38,156 INFO L125 PetriNetUnfolderBase]: For 18456/18456 co-relation queries the response was YES. [2024-06-27 18:33:38,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8021 conditions, 1879 events. 1020/1879 cut-off events. For 18456/18456 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11237 event pairs, 254 based on Foata normal form. 2/1823 useless extension candidates. Maximal degree in co-relation 7961. Up to 1560 conditions per place. [2024-06-27 18:33:38,167 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 125 selfloop transitions, 22 changer transitions 0/154 dead transitions. [2024-06-27 18:33:38,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 154 transitions, 1398 flow [2024-06-27 18:33:38,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:33:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:33:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 18:33:38,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-27 18:33:38,171 INFO L175 Difference]: Start difference. First operand has 127 places, 119 transitions, 986 flow. Second operand 9 states and 153 transitions. [2024-06-27 18:33:38,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 154 transitions, 1398 flow [2024-06-27 18:33:38,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 154 transitions, 1355 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:38,206 INFO L231 Difference]: Finished difference. Result has 131 places, 123 transitions, 1042 flow [2024-06-27 18:33:38,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1042, PETRI_PLACES=131, PETRI_TRANSITIONS=123} [2024-06-27 18:33:38,207 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 90 predicate places. [2024-06-27 18:33:38,207 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 123 transitions, 1042 flow [2024-06-27 18:33:38,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:38,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:38,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:38,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 18:33:38,208 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:38,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash 175320018, now seen corresponding path program 5 times [2024-06-27 18:33:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042292461] [2024-06-27 18:33:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:38,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:38,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042292461] [2024-06-27 18:33:38,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042292461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:38,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:38,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:38,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464316557] [2024-06-27 18:33:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:38,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:38,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:38,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:38,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:38,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 123 transitions, 1042 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:38,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:38,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:38,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:39,336 INFO L124 PetriNetUnfolderBase]: 1053/1944 cut-off events. [2024-06-27 18:33:39,337 INFO L125 PetriNetUnfolderBase]: For 20261/20261 co-relation queries the response was YES. [2024-06-27 18:33:39,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8430 conditions, 1944 events. 1053/1944 cut-off events. For 20261/20261 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11757 event pairs, 260 based on Foata normal form. 3/1887 useless extension candidates. Maximal degree in co-relation 8368. Up to 1463 conditions per place. [2024-06-27 18:33:39,349 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 124 selfloop transitions, 25 changer transitions 0/156 dead transitions. [2024-06-27 18:33:39,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 156 transitions, 1528 flow [2024-06-27 18:33:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 18:33:39,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 18:33:39,351 INFO L175 Difference]: Start difference. First operand has 131 places, 123 transitions, 1042 flow. Second operand 8 states and 144 transitions. [2024-06-27 18:33:39,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 156 transitions, 1528 flow [2024-06-27 18:33:39,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 156 transitions, 1467 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:39,396 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 1062 flow [2024-06-27 18:33:39,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1062, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2024-06-27 18:33:39,397 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 92 predicate places. [2024-06-27 18:33:39,397 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 1062 flow [2024-06-27 18:33:39,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:39,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:39,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:39,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 18:33:39,398 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:39,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1682765684, now seen corresponding path program 4 times [2024-06-27 18:33:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383540538] [2024-06-27 18:33:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:40,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:40,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383540538] [2024-06-27 18:33:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383540538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127474463] [2024-06-27 18:33:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:40,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:40,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:40,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:40,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:40,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 125 transitions, 1062 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:40,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:40,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:40,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:40,508 INFO L124 PetriNetUnfolderBase]: 1051/1949 cut-off events. [2024-06-27 18:33:40,508 INFO L125 PetriNetUnfolderBase]: For 19783/19783 co-relation queries the response was YES. [2024-06-27 18:33:40,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8429 conditions, 1949 events. 1051/1949 cut-off events. For 19783/19783 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11828 event pairs, 300 based on Foata normal form. 1/1888 useless extension candidates. Maximal degree in co-relation 8366. Up to 1648 conditions per place. [2024-06-27 18:33:40,520 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 126 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2024-06-27 18:33:40,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 1420 flow [2024-06-27 18:33:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 18:33:40,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2024-06-27 18:33:40,522 INFO L175 Difference]: Start difference. First operand has 133 places, 125 transitions, 1062 flow. Second operand 8 states and 134 transitions. [2024-06-27 18:33:40,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 1420 flow [2024-06-27 18:33:40,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 149 transitions, 1317 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 18:33:40,561 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 996 flow [2024-06-27 18:33:40,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=996, PETRI_PLACES=134, PETRI_TRANSITIONS=125} [2024-06-27 18:33:40,561 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places. [2024-06-27 18:33:40,561 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 996 flow [2024-06-27 18:33:40,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:40,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:40,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:40,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 18:33:40,562 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:40,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1682758988, now seen corresponding path program 6 times [2024-06-27 18:33:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:40,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772977164] [2024-06-27 18:33:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772977164] [2024-06-27 18:33:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772977164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:41,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:41,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:33:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61060221] [2024-06-27 18:33:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:41,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:33:41,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:41,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:33:41,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:33:41,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:41,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 996 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:41,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:41,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:41,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:41,481 INFO L124 PetriNetUnfolderBase]: 1045/1936 cut-off events. [2024-06-27 18:33:41,481 INFO L125 PetriNetUnfolderBase]: For 19239/19239 co-relation queries the response was YES. [2024-06-27 18:33:41,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8022 conditions, 1936 events. 1045/1936 cut-off events. For 19239/19239 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11750 event pairs, 274 based on Foata normal form. 3/1878 useless extension candidates. Maximal degree in co-relation 7958. Up to 1456 conditions per place. [2024-06-27 18:33:41,544 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 124 selfloop transitions, 24 changer transitions 0/155 dead transitions. [2024-06-27 18:33:41,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 155 transitions, 1390 flow [2024-06-27 18:33:41,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:33:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:33:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 18:33:41,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 18:33:41,546 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 996 flow. Second operand 8 states and 144 transitions. [2024-06-27 18:33:41,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 155 transitions, 1390 flow [2024-06-27 18:33:41,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 155 transitions, 1337 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 18:33:41,585 INFO L231 Difference]: Finished difference. Result has 135 places, 125 transitions, 996 flow [2024-06-27 18:33:41,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=996, PETRI_PLACES=135, PETRI_TRANSITIONS=125} [2024-06-27 18:33:41,585 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places. [2024-06-27 18:33:41,585 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 996 flow [2024-06-27 18:33:41,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:41,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:41,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:41,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 18:33:41,586 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:41,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1673253427, now seen corresponding path program 1 times [2024-06-27 18:33:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451084126] [2024-06-27 18:33:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451084126] [2024-06-27 18:33:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451084126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:33:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200908557] [2024-06-27 18:33:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:33:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:33:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:33:42,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:42,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 996 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:42,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:42,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:42,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:42,821 INFO L124 PetriNetUnfolderBase]: 1042/1909 cut-off events. [2024-06-27 18:33:42,821 INFO L125 PetriNetUnfolderBase]: For 18577/18577 co-relation queries the response was YES. [2024-06-27 18:33:42,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7988 conditions, 1909 events. 1042/1909 cut-off events. For 18577/18577 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11454 event pairs, 271 based on Foata normal form. 2/1854 useless extension candidates. Maximal degree in co-relation 7923. Up to 1600 conditions per place. [2024-06-27 18:33:42,865 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 128 selfloop transitions, 21 changer transitions 0/156 dead transitions. [2024-06-27 18:33:42,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 156 transitions, 1374 flow [2024-06-27 18:33:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:33:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:33:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 18:33:42,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-06-27 18:33:42,867 INFO L175 Difference]: Start difference. First operand has 135 places, 125 transitions, 996 flow. Second operand 9 states and 151 transitions. [2024-06-27 18:33:42,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 156 transitions, 1374 flow [2024-06-27 18:33:42,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 156 transitions, 1314 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 18:33:42,905 INFO L231 Difference]: Finished difference. Result has 137 places, 125 transitions, 982 flow [2024-06-27 18:33:42,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=982, PETRI_PLACES=137, PETRI_TRANSITIONS=125} [2024-06-27 18:33:42,906 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 96 predicate places. [2024-06-27 18:33:42,906 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 125 transitions, 982 flow [2024-06-27 18:33:42,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:42,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:42,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:42,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 18:33:42,906 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:42,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash -862908327, now seen corresponding path program 1 times [2024-06-27 18:33:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177667752] [2024-06-27 18:33:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:42,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:42,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177667752] [2024-06-27 18:33:42,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177667752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:42,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:42,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:33:42,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703953554] [2024-06-27 18:33:42,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:42,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:33:42,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:42,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:33:42,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:33:43,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-06-27 18:33:43,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 125 transitions, 982 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-27 18:33:43,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:43,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-06-27 18:33:43,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:43,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][101], [Black: 127#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 387#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 399#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#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))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 67#true, Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 157#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 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) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 411#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 293#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 150#true, 10#L775true, Black: 169#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 307#(and (= (* 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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 436#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$w_buff1_used~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~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$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1)), 12#L762true, Black: 428#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 184#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (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) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 299#true, Black: 319#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 449#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 197#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 335#(and (= (* 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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 463#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 505#true, Black: 213#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~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) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), 483#true, Black: 95#(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) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 349#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 223#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 477#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 59#true, Black: 234#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 311#true, 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))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 203#true, 5#L832true, Black: 117#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 493#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-27 18:33:43,373 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 18:33:43,373 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:33:43,373 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:33:43,373 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:33:43,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][101], [Black: 127#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 387#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 399#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#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))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 67#true, Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 157#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 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) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 411#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 293#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 150#true, 10#L775true, Black: 169#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 307#(and (= (* 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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 436#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$w_buff1_used~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~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$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1)), Black: 428#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L762true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 184#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (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) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 299#true, Black: 319#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 449#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 197#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 335#(and (= (* 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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 463#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 505#true, Black: 213#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~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) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), 483#true, Black: 95#(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) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 349#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 223#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 477#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 59#true, 29#L18-1true, Black: 234#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 311#true, 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))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 203#true, Black: 363#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 117#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 493#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-27 18:33:43,428 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-06-27 18:33:43,429 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 18:33:43,429 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 18:33:43,429 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 18:33:43,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][261], [Black: 127#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 387#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 399#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#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))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 67#true, Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 157#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 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) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 411#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 6#L18-5true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 150#true, 10#L775true, Black: 169#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 307#(and (= (* 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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 436#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$w_buff1_used~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~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$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1)), Black: 428#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 509#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), 12#L762true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 184#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (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) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 299#true, Black: 319#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 449#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 197#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 335#(and (= (* 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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 463#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 83#(and (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~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) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), 483#true, Black: 95#(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) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 349#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 223#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 477#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 59#true, Black: 234#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 311#true, 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))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 203#true, Black: 117#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 493#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-27 18:33:43,433 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:33:43,433 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:33:43,433 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:33:43,433 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:33:43,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][101], [Black: 127#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 387#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 399#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= |#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))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 67#true, Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 157#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 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) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 411#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 293#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 150#true, 10#L775true, Black: 169#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 307#(and (= (* 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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 436#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$w_buff1_used~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~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$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1)), Black: 428#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 12#L762true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 184#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (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) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 299#true, Black: 319#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 449#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 197#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 335#(and (= (* 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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 463#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 505#true, Black: 213#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~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) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0)), 483#true, Black: 95#(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) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 349#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 223#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 477#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 59#true, Black: 234#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 311#true, 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))) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 203#true, 17#L18-2true, Black: 117#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 493#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(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) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-27 18:33:43,476 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:33:43,476 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:33:43,476 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:33:43,476 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:33:43,523 INFO L124 PetriNetUnfolderBase]: 1890/3380 cut-off events. [2024-06-27 18:33:43,523 INFO L125 PetriNetUnfolderBase]: For 23196/23271 co-relation queries the response was YES. [2024-06-27 18:33:43,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13069 conditions, 3380 events. 1890/3380 cut-off events. For 23196/23271 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 22268 event pairs, 346 based on Foata normal form. 52/3277 useless extension candidates. Maximal degree in co-relation 13004. Up to 1207 conditions per place. [2024-06-27 18:33:43,544 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 124 selfloop transitions, 69 changer transitions 94/329 dead transitions. [2024-06-27 18:33:43,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 329 transitions, 2997 flow [2024-06-27 18:33:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:33:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:33:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-06-27 18:33:43,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2024-06-27 18:33:43,545 INFO L175 Difference]: Start difference. First operand has 137 places, 125 transitions, 982 flow. Second operand 9 states and 207 transitions. [2024-06-27 18:33:43,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 329 transitions, 2997 flow [2024-06-27 18:33:43,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 329 transitions, 2866 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-27 18:33:43,622 INFO L231 Difference]: Finished difference. Result has 144 places, 167 transitions, 1555 flow [2024-06-27 18:33:43,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1555, PETRI_PLACES=144, PETRI_TRANSITIONS=167} [2024-06-27 18:33:43,622 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 103 predicate places. [2024-06-27 18:33:43,622 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 167 transitions, 1555 flow [2024-06-27 18:33:43,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-27 18:33:43,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:43,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:43,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 18:33:43,623 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:43,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:43,623 INFO L85 PathProgramCache]: Analyzing trace with hash -72562901, now seen corresponding path program 1 times [2024-06-27 18:33:43,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:43,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911034077] [2024-06-27 18:33:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:44,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:44,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911034077] [2024-06-27 18:33:44,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911034077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:44,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:44,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:44,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368072515] [2024-06-27 18:33:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:44,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:44,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:44,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:44,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:44,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 167 transitions, 1555 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:44,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:44,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:44,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:45,099 INFO L124 PetriNetUnfolderBase]: 1986/3773 cut-off events. [2024-06-27 18:33:45,099 INFO L125 PetriNetUnfolderBase]: For 44095/44147 co-relation queries the response was YES. [2024-06-27 18:33:45,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18159 conditions, 3773 events. 1986/3773 cut-off events. For 44095/44147 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 26368 event pairs, 530 based on Foata normal form. 46/3792 useless extension candidates. Maximal degree in co-relation 18088. Up to 2628 conditions per place. [2024-06-27 18:33:45,126 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 216 selfloop transitions, 58 changer transitions 17/300 dead transitions. [2024-06-27 18:33:45,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 300 transitions, 3256 flow [2024-06-27 18:33:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:33:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:33:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-27 18:33:45,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-06-27 18:33:45,127 INFO L175 Difference]: Start difference. First operand has 144 places, 167 transitions, 1555 flow. Second operand 10 states and 184 transitions. [2024-06-27 18:33:45,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 300 transitions, 3256 flow [2024-06-27 18:33:45,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 300 transitions, 3214 flow, removed 21 selfloop flow, removed 0 redundant places. [2024-06-27 18:33:45,248 INFO L231 Difference]: Finished difference. Result has 159 places, 206 transitions, 2108 flow [2024-06-27 18:33:45,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2108, PETRI_PLACES=159, PETRI_TRANSITIONS=206} [2024-06-27 18:33:45,248 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 118 predicate places. [2024-06-27 18:33:45,248 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 206 transitions, 2108 flow [2024-06-27 18:33:45,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:45,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:45,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:45,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 18:33:45,249 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:45,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1347617395, now seen corresponding path program 2 times [2024-06-27 18:33:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:45,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771103406] [2024-06-27 18:33:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:45,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:45,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771103406] [2024-06-27 18:33:45,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771103406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:45,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:45,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:45,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749486398] [2024-06-27 18:33:45,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:45,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:45,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:45,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:45,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:45,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:45,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 206 transitions, 2108 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:45,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:45,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:45,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:46,592 INFO L124 PetriNetUnfolderBase]: 1849/3463 cut-off events. [2024-06-27 18:33:46,592 INFO L125 PetriNetUnfolderBase]: For 47382/47458 co-relation queries the response was YES. [2024-06-27 18:33:46,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18039 conditions, 3463 events. 1849/3463 cut-off events. For 47382/47458 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 23423 event pairs, 423 based on Foata normal form. 74/3506 useless extension candidates. Maximal degree in co-relation 17959. Up to 2047 conditions per place. [2024-06-27 18:33:46,620 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 152 selfloop transitions, 89 changer transitions 0/250 dead transitions. [2024-06-27 18:33:46,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 250 transitions, 2895 flow [2024-06-27 18:33:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:33:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:33:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 18:33:46,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2024-06-27 18:33:46,621 INFO L175 Difference]: Start difference. First operand has 159 places, 206 transitions, 2108 flow. Second operand 9 states and 166 transitions. [2024-06-27 18:33:46,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 250 transitions, 2895 flow [2024-06-27 18:33:46,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 250 transitions, 2812 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-27 18:33:46,773 INFO L231 Difference]: Finished difference. Result has 163 places, 210 transitions, 2296 flow [2024-06-27 18:33:46,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2026, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2296, PETRI_PLACES=163, PETRI_TRANSITIONS=210} [2024-06-27 18:33:46,774 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 122 predicate places. [2024-06-27 18:33:46,774 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 210 transitions, 2296 flow [2024-06-27 18:33:46,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:46,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:46,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:46,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 18:33:46,775 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:46,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1845435217, now seen corresponding path program 3 times [2024-06-27 18:33:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716356754] [2024-06-27 18:33:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:47,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716356754] [2024-06-27 18:33:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716356754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547930299] [2024-06-27 18:33:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:47,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:47,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:47,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:47,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:47,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 210 transitions, 2296 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:47,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:47,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:47,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:48,116 INFO L124 PetriNetUnfolderBase]: 1891/3532 cut-off events. [2024-06-27 18:33:48,116 INFO L125 PetriNetUnfolderBase]: For 51806/51919 co-relation queries the response was YES. [2024-06-27 18:33:48,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18668 conditions, 3532 events. 1891/3532 cut-off events. For 51806/51919 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 23981 event pairs, 465 based on Foata normal form. 85/3573 useless extension candidates. Maximal degree in co-relation 18587. Up to 2405 conditions per place. [2024-06-27 18:33:48,143 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 157 selfloop transitions, 92 changer transitions 0/258 dead transitions. [2024-06-27 18:33:48,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 258 transitions, 3114 flow [2024-06-27 18:33:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:33:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:33:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-27 18:33:48,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-06-27 18:33:48,144 INFO L175 Difference]: Start difference. First operand has 163 places, 210 transitions, 2296 flow. Second operand 10 states and 184 transitions. [2024-06-27 18:33:48,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 258 transitions, 3114 flow [2024-06-27 18:33:48,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 258 transitions, 2975 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-27 18:33:48,312 INFO L231 Difference]: Finished difference. Result has 167 places, 212 transitions, 2387 flow [2024-06-27 18:33:48,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2387, PETRI_PLACES=167, PETRI_TRANSITIONS=212} [2024-06-27 18:33:48,312 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places. [2024-06-27 18:33:48,312 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 212 transitions, 2387 flow [2024-06-27 18:33:48,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:48,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:48,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:48,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 18:33:48,313 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:48,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1345739570, now seen corresponding path program 1 times [2024-06-27 18:33:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:48,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640161432] [2024-06-27 18:33:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:48,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:48,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:48,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640161432] [2024-06-27 18:33:48,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640161432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:48,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:48,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:48,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669190365] [2024-06-27 18:33:48,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:48,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:49,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:49,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 212 transitions, 2387 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:49,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:49,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:49,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:49,821 INFO L124 PetriNetUnfolderBase]: 1994/3676 cut-off events. [2024-06-27 18:33:49,821 INFO L125 PetriNetUnfolderBase]: For 53410/53531 co-relation queries the response was YES. [2024-06-27 18:33:49,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19667 conditions, 3676 events. 1994/3676 cut-off events. For 53410/53531 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 24800 event pairs, 423 based on Foata normal form. 110/3733 useless extension candidates. Maximal degree in co-relation 19585. Up to 1846 conditions per place. [2024-06-27 18:33:49,850 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 190 selfloop transitions, 85 changer transitions 0/284 dead transitions. [2024-06-27 18:33:49,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 284 transitions, 3397 flow [2024-06-27 18:33:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:33:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:33:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 226 transitions. [2024-06-27 18:33:49,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509009009009009 [2024-06-27 18:33:49,852 INFO L175 Difference]: Start difference. First operand has 167 places, 212 transitions, 2387 flow. Second operand 12 states and 226 transitions. [2024-06-27 18:33:49,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 284 transitions, 3397 flow [2024-06-27 18:33:50,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 284 transitions, 3211 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-27 18:33:50,046 INFO L231 Difference]: Finished difference. Result has 173 places, 220 transitions, 2495 flow [2024-06-27 18:33:50,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2495, PETRI_PLACES=173, PETRI_TRANSITIONS=220} [2024-06-27 18:33:50,046 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 132 predicate places. [2024-06-27 18:33:50,046 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 220 transitions, 2495 flow [2024-06-27 18:33:50,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:50,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:50,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:50,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 18:33:50,047 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:50,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1845438937, now seen corresponding path program 4 times [2024-06-27 18:33:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159930536] [2024-06-27 18:33:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159930536] [2024-06-27 18:33:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159930536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:50,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:50,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477025758] [2024-06-27 18:33:50,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:50,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:50,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:50,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:50,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:50,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 220 transitions, 2495 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:50,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:50,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:50,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:51,485 INFO L124 PetriNetUnfolderBase]: 1984/3705 cut-off events. [2024-06-27 18:33:51,486 INFO L125 PetriNetUnfolderBase]: For 54905/55012 co-relation queries the response was YES. [2024-06-27 18:33:51,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20366 conditions, 3705 events. 1984/3705 cut-off events. For 54905/55012 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 25320 event pairs, 495 based on Foata normal form. 97/3758 useless extension candidates. Maximal degree in co-relation 20282. Up to 2654 conditions per place. [2024-06-27 18:33:51,514 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 171 selfloop transitions, 91 changer transitions 0/271 dead transitions. [2024-06-27 18:33:51,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 271 transitions, 3259 flow [2024-06-27 18:33:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:33:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:33:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-06-27 18:33:51,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48402948402948404 [2024-06-27 18:33:51,516 INFO L175 Difference]: Start difference. First operand has 173 places, 220 transitions, 2495 flow. Second operand 11 states and 197 transitions. [2024-06-27 18:33:51,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 271 transitions, 3259 flow [2024-06-27 18:33:51,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 271 transitions, 3139 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-27 18:33:51,710 INFO L231 Difference]: Finished difference. Result has 176 places, 220 transitions, 2563 flow [2024-06-27 18:33:51,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2563, PETRI_PLACES=176, PETRI_TRANSITIONS=220} [2024-06-27 18:33:51,711 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 135 predicate places. [2024-06-27 18:33:51,711 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 220 transitions, 2563 flow [2024-06-27 18:33:51,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:51,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:51,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:51,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 18:33:51,712 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:51,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:51,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1979992661, now seen corresponding path program 5 times [2024-06-27 18:33:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:51,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062219447] [2024-06-27 18:33:51,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:52,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:52,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062219447] [2024-06-27 18:33:52,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062219447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:52,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611870469] [2024-06-27 18:33:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:52,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:52,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:52,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:52,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:52,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 220 transitions, 2563 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:52,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:52,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:52,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:53,060 INFO L124 PetriNetUnfolderBase]: 2020/3722 cut-off events. [2024-06-27 18:33:53,061 INFO L125 PetriNetUnfolderBase]: For 55880/55966 co-relation queries the response was YES. [2024-06-27 18:33:53,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20864 conditions, 3722 events. 2020/3722 cut-off events. For 55880/55966 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 25165 event pairs, 417 based on Foata normal form. 76/3745 useless extension candidates. Maximal degree in co-relation 20778. Up to 2578 conditions per place. [2024-06-27 18:33:53,093 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 162 selfloop transitions, 97 changer transitions 0/268 dead transitions. [2024-06-27 18:33:53,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 268 transitions, 3398 flow [2024-06-27 18:33:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:33:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:33:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-27 18:33:53,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 18:33:53,095 INFO L175 Difference]: Start difference. First operand has 176 places, 220 transitions, 2563 flow. Second operand 9 states and 171 transitions. [2024-06-27 18:33:53,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 268 transitions, 3398 flow [2024-06-27 18:33:53,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 268 transitions, 3213 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 18:33:53,290 INFO L231 Difference]: Finished difference. Result has 175 places, 224 transitions, 2625 flow [2024-06-27 18:33:53,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2625, PETRI_PLACES=175, PETRI_TRANSITIONS=224} [2024-06-27 18:33:53,291 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places. [2024-06-27 18:33:53,291 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 224 transitions, 2625 flow [2024-06-27 18:33:53,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:53,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:53,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:53,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 18:33:53,291 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:53,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1979988786, now seen corresponding path program 2 times [2024-06-27 18:33:53,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:53,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245857780] [2024-06-27 18:33:53,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:53,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:54,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-27 18:33:54,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:54,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245857780] [2024-06-27 18:33:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245857780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:54,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:54,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955285035] [2024-06-27 18:33:54,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:54,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:54,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:54,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:54,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:54,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:54,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 224 transitions, 2625 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:54,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:54,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:54,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:54,947 INFO L124 PetriNetUnfolderBase]: 2064/3744 cut-off events. [2024-06-27 18:33:54,947 INFO L125 PetriNetUnfolderBase]: For 57493/57607 co-relation queries the response was YES. [2024-06-27 18:33:54,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21273 conditions, 3744 events. 2064/3744 cut-off events. For 57493/57607 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24980 event pairs, 386 based on Foata normal form. 106/3784 useless extension candidates. Maximal degree in co-relation 21186. Up to 2055 conditions per place. [2024-06-27 18:33:54,979 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 186 selfloop transitions, 96 changer transitions 0/291 dead transitions. [2024-06-27 18:33:54,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 291 transitions, 3636 flow [2024-06-27 18:33:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:33:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:33:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2024-06-27 18:33:54,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282555282555282 [2024-06-27 18:33:54,981 INFO L175 Difference]: Start difference. First operand has 175 places, 224 transitions, 2625 flow. Second operand 11 states and 215 transitions. [2024-06-27 18:33:54,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 291 transitions, 3636 flow [2024-06-27 18:33:55,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 291 transitions, 3432 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 18:33:55,212 INFO L231 Difference]: Finished difference. Result has 179 places, 227 transitions, 2658 flow [2024-06-27 18:33:55,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2421, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2658, PETRI_PLACES=179, PETRI_TRANSITIONS=227} [2024-06-27 18:33:55,213 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 138 predicate places. [2024-06-27 18:33:55,213 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 227 transitions, 2658 flow [2024-06-27 18:33:55,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:55,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:55,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:55,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 18:33:55,214 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:55,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1211189721, now seen corresponding path program 6 times [2024-06-27 18:33:55,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:55,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200301572] [2024-06-27 18:33:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:55,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-27 18:33:55,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200301572] [2024-06-27 18:33:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200301572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:55,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:55,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127786541] [2024-06-27 18:33:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:55,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:55,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:55,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:55,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:55,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 227 transitions, 2658 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:55,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:55,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:55,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:56,756 INFO L124 PetriNetUnfolderBase]: 2095/3892 cut-off events. [2024-06-27 18:33:56,757 INFO L125 PetriNetUnfolderBase]: For 61111/61208 co-relation queries the response was YES. [2024-06-27 18:33:56,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22090 conditions, 3892 events. 2095/3892 cut-off events. For 61111/61208 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 26762 event pairs, 511 based on Foata normal form. 90/3929 useless extension candidates. Maximal degree in co-relation 22002. Up to 2901 conditions per place. [2024-06-27 18:33:56,788 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 179 selfloop transitions, 92 changer transitions 0/280 dead transitions. [2024-06-27 18:33:56,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 280 transitions, 3472 flow [2024-06-27 18:33:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:33:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:33:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-27 18:33:56,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-06-27 18:33:56,790 INFO L175 Difference]: Start difference. First operand has 179 places, 227 transitions, 2658 flow. Second operand 10 states and 184 transitions. [2024-06-27 18:33:56,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 280 transitions, 3472 flow [2024-06-27 18:33:57,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 280 transitions, 3268 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-27 18:33:57,028 INFO L231 Difference]: Finished difference. Result has 180 places, 231 transitions, 2700 flow [2024-06-27 18:33:57,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2454, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2700, PETRI_PLACES=180, PETRI_TRANSITIONS=231} [2024-06-27 18:33:57,028 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 139 predicate places. [2024-06-27 18:33:57,028 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 231 transitions, 2700 flow [2024-06-27 18:33:57,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:57,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:57,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:57,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 18:33:57,029 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:57,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1974482411, now seen corresponding path program 7 times [2024-06-27 18:33:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:57,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561821516] [2024-06-27 18:33:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:57,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:57,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561821516] [2024-06-27 18:33:57,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561821516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:57,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:57,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:57,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501150122] [2024-06-27 18:33:57,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:57,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:57,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:57,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:57,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:57,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:57,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 231 transitions, 2700 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:57,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:57,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:57,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:33:58,399 INFO L124 PetriNetUnfolderBase]: 2123/3990 cut-off events. [2024-06-27 18:33:58,400 INFO L125 PetriNetUnfolderBase]: For 62249/62381 co-relation queries the response was YES. [2024-06-27 18:33:58,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22115 conditions, 3990 events. 2123/3990 cut-off events. For 62249/62381 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 27921 event pairs, 555 based on Foata normal form. 122/4074 useless extension candidates. Maximal degree in co-relation 22026. Up to 3058 conditions per place. [2024-06-27 18:33:58,431 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 195 selfloop transitions, 69 changer transitions 0/273 dead transitions. [2024-06-27 18:33:58,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 273 transitions, 3460 flow [2024-06-27 18:33:58,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:33:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:33:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 18:33:58,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-27 18:33:58,433 INFO L175 Difference]: Start difference. First operand has 180 places, 231 transitions, 2700 flow. Second operand 9 states and 159 transitions. [2024-06-27 18:33:58,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 273 transitions, 3460 flow [2024-06-27 18:33:58,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 273 transitions, 3274 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 18:33:58,670 INFO L231 Difference]: Finished difference. Result has 181 places, 235 transitions, 2722 flow [2024-06-27 18:33:58,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2722, PETRI_PLACES=181, PETRI_TRANSITIONS=235} [2024-06-27 18:33:58,671 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places. [2024-06-27 18:33:58,671 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 235 transitions, 2722 flow [2024-06-27 18:33:58,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:58,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:33:58,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:33:58,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 18:33:58,672 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:33:58,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:33:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1974274866, now seen corresponding path program 3 times [2024-06-27 18:33:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:33:58,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562692072] [2024-06-27 18:33:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:33:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:33:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:33:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:33:59,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:33:59,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562692072] [2024-06-27 18:33:59,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562692072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:33:59,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:33:59,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:33:59,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252837775] [2024-06-27 18:33:59,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:33:59,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:33:59,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:33:59,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:33:59,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:33:59,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:33:59,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 235 transitions, 2722 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:33:59,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:33:59,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:33:59,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:00,040 INFO L124 PetriNetUnfolderBase]: 2182/4115 cut-off events. [2024-06-27 18:34:00,041 INFO L125 PetriNetUnfolderBase]: For 65323/65418 co-relation queries the response was YES. [2024-06-27 18:34:00,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22568 conditions, 4115 events. 2182/4115 cut-off events. For 65323/65418 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 29114 event pairs, 488 based on Foata normal form. 88/4159 useless extension candidates. Maximal degree in co-relation 22478. Up to 2570 conditions per place. [2024-06-27 18:34:00,074 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 202 selfloop transitions, 73 changer transitions 0/284 dead transitions. [2024-06-27 18:34:00,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 284 transitions, 3551 flow [2024-06-27 18:34:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:34:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:34:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 18:34:00,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105105105105106 [2024-06-27 18:34:00,076 INFO L175 Difference]: Start difference. First operand has 181 places, 235 transitions, 2722 flow. Second operand 9 states and 170 transitions. [2024-06-27 18:34:00,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 284 transitions, 3551 flow [2024-06-27 18:34:00,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 284 transitions, 3409 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 18:34:00,334 INFO L231 Difference]: Finished difference. Result has 183 places, 239 transitions, 2779 flow [2024-06-27 18:34:00,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2779, PETRI_PLACES=183, PETRI_TRANSITIONS=239} [2024-06-27 18:34:00,335 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 142 predicate places. [2024-06-27 18:34:00,335 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 239 transitions, 2779 flow [2024-06-27 18:34:00,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:00,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:00,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:00,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 18:34:00,336 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:00,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:00,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1974476676, now seen corresponding path program 4 times [2024-06-27 18:34:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:00,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557040613] [2024-06-27 18:34:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:00,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:00,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557040613] [2024-06-27 18:34:00,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557040613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:00,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:00,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:34:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685004799] [2024-06-27 18:34:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:00,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:34:00,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:00,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:34:00,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:34:00,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:00,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 239 transitions, 2779 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:00,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:00,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:00,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:01,685 INFO L124 PetriNetUnfolderBase]: 2217/4177 cut-off events. [2024-06-27 18:34:01,685 INFO L125 PetriNetUnfolderBase]: For 66587/66688 co-relation queries the response was YES. [2024-06-27 18:34:01,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23286 conditions, 4177 events. 2217/4177 cut-off events. For 66587/66688 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 29634 event pairs, 503 based on Foata normal form. 92/4225 useless extension candidates. Maximal degree in co-relation 23195. Up to 2655 conditions per place. [2024-06-27 18:34:01,719 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 216 selfloop transitions, 66 changer transitions 0/291 dead transitions. [2024-06-27 18:34:01,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 291 transitions, 3654 flow [2024-06-27 18:34:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:34:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:34:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-27 18:34:01,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195195195195195 [2024-06-27 18:34:01,720 INFO L175 Difference]: Start difference. First operand has 183 places, 239 transitions, 2779 flow. Second operand 9 states and 173 transitions. [2024-06-27 18:34:01,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 291 transitions, 3654 flow [2024-06-27 18:34:01,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 291 transitions, 3503 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 18:34:01,957 INFO L231 Difference]: Finished difference. Result has 185 places, 242 transitions, 2811 flow [2024-06-27 18:34:01,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2628, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2811, PETRI_PLACES=185, PETRI_TRANSITIONS=242} [2024-06-27 18:34:01,958 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2024-06-27 18:34:01,958 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 242 transitions, 2811 flow [2024-06-27 18:34:01,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:01,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:01,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:01,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 18:34:01,959 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:01,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1974482256, now seen corresponding path program 5 times [2024-06-27 18:34:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:01,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698416564] [2024-06-27 18:34:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:01,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:02,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:02,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698416564] [2024-06-27 18:34:02,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698416564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:02,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:02,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:34:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024033377] [2024-06-27 18:34:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:02,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:34:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:34:02,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:34:02,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:02,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 242 transitions, 2811 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:02,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:02,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:02,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:03,379 INFO L124 PetriNetUnfolderBase]: 2230/4179 cut-off events. [2024-06-27 18:34:03,381 INFO L125 PetriNetUnfolderBase]: For 67209/67322 co-relation queries the response was YES. [2024-06-27 18:34:03,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23425 conditions, 4179 events. 2230/4179 cut-off events. For 67209/67322 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 29467 event pairs, 484 based on Foata normal form. 102/4237 useless extension candidates. Maximal degree in co-relation 23333. Up to 2558 conditions per place. [2024-06-27 18:34:03,414 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 212 selfloop transitions, 78 changer transitions 0/299 dead transitions. [2024-06-27 18:34:03,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 299 transitions, 3723 flow [2024-06-27 18:34:03,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:34:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:34:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-27 18:34:03,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2024-06-27 18:34:03,419 INFO L175 Difference]: Start difference. First operand has 185 places, 242 transitions, 2811 flow. Second operand 10 states and 192 transitions. [2024-06-27 18:34:03,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 299 transitions, 3723 flow [2024-06-27 18:34:03,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 299 transitions, 3579 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-27 18:34:03,660 INFO L231 Difference]: Finished difference. Result has 188 places, 244 transitions, 2871 flow [2024-06-27 18:34:03,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2871, PETRI_PLACES=188, PETRI_TRANSITIONS=244} [2024-06-27 18:34:03,660 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 147 predicate places. [2024-06-27 18:34:03,660 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 244 transitions, 2871 flow [2024-06-27 18:34:03,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:03,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:03,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:03,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 18:34:03,661 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:03,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash -341714000, now seen corresponding path program 6 times [2024-06-27 18:34:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488797710] [2024-06-27 18:34:03,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488797710] [2024-06-27 18:34:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488797710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:04,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:04,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:34:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316674961] [2024-06-27 18:34:04,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:04,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:34:04,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:04,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:34:04,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:34:04,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:04,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 244 transitions, 2871 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:04,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:04,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:04,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:04,985 INFO L124 PetriNetUnfolderBase]: 2294/4204 cut-off events. [2024-06-27 18:34:04,985 INFO L125 PetriNetUnfolderBase]: For 74273/74417 co-relation queries the response was YES. [2024-06-27 18:34:05,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24156 conditions, 4204 events. 2294/4204 cut-off events. For 74273/74417 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29083 event pairs, 706 based on Foata normal form. 85/4229 useless extension candidates. Maximal degree in co-relation 24063. Up to 3520 conditions per place. [2024-06-27 18:34:05,021 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 250 selfloop transitions, 22 changer transitions 0/281 dead transitions. [2024-06-27 18:34:05,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 281 transitions, 3619 flow [2024-06-27 18:34:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:34:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:34:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 18:34:05,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46546546546546547 [2024-06-27 18:34:05,023 INFO L175 Difference]: Start difference. First operand has 188 places, 244 transitions, 2871 flow. Second operand 9 states and 155 transitions. [2024-06-27 18:34:05,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 281 transitions, 3619 flow [2024-06-27 18:34:05,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 281 transitions, 3463 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 18:34:05,284 INFO L231 Difference]: Finished difference. Result has 189 places, 248 transitions, 2826 flow [2024-06-27 18:34:05,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2715, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2826, PETRI_PLACES=189, PETRI_TRANSITIONS=248} [2024-06-27 18:34:05,285 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places. [2024-06-27 18:34:05,285 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 248 transitions, 2826 flow [2024-06-27 18:34:05,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:05,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:05,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:05,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 18:34:05,285 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:05,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash -625920140, now seen corresponding path program 7 times [2024-06-27 18:34:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:05,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841571445] [2024-06-27 18:34:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:05,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:05,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:05,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841571445] [2024-06-27 18:34:05,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841571445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:05,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:05,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:34:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702025458] [2024-06-27 18:34:05,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:05,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:34:05,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:05,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:34:05,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:34:05,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:05,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 248 transitions, 2826 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:05,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:05,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:05,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:06,658 INFO L124 PetriNetUnfolderBase]: 2307/4267 cut-off events. [2024-06-27 18:34:06,659 INFO L125 PetriNetUnfolderBase]: For 73440/73572 co-relation queries the response was YES. [2024-06-27 18:34:06,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23908 conditions, 4267 events. 2307/4267 cut-off events. For 73440/73572 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 29788 event pairs, 685 based on Foata normal form. 79/4290 useless extension candidates. Maximal degree in co-relation 23814. Up to 3354 conditions per place. [2024-06-27 18:34:06,692 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 245 selfloop transitions, 37 changer transitions 0/291 dead transitions. [2024-06-27 18:34:06,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 291 transitions, 3641 flow [2024-06-27 18:34:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:34:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:34:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 18:34:06,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 18:34:06,694 INFO L175 Difference]: Start difference. First operand has 189 places, 248 transitions, 2826 flow. Second operand 9 states and 162 transitions. [2024-06-27 18:34:06,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 291 transitions, 3641 flow [2024-06-27 18:34:06,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 291 transitions, 3578 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 18:34:06,998 INFO L231 Difference]: Finished difference. Result has 191 places, 250 transitions, 2882 flow [2024-06-27 18:34:06,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2763, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2882, PETRI_PLACES=191, PETRI_TRANSITIONS=250} [2024-06-27 18:34:06,999 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 150 predicate places. [2024-06-27 18:34:06,999 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 250 transitions, 2882 flow [2024-06-27 18:34:06,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:06,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:06,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:07,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 18:34:07,000 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:07,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash -341446873, now seen corresponding path program 1 times [2024-06-27 18:34:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:07,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342518772] [2024-06-27 18:34:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:07,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:07,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342518772] [2024-06-27 18:34:07,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342518772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:07,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:07,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:34:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874284443] [2024-06-27 18:34:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:07,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:34:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:07,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:34:07,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:34:07,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:07,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 250 transitions, 2882 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:07,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:07,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:07,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:08,526 INFO L124 PetriNetUnfolderBase]: 2328/4247 cut-off events. [2024-06-27 18:34:08,527 INFO L125 PetriNetUnfolderBase]: For 69415/69555 co-relation queries the response was YES. [2024-06-27 18:34:08,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23885 conditions, 4247 events. 2328/4247 cut-off events. For 69415/69555 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 29214 event pairs, 716 based on Foata normal form. 80/4251 useless extension candidates. Maximal degree in co-relation 23790. Up to 3674 conditions per place. [2024-06-27 18:34:08,565 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 253 selfloop transitions, 21 changer transitions 3/286 dead transitions. [2024-06-27 18:34:08,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 286 transitions, 3600 flow [2024-06-27 18:34:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:34:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:34:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 18:34:08,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-06-27 18:34:08,567 INFO L175 Difference]: Start difference. First operand has 191 places, 250 transitions, 2882 flow. Second operand 9 states and 151 transitions. [2024-06-27 18:34:08,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 286 transitions, 3600 flow [2024-06-27 18:34:08,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 286 transitions, 3499 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 18:34:08,892 INFO L231 Difference]: Finished difference. Result has 195 places, 258 transitions, 2917 flow [2024-06-27 18:34:08,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2781, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2917, PETRI_PLACES=195, PETRI_TRANSITIONS=258} [2024-06-27 18:34:08,893 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 154 predicate places. [2024-06-27 18:34:08,893 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 258 transitions, 2917 flow [2024-06-27 18:34:08,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:08,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:08,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:08,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 18:34:08,894 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:08,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:08,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2118376908, now seen corresponding path program 8 times [2024-06-27 18:34:08,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:08,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036835455] [2024-06-27 18:34:08,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:08,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036835455] [2024-06-27 18:34:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036835455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:09,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:09,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:34:09,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185108480] [2024-06-27 18:34:09,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:09,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:34:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:09,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:34:09,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:34:09,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:09,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 258 transitions, 2917 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:09,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:09,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:09,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:10,186 INFO L124 PetriNetUnfolderBase]: 2366/4371 cut-off events. [2024-06-27 18:34:10,187 INFO L125 PetriNetUnfolderBase]: For 71287/71417 co-relation queries the response was YES. [2024-06-27 18:34:10,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24445 conditions, 4371 events. 2366/4371 cut-off events. For 71287/71417 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 30662 event pairs, 697 based on Foata normal form. 74/4384 useless extension candidates. Maximal degree in co-relation 24347. Up to 3615 conditions per place. [2024-06-27 18:34:10,228 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 261 selfloop transitions, 46 changer transitions 0/316 dead transitions. [2024-06-27 18:34:10,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 316 transitions, 4008 flow [2024-06-27 18:34:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:34:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:34:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 18:34:10,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46546546546546547 [2024-06-27 18:34:10,240 INFO L175 Difference]: Start difference. First operand has 195 places, 258 transitions, 2917 flow. Second operand 9 states and 155 transitions. [2024-06-27 18:34:10,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 316 transitions, 4008 flow [2024-06-27 18:34:10,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 316 transitions, 3952 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-27 18:34:10,575 INFO L231 Difference]: Finished difference. Result has 202 places, 280 transitions, 3334 flow [2024-06-27 18:34:10,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2861, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3334, PETRI_PLACES=202, PETRI_TRANSITIONS=280} [2024-06-27 18:34:10,576 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 161 predicate places. [2024-06-27 18:34:10,576 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 280 transitions, 3334 flow [2024-06-27 18:34:10,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:10,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:10,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:10,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 18:34:10,577 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:10,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash -626127530, now seen corresponding path program 9 times [2024-06-27 18:34:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:10,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863291238] [2024-06-27 18:34:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:11,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863291238] [2024-06-27 18:34:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863291238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:11,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:11,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:34:11,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785638973] [2024-06-27 18:34:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:11,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:34:11,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:11,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:34:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:34:11,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:11,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 280 transitions, 3334 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:11,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:11,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:11,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:12,076 INFO L124 PetriNetUnfolderBase]: 2369/4344 cut-off events. [2024-06-27 18:34:12,076 INFO L125 PetriNetUnfolderBase]: For 75006/75149 co-relation queries the response was YES. [2024-06-27 18:34:12,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25014 conditions, 4344 events. 2369/4344 cut-off events. For 75006/75149 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 30160 event pairs, 657 based on Foata normal form. 94/4377 useless extension candidates. Maximal degree in co-relation 24912. Up to 3298 conditions per place. [2024-06-27 18:34:12,113 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 258 selfloop transitions, 60 changer transitions 0/327 dead transitions. [2024-06-27 18:34:12,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 327 transitions, 4232 flow [2024-06-27 18:34:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:34:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:34:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 18:34:12,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 18:34:12,115 INFO L175 Difference]: Start difference. First operand has 202 places, 280 transitions, 3334 flow. Second operand 10 states and 180 transitions. [2024-06-27 18:34:12,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 327 transitions, 4232 flow [2024-06-27 18:34:12,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 327 transitions, 4077 flow, removed 66 selfloop flow, removed 4 redundant places. [2024-06-27 18:34:12,543 INFO L231 Difference]: Finished difference. Result has 208 places, 280 transitions, 3330 flow [2024-06-27 18:34:12,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3197, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3330, PETRI_PLACES=208, PETRI_TRANSITIONS=280} [2024-06-27 18:34:12,543 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 167 predicate places. [2024-06-27 18:34:12,544 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 280 transitions, 3330 flow [2024-06-27 18:34:12,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:12,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:12,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:12,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 18:34:12,544 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:12,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash -626127685, now seen corresponding path program 8 times [2024-06-27 18:34:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:12,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303493040] [2024-06-27 18:34:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303493040] [2024-06-27 18:34:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303493040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:13,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:34:13,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133745510] [2024-06-27 18:34:13,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:13,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:34:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:13,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:34:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:34:13,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:13,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 280 transitions, 3330 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:13,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:13,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:14,072 INFO L124 PetriNetUnfolderBase]: 2366/4336 cut-off events. [2024-06-27 18:34:14,072 INFO L125 PetriNetUnfolderBase]: For 71212/71348 co-relation queries the response was YES. [2024-06-27 18:34:14,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24910 conditions, 4336 events. 2366/4336 cut-off events. For 71212/71348 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 30054 event pairs, 743 based on Foata normal form. 80/4345 useless extension candidates. Maximal degree in co-relation 24807. Up to 3715 conditions per place. [2024-06-27 18:34:14,112 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 270 selfloop transitions, 33 changer transitions 0/312 dead transitions. [2024-06-27 18:34:14,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 312 transitions, 4090 flow [2024-06-27 18:34:14,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:34:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:34:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 18:34:14,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2024-06-27 18:34:14,113 INFO L175 Difference]: Start difference. First operand has 208 places, 280 transitions, 3330 flow. Second operand 9 states and 150 transitions. [2024-06-27 18:34:14,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 312 transitions, 4090 flow [2024-06-27 18:34:14,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 312 transitions, 3904 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-27 18:34:14,488 INFO L231 Difference]: Finished difference. Result has 208 places, 280 transitions, 3218 flow [2024-06-27 18:34:14,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3144, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3218, PETRI_PLACES=208, PETRI_TRANSITIONS=280} [2024-06-27 18:34:14,489 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 167 predicate places. [2024-06-27 18:34:14,489 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 280 transitions, 3218 flow [2024-06-27 18:34:14,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:14,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:14,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:14,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 18:34:14,490 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:14,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1173534837, now seen corresponding path program 1 times [2024-06-27 18:34:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635248770] [2024-06-27 18:34:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:15,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635248770] [2024-06-27 18:34:15,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635248770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:15,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:15,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:15,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016787882] [2024-06-27 18:34:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:15,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:15,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:15,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:15,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:15,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:15,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 280 transitions, 3218 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:15,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:15,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:15,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:15,974 INFO L124 PetriNetUnfolderBase]: 2628/4745 cut-off events. [2024-06-27 18:34:15,975 INFO L125 PetriNetUnfolderBase]: For 106957/107092 co-relation queries the response was YES. [2024-06-27 18:34:16,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27612 conditions, 4745 events. 2628/4745 cut-off events. For 106957/107092 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 33110 event pairs, 496 based on Foata normal form. 135/4809 useless extension candidates. Maximal degree in co-relation 27508. Up to 1452 conditions per place. [2024-06-27 18:34:16,016 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 236 selfloop transitions, 99 changer transitions 3/347 dead transitions. [2024-06-27 18:34:16,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 347 transitions, 4462 flow [2024-06-27 18:34:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:34:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:34:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-06-27 18:34:16,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297297297297298 [2024-06-27 18:34:16,021 INFO L175 Difference]: Start difference. First operand has 208 places, 280 transitions, 3218 flow. Second operand 10 states and 196 transitions. [2024-06-27 18:34:16,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 347 transitions, 4462 flow [2024-06-27 18:34:16,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 347 transitions, 4359 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-27 18:34:16,632 INFO L231 Difference]: Finished difference. Result has 211 places, 283 transitions, 3417 flow [2024-06-27 18:34:16,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3417, PETRI_PLACES=211, PETRI_TRANSITIONS=283} [2024-06-27 18:34:16,633 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2024-06-27 18:34:16,633 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 283 transitions, 3417 flow [2024-06-27 18:34:16,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:16,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:16,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:16,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 18:34:16,633 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:16,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1231747443, now seen corresponding path program 1 times [2024-06-27 18:34:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024047100] [2024-06-27 18:34:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:17,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-27 18:34:17,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:17,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024047100] [2024-06-27 18:34:17,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024047100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:17,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:17,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:17,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37770762] [2024-06-27 18:34:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:17,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:17,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:17,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 283 transitions, 3417 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:17,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:17,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:17,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:18,555 INFO L124 PetriNetUnfolderBase]: 2724/4929 cut-off events. [2024-06-27 18:34:18,555 INFO L125 PetriNetUnfolderBase]: For 110976/111137 co-relation queries the response was YES. [2024-06-27 18:34:18,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29494 conditions, 4929 events. 2724/4929 cut-off events. For 110976/111137 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 34781 event pairs, 448 based on Foata normal form. 154/5012 useless extension candidates. Maximal degree in co-relation 29388. Up to 2397 conditions per place. [2024-06-27 18:34:18,597 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 241 selfloop transitions, 118 changer transitions 4/372 dead transitions. [2024-06-27 18:34:18,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 372 transitions, 5039 flow [2024-06-27 18:34:18,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:34:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:34:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-27 18:34:18,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 18:34:18,598 INFO L175 Difference]: Start difference. First operand has 211 places, 283 transitions, 3417 flow. Second operand 11 states and 209 transitions. [2024-06-27 18:34:18,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 372 transitions, 5039 flow [2024-06-27 18:34:19,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 372 transitions, 4862 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-27 18:34:19,086 INFO L231 Difference]: Finished difference. Result has 219 places, 303 transitions, 3842 flow [2024-06-27 18:34:19,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3247, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3842, PETRI_PLACES=219, PETRI_TRANSITIONS=303} [2024-06-27 18:34:19,087 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2024-06-27 18:34:19,087 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 303 transitions, 3842 flow [2024-06-27 18:34:19,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:19,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:19,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:19,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 18:34:19,087 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:19,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1373918001, now seen corresponding path program 2 times [2024-06-27 18:34:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:19,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379655775] [2024-06-27 18:34:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:19,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379655775] [2024-06-27 18:34:19,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379655775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:19,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:19,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758908506] [2024-06-27 18:34:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:19,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:19,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:19,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:19,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:19,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:19,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 303 transitions, 3842 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:19,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:19,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:19,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:20,967 INFO L124 PetriNetUnfolderBase]: 2873/5259 cut-off events. [2024-06-27 18:34:20,967 INFO L125 PetriNetUnfolderBase]: For 141373/141549 co-relation queries the response was YES. [2024-06-27 18:34:20,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33157 conditions, 5259 events. 2873/5259 cut-off events. For 141373/141549 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 38031 event pairs, 594 based on Foata normal form. 149/5325 useless extension candidates. Maximal degree in co-relation 33046. Up to 2650 conditions per place. [2024-06-27 18:34:21,017 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 252 selfloop transitions, 114 changer transitions 2/377 dead transitions. [2024-06-27 18:34:21,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 377 transitions, 5209 flow [2024-06-27 18:34:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:34:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:34:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-27 18:34:21,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-06-27 18:34:21,019 INFO L175 Difference]: Start difference. First operand has 219 places, 303 transitions, 3842 flow. Second operand 11 states and 220 transitions. [2024-06-27 18:34:21,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 377 transitions, 5209 flow [2024-06-27 18:34:21,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 377 transitions, 5125 flow, removed 36 selfloop flow, removed 2 redundant places. [2024-06-27 18:34:21,553 INFO L231 Difference]: Finished difference. Result has 229 places, 306 transitions, 4100 flow [2024-06-27 18:34:21,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3762, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4100, PETRI_PLACES=229, PETRI_TRANSITIONS=306} [2024-06-27 18:34:21,562 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 188 predicate places. [2024-06-27 18:34:21,562 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 306 transitions, 4100 flow [2024-06-27 18:34:21,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:21,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:21,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:21,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 18:34:21,563 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:21,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1374033321, now seen corresponding path program 3 times [2024-06-27 18:34:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:21,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284415111] [2024-06-27 18:34:21,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:21,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:22,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284415111] [2024-06-27 18:34:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284415111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:22,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:22,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:22,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123518081] [2024-06-27 18:34:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:22,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:22,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:22,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:22,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:22,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 306 transitions, 4100 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:22,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:22,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:22,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:23,539 INFO L124 PetriNetUnfolderBase]: 2885/5302 cut-off events. [2024-06-27 18:34:23,539 INFO L125 PetriNetUnfolderBase]: For 148834/149012 co-relation queries the response was YES. [2024-06-27 18:34:23,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34268 conditions, 5302 events. 2885/5302 cut-off events. For 148834/149012 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 38580 event pairs, 605 based on Foata normal form. 167/5393 useless extension candidates. Maximal degree in co-relation 34154. Up to 2807 conditions per place. [2024-06-27 18:34:23,581 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 257 selfloop transitions, 116 changer transitions 0/382 dead transitions. [2024-06-27 18:34:23,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 382 transitions, 5429 flow [2024-06-27 18:34:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:34:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:34:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 234 transitions. [2024-06-27 18:34:23,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-27 18:34:23,583 INFO L175 Difference]: Start difference. First operand has 229 places, 306 transitions, 4100 flow. Second operand 12 states and 234 transitions. [2024-06-27 18:34:23,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 382 transitions, 5429 flow [2024-06-27 18:34:24,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 382 transitions, 5256 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-27 18:34:24,133 INFO L231 Difference]: Finished difference. Result has 234 places, 307 transitions, 4185 flow [2024-06-27 18:34:24,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3929, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4185, PETRI_PLACES=234, PETRI_TRANSITIONS=307} [2024-06-27 18:34:24,134 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 193 predicate places. [2024-06-27 18:34:24,134 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 307 transitions, 4185 flow [2024-06-27 18:34:24,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:24,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:24,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:24,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 18:34:24,135 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:24,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:24,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1374037971, now seen corresponding path program 4 times [2024-06-27 18:34:24,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:24,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262210066] [2024-06-27 18:34:24,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:24,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:24,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262210066] [2024-06-27 18:34:24,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262210066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:24,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259500365] [2024-06-27 18:34:24,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:24,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:24,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:24,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 307 transitions, 4185 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:24,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:24,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:24,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:26,008 INFO L124 PetriNetUnfolderBase]: 2863/5296 cut-off events. [2024-06-27 18:34:26,008 INFO L125 PetriNetUnfolderBase]: For 149216/149381 co-relation queries the response was YES. [2024-06-27 18:34:26,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33915 conditions, 5296 events. 2863/5296 cut-off events. For 149216/149381 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 38773 event pairs, 603 based on Foata normal form. 168/5392 useless extension candidates. Maximal degree in co-relation 33799. Up to 2907 conditions per place. [2024-06-27 18:34:26,062 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 256 selfloop transitions, 120 changer transitions 0/385 dead transitions. [2024-06-27 18:34:26,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 385 transitions, 5415 flow [2024-06-27 18:34:26,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 18:34:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 18:34:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 247 transitions. [2024-06-27 18:34:26,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 18:34:26,064 INFO L175 Difference]: Start difference. First operand has 234 places, 307 transitions, 4185 flow. Second operand 13 states and 247 transitions. [2024-06-27 18:34:26,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 385 transitions, 5415 flow [2024-06-27 18:34:26,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 385 transitions, 5146 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-06-27 18:34:26,772 INFO L231 Difference]: Finished difference. Result has 237 places, 307 transitions, 4165 flow [2024-06-27 18:34:26,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3916, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4165, PETRI_PLACES=237, PETRI_TRANSITIONS=307} [2024-06-27 18:34:26,772 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 196 predicate places. [2024-06-27 18:34:26,773 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 307 transitions, 4165 flow [2024-06-27 18:34:26,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:26,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:26,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:26,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 18:34:26,773 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:26,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:26,774 INFO L85 PathProgramCache]: Analyzing trace with hash -228841399, now seen corresponding path program 2 times [2024-06-27 18:34:26,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:26,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357717180] [2024-06-27 18:34:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:27,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357717180] [2024-06-27 18:34:27,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357717180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:27,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:27,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:27,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666371339] [2024-06-27 18:34:27,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:27,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:27,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:27,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:27,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:27,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:27,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 307 transitions, 4165 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:27,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:27,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:27,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:28,819 INFO L124 PetriNetUnfolderBase]: 2976/5435 cut-off events. [2024-06-27 18:34:28,819 INFO L125 PetriNetUnfolderBase]: For 134414/134564 co-relation queries the response was YES. [2024-06-27 18:34:28,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35174 conditions, 5435 events. 2976/5435 cut-off events. For 134414/134564 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 39503 event pairs, 538 based on Foata normal form. 148/5512 useless extension candidates. Maximal degree in co-relation 35057. Up to 3610 conditions per place. [2024-06-27 18:34:28,875 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 273 selfloop transitions, 102 changer transitions 4/388 dead transitions. [2024-06-27 18:34:28,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 388 transitions, 5744 flow [2024-06-27 18:34:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:34:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:34:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-27 18:34:28,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-06-27 18:34:28,877 INFO L175 Difference]: Start difference. First operand has 237 places, 307 transitions, 4165 flow. Second operand 10 states and 189 transitions. [2024-06-27 18:34:28,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 388 transitions, 5744 flow [2024-06-27 18:34:29,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 388 transitions, 5494 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 18:34:29,658 INFO L231 Difference]: Finished difference. Result has 240 places, 328 transitions, 4650 flow [2024-06-27 18:34:29,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3919, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4650, PETRI_PLACES=240, PETRI_TRANSITIONS=328} [2024-06-27 18:34:29,659 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places. [2024-06-27 18:34:29,659 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 328 transitions, 4650 flow [2024-06-27 18:34:29,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:29,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:29,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:29,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 18:34:29,660 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:29,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash -229014379, now seen corresponding path program 3 times [2024-06-27 18:34:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829686278] [2024-06-27 18:34:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:30,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829686278] [2024-06-27 18:34:30,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829686278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:30,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:30,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404047022] [2024-06-27 18:34:30,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:30,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:30,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:30,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:30,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:30,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 328 transitions, 4650 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:30,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:30,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:30,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:31,851 INFO L124 PetriNetUnfolderBase]: 3026/5686 cut-off events. [2024-06-27 18:34:31,852 INFO L125 PetriNetUnfolderBase]: For 144115/144281 co-relation queries the response was YES. [2024-06-27 18:34:31,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36695 conditions, 5686 events. 3026/5686 cut-off events. For 144115/144281 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 42850 event pairs, 742 based on Foata normal form. 141/5755 useless extension candidates. Maximal degree in co-relation 36572. Up to 3941 conditions per place. [2024-06-27 18:34:31,907 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 314 selfloop transitions, 81 changer transitions 1/405 dead transitions. [2024-06-27 18:34:31,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 405 transitions, 6035 flow [2024-06-27 18:34:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:34:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:34:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 218 transitions. [2024-06-27 18:34:31,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49099099099099097 [2024-06-27 18:34:31,908 INFO L175 Difference]: Start difference. First operand has 240 places, 328 transitions, 4650 flow. Second operand 12 states and 218 transitions. [2024-06-27 18:34:31,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 405 transitions, 6035 flow [2024-06-27 18:34:32,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 405 transitions, 5752 flow, removed 103 selfloop flow, removed 3 redundant places. [2024-06-27 18:34:32,683 INFO L231 Difference]: Finished difference. Result has 252 places, 341 transitions, 4789 flow [2024-06-27 18:34:32,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4386, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4789, PETRI_PLACES=252, PETRI_TRANSITIONS=341} [2024-06-27 18:34:32,684 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 211 predicate places. [2024-06-27 18:34:32,684 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 341 transitions, 4789 flow [2024-06-27 18:34:32,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:32,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:32,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:32,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 18:34:32,684 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:32,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1779024431, now seen corresponding path program 4 times [2024-06-27 18:34:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252757197] [2024-06-27 18:34:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:33,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-27 18:34:33,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:33,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252757197] [2024-06-27 18:34:33,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252757197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:33,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:33,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713866604] [2024-06-27 18:34:33,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:33,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:33,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:33,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 341 transitions, 4789 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:33,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:33,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:33,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:34,854 INFO L124 PetriNetUnfolderBase]: 3050/5699 cut-off events. [2024-06-27 18:34:34,854 INFO L125 PetriNetUnfolderBase]: For 145791/145989 co-relation queries the response was YES. [2024-06-27 18:34:34,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37355 conditions, 5699 events. 3050/5699 cut-off events. For 145791/145989 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 42702 event pairs, 738 based on Foata normal form. 171/5796 useless extension candidates. Maximal degree in co-relation 37227. Up to 3893 conditions per place. [2024-06-27 18:34:34,912 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 310 selfloop transitions, 92 changer transitions 0/411 dead transitions. [2024-06-27 18:34:34,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 411 transitions, 6031 flow [2024-06-27 18:34:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 18:34:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 18:34:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 234 transitions. [2024-06-27 18:34:34,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 18:34:34,913 INFO L175 Difference]: Start difference. First operand has 252 places, 341 transitions, 4789 flow. Second operand 13 states and 234 transitions. [2024-06-27 18:34:34,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 411 transitions, 6031 flow [2024-06-27 18:34:35,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 411 transitions, 5853 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 18:34:35,754 INFO L231 Difference]: Finished difference. Result has 258 places, 343 transitions, 4844 flow [2024-06-27 18:34:35,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4611, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4844, PETRI_PLACES=258, PETRI_TRANSITIONS=343} [2024-06-27 18:34:35,754 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 217 predicate places. [2024-06-27 18:34:35,754 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 343 transitions, 4844 flow [2024-06-27 18:34:35,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:35,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:35,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:35,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 18:34:35,755 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:35,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1107938511, now seen corresponding path program 5 times [2024-06-27 18:34:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:35,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969728319] [2024-06-27 18:34:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:36,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:36,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969728319] [2024-06-27 18:34:36,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969728319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:36,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:36,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431509212] [2024-06-27 18:34:36,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:36,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:36,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:36,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:36,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:36,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:36,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 343 transitions, 4844 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:36,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:36,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:36,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:37,622 INFO L124 PetriNetUnfolderBase]: 3134/5632 cut-off events. [2024-06-27 18:34:37,622 INFO L125 PetriNetUnfolderBase]: For 161768/161954 co-relation queries the response was YES. [2024-06-27 18:34:37,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38206 conditions, 5632 events. 3134/5632 cut-off events. For 161768/161954 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 40647 event pairs, 546 based on Foata normal form. 167/5706 useless extension candidates. Maximal degree in co-relation 38077. Up to 2602 conditions per place. [2024-06-27 18:34:37,784 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 273 selfloop transitions, 122 changer transitions 6/410 dead transitions. [2024-06-27 18:34:37,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 410 transitions, 6191 flow [2024-06-27 18:34:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:34:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:34:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-27 18:34:37,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5486486486486486 [2024-06-27 18:34:37,785 INFO L175 Difference]: Start difference. First operand has 258 places, 343 transitions, 4844 flow. Second operand 10 states and 203 transitions. [2024-06-27 18:34:37,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 410 transitions, 6191 flow [2024-06-27 18:34:38,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 410 transitions, 6021 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-27 18:34:38,663 INFO L231 Difference]: Finished difference. Result has 260 places, 338 transitions, 4876 flow [2024-06-27 18:34:38,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4674, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4876, PETRI_PLACES=260, PETRI_TRANSITIONS=338} [2024-06-27 18:34:38,664 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 219 predicate places. [2024-06-27 18:34:38,664 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 338 transitions, 4876 flow [2024-06-27 18:34:38,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:38,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:38,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:38,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 18:34:38,665 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:38,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1107818541, now seen corresponding path program 6 times [2024-06-27 18:34:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:38,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468423550] [2024-06-27 18:34:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:39,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468423550] [2024-06-27 18:34:39,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468423550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:39,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:39,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:39,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983396399] [2024-06-27 18:34:39,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:39,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:39,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:39,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:39,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:39,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:39,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 338 transitions, 4876 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:39,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:39,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:39,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:40,842 INFO L124 PetriNetUnfolderBase]: 3269/5998 cut-off events. [2024-06-27 18:34:40,842 INFO L125 PetriNetUnfolderBase]: For 190730/190925 co-relation queries the response was YES. [2024-06-27 18:34:40,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40151 conditions, 5998 events. 3269/5998 cut-off events. For 190730/190925 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 44706 event pairs, 596 based on Foata normal form. 191/6096 useless extension candidates. Maximal degree in co-relation 40021. Up to 3686 conditions per place. [2024-06-27 18:34:40,902 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 286 selfloop transitions, 133 changer transitions 0/428 dead transitions. [2024-06-27 18:34:40,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 428 transitions, 6469 flow [2024-06-27 18:34:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:34:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:34:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2024-06-27 18:34:40,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2024-06-27 18:34:40,928 INFO L175 Difference]: Start difference. First operand has 260 places, 338 transitions, 4876 flow. Second operand 12 states and 237 transitions. [2024-06-27 18:34:40,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 428 transitions, 6469 flow [2024-06-27 18:34:41,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 428 transitions, 6138 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-27 18:34:41,980 INFO L231 Difference]: Finished difference. Result has 267 places, 349 transitions, 5137 flow [2024-06-27 18:34:41,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4549, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5137, PETRI_PLACES=267, PETRI_TRANSITIONS=349} [2024-06-27 18:34:41,981 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 226 predicate places. [2024-06-27 18:34:41,981 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 349 transitions, 5137 flow [2024-06-27 18:34:41,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:41,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:41,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:41,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 18:34:41,981 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:41,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1107823191, now seen corresponding path program 7 times [2024-06-27 18:34:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823208376] [2024-06-27 18:34:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:42,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823208376] [2024-06-27 18:34:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823208376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:42,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759505280] [2024-06-27 18:34:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:42,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:42,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:42,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:42,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 349 transitions, 5137 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:42,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:42,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:42,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:44,374 INFO L124 PetriNetUnfolderBase]: 3292/6021 cut-off events. [2024-06-27 18:34:44,374 INFO L125 PetriNetUnfolderBase]: For 176441/176638 co-relation queries the response was YES. [2024-06-27 18:34:44,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41135 conditions, 6021 events. 3292/6021 cut-off events. For 176441/176638 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 44792 event pairs, 611 based on Foata normal form. 181/6109 useless extension candidates. Maximal degree in co-relation 41001. Up to 3639 conditions per place. [2024-06-27 18:34:44,439 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 289 selfloop transitions, 127 changer transitions 0/425 dead transitions. [2024-06-27 18:34:44,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 425 transitions, 6599 flow [2024-06-27 18:34:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:34:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:34:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2024-06-27 18:34:44,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5503685503685504 [2024-06-27 18:34:44,441 INFO L175 Difference]: Start difference. First operand has 267 places, 349 transitions, 5137 flow. Second operand 11 states and 224 transitions. [2024-06-27 18:34:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 425 transitions, 6599 flow [2024-06-27 18:34:45,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 425 transitions, 6494 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 18:34:45,370 INFO L231 Difference]: Finished difference. Result has 272 places, 350 transitions, 5313 flow [2024-06-27 18:34:45,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5032, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5313, PETRI_PLACES=272, PETRI_TRANSITIONS=350} [2024-06-27 18:34:45,370 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 231 predicate places. [2024-06-27 18:34:45,371 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 350 transitions, 5313 flow [2024-06-27 18:34:45,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:45,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:45,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:45,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 18:34:45,371 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:45,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1778429785, now seen corresponding path program 5 times [2024-06-27 18:34:45,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:45,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574594095] [2024-06-27 18:34:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:45,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:46,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-27 18:34:46,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:46,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574594095] [2024-06-27 18:34:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574594095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:46,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:46,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:46,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127321357] [2024-06-27 18:34:46,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:46,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:46,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:46,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:46,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:46,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:46,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 350 transitions, 5313 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:46,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:46,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:46,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:47,626 INFO L124 PetriNetUnfolderBase]: 3324/6124 cut-off events. [2024-06-27 18:34:47,626 INFO L125 PetriNetUnfolderBase]: For 185374/185565 co-relation queries the response was YES. [2024-06-27 18:34:47,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42164 conditions, 6124 events. 3324/6124 cut-off events. For 185374/185565 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 45987 event pairs, 641 based on Foata normal form. 175/6207 useless extension candidates. Maximal degree in co-relation 42028. Up to 3882 conditions per place. [2024-06-27 18:34:47,694 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 297 selfloop transitions, 128 changer transitions 0/434 dead transitions. [2024-06-27 18:34:47,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 434 transitions, 6886 flow [2024-06-27 18:34:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 18:34:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 18:34:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 248 transitions. [2024-06-27 18:34:47,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155925155925156 [2024-06-27 18:34:47,695 INFO L175 Difference]: Start difference. First operand has 272 places, 350 transitions, 5313 flow. Second operand 13 states and 248 transitions. [2024-06-27 18:34:47,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 434 transitions, 6886 flow [2024-06-27 18:34:48,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 434 transitions, 6625 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-27 18:34:48,775 INFO L231 Difference]: Finished difference. Result has 277 places, 356 transitions, 5453 flow [2024-06-27 18:34:48,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5054, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5453, PETRI_PLACES=277, PETRI_TRANSITIONS=356} [2024-06-27 18:34:48,776 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 236 predicate places. [2024-06-27 18:34:48,776 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 356 transitions, 5453 flow [2024-06-27 18:34:48,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:48,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:48,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:48,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 18:34:48,777 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:48,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1079406825, now seen corresponding path program 8 times [2024-06-27 18:34:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:48,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650013732] [2024-06-27 18:34:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:48,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650013732] [2024-06-27 18:34:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650013732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:49,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:49,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:49,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618332787] [2024-06-27 18:34:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:49,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:49,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:49,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 356 transitions, 5453 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:49,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:49,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:49,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:51,129 INFO L124 PetriNetUnfolderBase]: 3427/6511 cut-off events. [2024-06-27 18:34:51,129 INFO L125 PetriNetUnfolderBase]: For 219392/219561 co-relation queries the response was YES. [2024-06-27 18:34:51,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43553 conditions, 6511 events. 3427/6511 cut-off events. For 219392/219561 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 51004 event pairs, 857 based on Foata normal form. 158/6601 useless extension candidates. Maximal degree in co-relation 43415. Up to 4422 conditions per place. [2024-06-27 18:34:51,206 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 329 selfloop transitions, 86 changer transitions 0/424 dead transitions. [2024-06-27 18:34:51,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 424 transitions, 6747 flow [2024-06-27 18:34:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:34:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:34:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-27 18:34:51,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-06-27 18:34:51,207 INFO L175 Difference]: Start difference. First operand has 277 places, 356 transitions, 5453 flow. Second operand 11 states and 213 transitions. [2024-06-27 18:34:51,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 424 transitions, 6747 flow [2024-06-27 18:34:52,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 424 transitions, 6534 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-27 18:34:52,357 INFO L231 Difference]: Finished difference. Result has 280 places, 357 transitions, 5443 flow [2024-06-27 18:34:52,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5240, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5443, PETRI_PLACES=280, PETRI_TRANSITIONS=357} [2024-06-27 18:34:52,358 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 239 predicate places. [2024-06-27 18:34:52,358 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 357 transitions, 5443 flow [2024-06-27 18:34:52,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:52,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:52,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-27 18:34:52,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 18:34:52,359 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:52,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash -937120761, now seen corresponding path program 9 times [2024-06-27 18:34:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372223483] [2024-06-27 18:34:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372223483] [2024-06-27 18:34:53,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372223483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:53,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:53,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:53,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474489239] [2024-06-27 18:34:53,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:53,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:53,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:53,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:53,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:53,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:53,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 357 transitions, 5443 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:53,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:53,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:53,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:54,978 INFO L124 PetriNetUnfolderBase]: 3674/6912 cut-off events. [2024-06-27 18:34:54,978 INFO L125 PetriNetUnfolderBase]: For 253261/253474 co-relation queries the response was YES. [2024-06-27 18:34:55,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47160 conditions, 6912 events. 3674/6912 cut-off events. For 253261/253474 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 54351 event pairs, 876 based on Foata normal form. 186/7025 useless extension candidates. Maximal degree in co-relation 47020. Up to 4324 conditions per place. [2024-06-27 18:34:55,069 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 331 selfloop transitions, 81 changer transitions 0/421 dead transitions. [2024-06-27 18:34:55,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 421 transitions, 6838 flow [2024-06-27 18:34:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:34:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:34:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-27 18:34:55,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-27 18:34:55,070 INFO L175 Difference]: Start difference. First operand has 280 places, 357 transitions, 5443 flow. Second operand 10 states and 195 transitions. [2024-06-27 18:34:55,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 421 transitions, 6838 flow [2024-06-27 18:34:56,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 421 transitions, 6663 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-27 18:34:56,329 INFO L231 Difference]: Finished difference. Result has 282 places, 359 transitions, 5485 flow [2024-06-27 18:34:56,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5268, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5485, PETRI_PLACES=282, PETRI_TRANSITIONS=359} [2024-06-27 18:34:56,329 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 241 predicate places. [2024-06-27 18:34:56,329 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 359 transitions, 5485 flow [2024-06-27 18:34:56,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:56,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:34:56,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:34:56,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 18:34:56,330 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:34:56,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:34:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1079406639, now seen corresponding path program 6 times [2024-06-27 18:34:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:34:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797841540] [2024-06-27 18:34:56,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:34:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:34:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:34:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:34:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:34:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797841540] [2024-06-27 18:34:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797841540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:34:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:34:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:34:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260357659] [2024-06-27 18:34:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:34:57,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:34:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:34:57,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:34:57,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:34:57,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:34:57,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 359 transitions, 5485 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:34:57,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:34:57,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:34:57,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:34:58,981 INFO L124 PetriNetUnfolderBase]: 3812/7038 cut-off events. [2024-06-27 18:34:58,981 INFO L125 PetriNetUnfolderBase]: For 268281/268522 co-relation queries the response was YES. [2024-06-27 18:34:59,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49328 conditions, 7038 events. 3812/7038 cut-off events. For 268281/268522 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 54590 event pairs, 772 based on Foata normal form. 235/7190 useless extension candidates. Maximal degree in co-relation 49186. Up to 4809 conditions per place. [2024-06-27 18:34:59,048 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 308 selfloop transitions, 124 changer transitions 1/442 dead transitions. [2024-06-27 18:34:59,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 442 transitions, 7392 flow [2024-06-27 18:34:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:34:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:34:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-27 18:34:59,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216216216216216 [2024-06-27 18:34:59,049 INFO L175 Difference]: Start difference. First operand has 282 places, 359 transitions, 5485 flow. Second operand 10 states and 193 transitions. [2024-06-27 18:34:59,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 442 transitions, 7392 flow [2024-06-27 18:35:00,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 442 transitions, 7234 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-27 18:35:00,313 INFO L231 Difference]: Finished difference. Result has 288 places, 377 transitions, 6050 flow [2024-06-27 18:35:00,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5327, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6050, PETRI_PLACES=288, PETRI_TRANSITIONS=377} [2024-06-27 18:35:00,314 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 247 predicate places. [2024-06-27 18:35:00,314 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 377 transitions, 6050 flow [2024-06-27 18:35:00,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:00,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:00,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:00,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 18:35:00,315 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:00,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1079233659, now seen corresponding path program 7 times [2024-06-27 18:35:00,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:00,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282468835] [2024-06-27 18:35:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:01,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:01,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282468835] [2024-06-27 18:35:01,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282468835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:01,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:01,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:01,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819570515] [2024-06-27 18:35:01,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:01,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:01,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:01,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:01,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:01,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 377 transitions, 6050 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:01,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:01,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:01,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:02,892 INFO L124 PetriNetUnfolderBase]: 3856/7354 cut-off events. [2024-06-27 18:35:02,892 INFO L125 PetriNetUnfolderBase]: For 280814/281001 co-relation queries the response was YES. [2024-06-27 18:35:02,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51348 conditions, 7354 events. 3856/7354 cut-off events. For 280814/281001 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 59114 event pairs, 1045 based on Foata normal form. 165/7445 useless extension candidates. Maximal degree in co-relation 51202. Up to 5465 conditions per place. [2024-06-27 18:35:02,973 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 354 selfloop transitions, 78 changer transitions 0/441 dead transitions. [2024-06-27 18:35:02,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 441 transitions, 7404 flow [2024-06-27 18:35:02,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:35:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:35:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2024-06-27 18:35:02,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987714987714988 [2024-06-27 18:35:02,975 INFO L175 Difference]: Start difference. First operand has 288 places, 377 transitions, 6050 flow. Second operand 11 states and 203 transitions. [2024-06-27 18:35:02,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 441 transitions, 7404 flow [2024-06-27 18:35:04,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 441 transitions, 7218 flow, removed 82 selfloop flow, removed 3 redundant places. [2024-06-27 18:35:04,847 INFO L231 Difference]: Finished difference. Result has 297 places, 382 transitions, 6167 flow [2024-06-27 18:35:04,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5866, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6167, PETRI_PLACES=297, PETRI_TRANSITIONS=382} [2024-06-27 18:35:04,848 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 256 predicate places. [2024-06-27 18:35:04,848 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 382 transitions, 6167 flow [2024-06-27 18:35:04,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:04,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:04,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:04,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 18:35:04,849 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:04,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:04,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1955561119, now seen corresponding path program 10 times [2024-06-27 18:35:04,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:04,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029572754] [2024-06-27 18:35:04,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:05,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:05,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029572754] [2024-06-27 18:35:05,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029572754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:05,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:05,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:05,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486193519] [2024-06-27 18:35:05,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:05,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:05,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:05,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:05,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:05,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:05,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 382 transitions, 6167 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:05,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:05,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:05,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:07,270 INFO L124 PetriNetUnfolderBase]: 3832/7243 cut-off events. [2024-06-27 18:35:07,270 INFO L125 PetriNetUnfolderBase]: For 283232/283441 co-relation queries the response was YES. [2024-06-27 18:35:07,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49576 conditions, 7243 events. 3832/7243 cut-off events. For 283232/283441 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 57696 event pairs, 965 based on Foata normal form. 203/7369 useless extension candidates. Maximal degree in co-relation 49428. Up to 5011 conditions per place. [2024-06-27 18:35:07,361 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 348 selfloop transitions, 82 changer transitions 0/439 dead transitions. [2024-06-27 18:35:07,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 439 transitions, 7396 flow [2024-06-27 18:35:07,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:35:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:35:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-27 18:35:07,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-06-27 18:35:07,363 INFO L175 Difference]: Start difference. First operand has 297 places, 382 transitions, 6167 flow. Second operand 10 states and 191 transitions. [2024-06-27 18:35:07,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 439 transitions, 7396 flow [2024-06-27 18:35:08,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 439 transitions, 7207 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-27 18:35:08,865 INFO L231 Difference]: Finished difference. Result has 300 places, 382 transitions, 6148 flow [2024-06-27 18:35:08,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5978, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6148, PETRI_PLACES=300, PETRI_TRANSITIONS=382} [2024-06-27 18:35:08,865 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 259 predicate places. [2024-06-27 18:35:08,865 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 382 transitions, 6148 flow [2024-06-27 18:35:08,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:08,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:08,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:08,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 18:35:08,866 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:08,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:08,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1072977549, now seen corresponding path program 8 times [2024-06-27 18:35:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:08,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885945455] [2024-06-27 18:35:08,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:09,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885945455] [2024-06-27 18:35:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885945455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:09,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618657540] [2024-06-27 18:35:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:09,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:09,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:09,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 382 transitions, 6148 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:09,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:09,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:11,645 INFO L124 PetriNetUnfolderBase]: 3825/7274 cut-off events. [2024-06-27 18:35:11,645 INFO L125 PetriNetUnfolderBase]: For 228623/228847 co-relation queries the response was YES. [2024-06-27 18:35:11,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49379 conditions, 7274 events. 3825/7274 cut-off events. For 228623/228847 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 58238 event pairs, 1037 based on Foata normal form. 198/7395 useless extension candidates. Maximal degree in co-relation 49230. Up to 5381 conditions per place. [2024-06-27 18:35:11,720 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 346 selfloop transitions, 89 changer transitions 0/444 dead transitions. [2024-06-27 18:35:11,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 444 transitions, 7467 flow [2024-06-27 18:35:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:35:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:35:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-27 18:35:11,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012285012285013 [2024-06-27 18:35:11,722 INFO L175 Difference]: Start difference. First operand has 300 places, 382 transitions, 6148 flow. Second operand 11 states and 204 transitions. [2024-06-27 18:35:11,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 444 transitions, 7467 flow [2024-06-27 18:35:12,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 444 transitions, 7243 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-27 18:35:12,996 INFO L231 Difference]: Finished difference. Result has 303 places, 388 transitions, 6239 flow [2024-06-27 18:35:12,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5932, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6239, PETRI_PLACES=303, PETRI_TRANSITIONS=388} [2024-06-27 18:35:12,997 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 262 predicate places. [2024-06-27 18:35:12,997 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 388 transitions, 6239 flow [2024-06-27 18:35:12,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:12,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:12,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:12,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 18:35:12,998 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:12,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1690155605, now seen corresponding path program 9 times [2024-06-27 18:35:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324869434] [2024-06-27 18:35:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:13,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:13,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324869434] [2024-06-27 18:35:13,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324869434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:13,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:13,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:13,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969341450] [2024-06-27 18:35:13,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:13,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:13,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:13,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:13,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:13,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:13,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 388 transitions, 6239 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:13,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:13,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:13,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:15,625 INFO L124 PetriNetUnfolderBase]: 3820/7027 cut-off events. [2024-06-27 18:35:15,625 INFO L125 PetriNetUnfolderBase]: For 227114/227394 co-relation queries the response was YES. [2024-06-27 18:35:15,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48599 conditions, 7027 events. 3820/7027 cut-off events. For 227114/227394 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 54363 event pairs, 1361 based on Foata normal form. 155/7062 useless extension candidates. Maximal degree in co-relation 48448. Up to 6164 conditions per place. [2024-06-27 18:35:15,716 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 377 selfloop transitions, 38 changer transitions 7/431 dead transitions. [2024-06-27 18:35:15,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 431 transitions, 7360 flow [2024-06-27 18:35:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:35:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:35:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-06-27 18:35:15,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44471744471744473 [2024-06-27 18:35:15,717 INFO L175 Difference]: Start difference. First operand has 303 places, 388 transitions, 6239 flow. Second operand 11 states and 181 transitions. [2024-06-27 18:35:15,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 431 transitions, 7360 flow [2024-06-27 18:35:17,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 431 transitions, 7164 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-27 18:35:17,503 INFO L231 Difference]: Finished difference. Result has 310 places, 395 transitions, 6286 flow [2024-06-27 18:35:17,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6043, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6286, PETRI_PLACES=310, PETRI_TRANSITIONS=395} [2024-06-27 18:35:17,504 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 269 predicate places. [2024-06-27 18:35:17,504 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 395 transitions, 6286 flow [2024-06-27 18:35:17,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:17,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:17,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:17,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 18:35:17,504 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:17,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:17,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2064884017, now seen corresponding path program 11 times [2024-06-27 18:35:17,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:17,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884545024] [2024-06-27 18:35:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:18,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:18,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884545024] [2024-06-27 18:35:18,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884545024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:18,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:18,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120004840] [2024-06-27 18:35:18,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:18,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:18,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:18,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:18,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:18,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 395 transitions, 6286 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:18,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:18,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:18,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:20,068 INFO L124 PetriNetUnfolderBase]: 3832/7053 cut-off events. [2024-06-27 18:35:20,069 INFO L125 PetriNetUnfolderBase]: For 228275/228556 co-relation queries the response was YES. [2024-06-27 18:35:20,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48554 conditions, 7053 events. 3832/7053 cut-off events. For 228275/228556 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 54823 event pairs, 1317 based on Foata normal form. 174/7101 useless extension candidates. Maximal degree in co-relation 48399. Up to 6061 conditions per place. [2024-06-27 18:35:20,158 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 379 selfloop transitions, 60 changer transitions 0/448 dead transitions. [2024-06-27 18:35:20,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 448 transitions, 7625 flow [2024-06-27 18:35:20,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:35:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:35:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 18:35:20,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-27 18:35:20,160 INFO L175 Difference]: Start difference. First operand has 310 places, 395 transitions, 6286 flow. Second operand 10 states and 172 transitions. [2024-06-27 18:35:20,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 448 transitions, 7625 flow [2024-06-27 18:35:22,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 448 transitions, 7516 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 18:35:22,108 INFO L231 Difference]: Finished difference. Result has 316 places, 406 transitions, 6596 flow [2024-06-27 18:35:22,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6177, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6596, PETRI_PLACES=316, PETRI_TRANSITIONS=406} [2024-06-27 18:35:22,109 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 275 predicate places. [2024-06-27 18:35:22,109 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 406 transitions, 6596 flow [2024-06-27 18:35:22,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:22,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:22,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:22,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 18:35:22,110 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:22,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2064884203, now seen corresponding path program 10 times [2024-06-27 18:35:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:22,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535882421] [2024-06-27 18:35:22,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:22,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:22,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535882421] [2024-06-27 18:35:22,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535882421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:22,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:22,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:22,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301866430] [2024-06-27 18:35:22,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:22,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:22,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:22,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:22,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:22,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 406 transitions, 6596 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:22,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:22,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:22,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:24,763 INFO L124 PetriNetUnfolderBase]: 3862/7129 cut-off events. [2024-06-27 18:35:24,763 INFO L125 PetriNetUnfolderBase]: For 236335/236606 co-relation queries the response was YES. [2024-06-27 18:35:24,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49420 conditions, 7129 events. 3862/7129 cut-off events. For 236335/236606 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 55484 event pairs, 1280 based on Foata normal form. 162/7175 useless extension candidates. Maximal degree in co-relation 49262. Up to 5820 conditions per place. [2024-06-27 18:35:24,859 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 386 selfloop transitions, 57 changer transitions 3/455 dead transitions. [2024-06-27 18:35:24,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 455 transitions, 7936 flow [2024-06-27 18:35:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:35:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:35:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-27 18:35:24,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-06-27 18:35:24,861 INFO L175 Difference]: Start difference. First operand has 316 places, 406 transitions, 6596 flow. Second operand 10 states and 178 transitions. [2024-06-27 18:35:24,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 455 transitions, 7936 flow [2024-06-27 18:35:26,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 455 transitions, 7765 flow, removed 59 selfloop flow, removed 5 redundant places. [2024-06-27 18:35:26,924 INFO L231 Difference]: Finished difference. Result has 321 places, 405 transitions, 6552 flow [2024-06-27 18:35:26,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6429, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6552, PETRI_PLACES=321, PETRI_TRANSITIONS=405} [2024-06-27 18:35:26,925 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 280 predicate places. [2024-06-27 18:35:26,925 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 405 transitions, 6552 flow [2024-06-27 18:35:26,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:26,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:26,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:26,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 18:35:26,925 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:26,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1245173555, now seen corresponding path program 11 times [2024-06-27 18:35:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674392871] [2024-06-27 18:35:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674392871] [2024-06-27 18:35:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674392871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938795624] [2024-06-27 18:35:27,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:27,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:27,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:27,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:27,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:27,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 405 transitions, 6552 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:27,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:27,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:27,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:29,517 INFO L124 PetriNetUnfolderBase]: 3894/7218 cut-off events. [2024-06-27 18:35:29,517 INFO L125 PetriNetUnfolderBase]: For 243722/243999 co-relation queries the response was YES. [2024-06-27 18:35:29,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49992 conditions, 7218 events. 3894/7218 cut-off events. For 243722/243999 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 56665 event pairs, 1240 based on Foata normal form. 159/7265 useless extension candidates. Maximal degree in co-relation 49832. Up to 5829 conditions per place. [2024-06-27 18:35:29,622 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 364 selfloop transitions, 89 changer transitions 0/462 dead transitions. [2024-06-27 18:35:29,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 462 transitions, 7950 flow [2024-06-27 18:35:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:35:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:35:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 18:35:29,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-27 18:35:29,623 INFO L175 Difference]: Start difference. First operand has 321 places, 405 transitions, 6552 flow. Second operand 10 states and 182 transitions. [2024-06-27 18:35:29,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 462 transitions, 7950 flow [2024-06-27 18:35:31,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 462 transitions, 7815 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-27 18:35:31,439 INFO L231 Difference]: Finished difference. Result has 325 places, 415 transitions, 6894 flow [2024-06-27 18:35:31,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6423, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6894, PETRI_PLACES=325, PETRI_TRANSITIONS=415} [2024-06-27 18:35:31,439 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 284 predicate places. [2024-06-27 18:35:31,439 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 415 transitions, 6894 flow [2024-06-27 18:35:31,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:31,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:31,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:31,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 18:35:31,440 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:31,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1246579663, now seen corresponding path program 1 times [2024-06-27 18:35:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:31,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782458321] [2024-06-27 18:35:31,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:31,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:32,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-27 18:35:32,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:32,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782458321] [2024-06-27 18:35:32,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782458321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:32,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:35:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825955462] [2024-06-27 18:35:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:32,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:35:32,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:32,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:35:32,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:35:32,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:32,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 415 transitions, 6894 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:32,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:32,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:32,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:34,029 INFO L124 PetriNetUnfolderBase]: 3960/7262 cut-off events. [2024-06-27 18:35:34,029 INFO L125 PetriNetUnfolderBase]: For 251098/251417 co-relation queries the response was YES. [2024-06-27 18:35:34,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51116 conditions, 7262 events. 3960/7262 cut-off events. For 251098/251417 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 56328 event pairs, 1398 based on Foata normal form. 191/7333 useless extension candidates. Maximal degree in co-relation 50955. Up to 6394 conditions per place. [2024-06-27 18:35:34,124 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 412 selfloop transitions, 39 changer transitions 0/460 dead transitions. [2024-06-27 18:35:34,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 460 transitions, 8111 flow [2024-06-27 18:35:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:35:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:35:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 18:35:34,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-27 18:35:34,125 INFO L175 Difference]: Start difference. First operand has 325 places, 415 transitions, 6894 flow. Second operand 10 states and 172 transitions. [2024-06-27 18:35:34,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 460 transitions, 8111 flow [2024-06-27 18:35:36,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 460 transitions, 7872 flow, removed 80 selfloop flow, removed 4 redundant places. [2024-06-27 18:35:36,065 INFO L231 Difference]: Finished difference. Result has 332 places, 419 transitions, 6852 flow [2024-06-27 18:35:36,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6657, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6852, PETRI_PLACES=332, PETRI_TRANSITIONS=419} [2024-06-27 18:35:36,066 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 291 predicate places. [2024-06-27 18:35:36,066 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 419 transitions, 6852 flow [2024-06-27 18:35:36,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:36,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:36,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:36,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 18:35:36,067 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:36,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash 292213235, now seen corresponding path program 12 times [2024-06-27 18:35:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:36,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714013085] [2024-06-27 18:35:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:36,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714013085] [2024-06-27 18:35:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714013085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:36,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:36,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489951284] [2024-06-27 18:35:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:36,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:36,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:36,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:36,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:36,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 419 transitions, 6852 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:36,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:36,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:36,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:38,719 INFO L124 PetriNetUnfolderBase]: 3985/7325 cut-off events. [2024-06-27 18:35:38,719 INFO L125 PetriNetUnfolderBase]: For 253004/253285 co-relation queries the response was YES. [2024-06-27 18:35:38,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51404 conditions, 7325 events. 3985/7325 cut-off events. For 253004/253285 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 56957 event pairs, 1384 based on Foata normal form. 155/7353 useless extension candidates. Maximal degree in co-relation 51240. Up to 6401 conditions per place. [2024-06-27 18:35:38,819 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 427 selfloop transitions, 33 changer transitions 1/470 dead transitions. [2024-06-27 18:35:38,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 470 transitions, 8127 flow [2024-06-27 18:35:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:35:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:35:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-06-27 18:35:38,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4643734643734644 [2024-06-27 18:35:38,820 INFO L175 Difference]: Start difference. First operand has 332 places, 419 transitions, 6852 flow. Second operand 11 states and 189 transitions. [2024-06-27 18:35:38,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 470 transitions, 8127 flow [2024-06-27 18:35:40,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 470 transitions, 7999 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-27 18:35:40,701 INFO L231 Difference]: Finished difference. Result has 337 places, 426 transitions, 6940 flow [2024-06-27 18:35:40,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6724, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6940, PETRI_PLACES=337, PETRI_TRANSITIONS=426} [2024-06-27 18:35:40,702 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 296 predicate places. [2024-06-27 18:35:40,702 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 426 transitions, 6940 flow [2024-06-27 18:35:40,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:40,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:40,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:40,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 18:35:40,703 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:40,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1690146677, now seen corresponding path program 2 times [2024-06-27 18:35:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044222926] [2024-06-27 18:35:40,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044222926] [2024-06-27 18:35:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044222926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:41,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:41,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:35:41,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951157030] [2024-06-27 18:35:41,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:41,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:35:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:41,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:35:41,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:35:41,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:41,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 426 transitions, 6940 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:41,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:41,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:41,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:43,622 INFO L124 PetriNetUnfolderBase]: 3995/7312 cut-off events. [2024-06-27 18:35:43,622 INFO L125 PetriNetUnfolderBase]: For 256730/257021 co-relation queries the response was YES. [2024-06-27 18:35:43,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51395 conditions, 7312 events. 3995/7312 cut-off events. For 256730/257021 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 56685 event pairs, 1449 based on Foata normal form. 165/7347 useless extension candidates. Maximal degree in co-relation 51229. Up to 6569 conditions per place. [2024-06-27 18:35:43,706 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 427 selfloop transitions, 21 changer transitions 0/457 dead transitions. [2024-06-27 18:35:43,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 457 transitions, 7983 flow [2024-06-27 18:35:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:35:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:35:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 18:35:43,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44054054054054054 [2024-06-27 18:35:43,707 INFO L175 Difference]: Start difference. First operand has 337 places, 426 transitions, 6940 flow. Second operand 10 states and 163 transitions. [2024-06-27 18:35:43,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 457 transitions, 7983 flow [2024-06-27 18:35:45,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 457 transitions, 7903 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-27 18:35:45,765 INFO L231 Difference]: Finished difference. Result has 340 places, 427 transitions, 6943 flow [2024-06-27 18:35:45,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6860, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6943, PETRI_PLACES=340, PETRI_TRANSITIONS=427} [2024-06-27 18:35:45,766 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 299 predicate places. [2024-06-27 18:35:45,766 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 427 transitions, 6943 flow [2024-06-27 18:35:45,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:45,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:45,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:45,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 18:35:45,766 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:45,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1205554595, now seen corresponding path program 12 times [2024-06-27 18:35:45,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:45,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619223623] [2024-06-27 18:35:45,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:46,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619223623] [2024-06-27 18:35:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619223623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:46,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:46,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911273301] [2024-06-27 18:35:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:46,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:46,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:46,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:46,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:46,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 427 transitions, 6943 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:46,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:46,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:46,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:48,380 INFO L124 PetriNetUnfolderBase]: 4183/7657 cut-off events. [2024-06-27 18:35:48,380 INFO L125 PetriNetUnfolderBase]: For 329609/329916 co-relation queries the response was YES. [2024-06-27 18:35:48,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52740 conditions, 7657 events. 4183/7657 cut-off events. For 329609/329916 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 59949 event pairs, 1437 based on Foata normal form. 205/7733 useless extension candidates. Maximal degree in co-relation 52573. Up to 6396 conditions per place. [2024-06-27 18:35:48,476 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 431 selfloop transitions, 30 changer transitions 0/470 dead transitions. [2024-06-27 18:35:48,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 470 transitions, 8096 flow [2024-06-27 18:35:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:35:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:35:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-27 18:35:48,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2024-06-27 18:35:48,478 INFO L175 Difference]: Start difference. First operand has 340 places, 427 transitions, 6943 flow. Second operand 10 states and 176 transitions. [2024-06-27 18:35:48,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 470 transitions, 8096 flow [2024-06-27 18:35:50,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 470 transitions, 7972 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-27 18:35:50,736 INFO L231 Difference]: Finished difference. Result has 342 places, 428 transitions, 6902 flow [2024-06-27 18:35:50,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6819, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6902, PETRI_PLACES=342, PETRI_TRANSITIONS=428} [2024-06-27 18:35:50,737 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 301 predicate places. [2024-06-27 18:35:50,737 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 428 transitions, 6902 flow [2024-06-27 18:35:50,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:50,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:50,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:50,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 18:35:50,737 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:50,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1245173741, now seen corresponding path program 13 times [2024-06-27 18:35:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:50,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820741981] [2024-06-27 18:35:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820741981] [2024-06-27 18:35:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820741981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:51,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:51,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:51,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113948977] [2024-06-27 18:35:51,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:51,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:51,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:51,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:51,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 428 transitions, 6902 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:51,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:51,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:51,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:53,617 INFO L124 PetriNetUnfolderBase]: 4287/7915 cut-off events. [2024-06-27 18:35:53,617 INFO L125 PetriNetUnfolderBase]: For 302729/303022 co-relation queries the response was YES. [2024-06-27 18:35:53,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53753 conditions, 7915 events. 4287/7915 cut-off events. For 302729/303022 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 62825 event pairs, 1484 based on Foata normal form. 187/7978 useless extension candidates. Maximal degree in co-relation 53586. Up to 6632 conditions per place. [2024-06-27 18:35:53,722 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 424 selfloop transitions, 48 changer transitions 0/481 dead transitions. [2024-06-27 18:35:53,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 481 transitions, 8178 flow [2024-06-27 18:35:53,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:35:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:35:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 18:35:53,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-27 18:35:53,723 INFO L175 Difference]: Start difference. First operand has 342 places, 428 transitions, 6902 flow. Second operand 10 states and 182 transitions. [2024-06-27 18:35:53,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 481 transitions, 8178 flow [2024-06-27 18:35:55,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 481 transitions, 8124 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-27 18:35:55,994 INFO L231 Difference]: Finished difference. Result has 344 places, 429 transitions, 6981 flow [2024-06-27 18:35:55,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6848, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6981, PETRI_PLACES=344, PETRI_TRANSITIONS=429} [2024-06-27 18:35:55,994 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 303 predicate places. [2024-06-27 18:35:55,995 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 429 transitions, 6981 flow [2024-06-27 18:35:55,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:55,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:35:55,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:35:55,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 18:35:55,995 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:35:55,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:35:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1245351371, now seen corresponding path program 14 times [2024-06-27 18:35:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:35:55,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271064866] [2024-06-27 18:35:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:35:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:35:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:35:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:35:56,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:35:56,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271064866] [2024-06-27 18:35:56,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271064866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:35:56,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:35:56,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:35:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157876958] [2024-06-27 18:35:56,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:35:56,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:35:56,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:35:56,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:35:56,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:35:56,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:35:56,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 429 transitions, 6981 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:35:56,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:35:56,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:35:56,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:35:58,865 INFO L124 PetriNetUnfolderBase]: 4303/7901 cut-off events. [2024-06-27 18:35:58,865 INFO L125 PetriNetUnfolderBase]: For 268115/268430 co-relation queries the response was YES. [2024-06-27 18:35:58,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54153 conditions, 7901 events. 4303/7901 cut-off events. For 268115/268430 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 62482 event pairs, 1496 based on Foata normal form. 209/7971 useless extension candidates. Maximal degree in co-relation 53985. Up to 6730 conditions per place. [2024-06-27 18:35:58,970 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 403 selfloop transitions, 65 changer transitions 1/478 dead transitions. [2024-06-27 18:35:58,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 478 transitions, 8432 flow [2024-06-27 18:35:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:35:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:35:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-27 18:35:58,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2024-06-27 18:35:58,972 INFO L175 Difference]: Start difference. First operand has 344 places, 429 transitions, 6981 flow. Second operand 10 states and 174 transitions. [2024-06-27 18:35:58,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 478 transitions, 8432 flow [2024-06-27 18:36:01,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 478 transitions, 8321 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-27 18:36:01,534 INFO L231 Difference]: Finished difference. Result has 347 places, 433 transitions, 7150 flow [2024-06-27 18:36:01,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6870, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7150, PETRI_PLACES=347, PETRI_TRANSITIONS=433} [2024-06-27 18:36:01,534 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 306 predicate places. [2024-06-27 18:36:01,534 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 433 transitions, 7150 flow [2024-06-27 18:36:01,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:01,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:01,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:01,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 18:36:01,535 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:01,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1238917445, now seen corresponding path program 13 times [2024-06-27 18:36:01,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:01,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224271067] [2024-06-27 18:36:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:36:02,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224271067] [2024-06-27 18:36:02,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224271067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:02,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:02,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:36:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414274327] [2024-06-27 18:36:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:02,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:36:02,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:36:02,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:36:02,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:02,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 433 transitions, 7150 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:02,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:02,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:02,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:04,392 INFO L124 PetriNetUnfolderBase]: 4359/8167 cut-off events. [2024-06-27 18:36:04,392 INFO L125 PetriNetUnfolderBase]: For 273132/273425 co-relation queries the response was YES. [2024-06-27 18:36:04,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55510 conditions, 8167 events. 4359/8167 cut-off events. For 273132/273425 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 66123 event pairs, 1454 based on Foata normal form. 173/8216 useless extension candidates. Maximal degree in co-relation 55340. Up to 6605 conditions per place. [2024-06-27 18:36:04,502 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 399 selfloop transitions, 86 changer transitions 0/494 dead transitions. [2024-06-27 18:36:04,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 494 transitions, 8681 flow [2024-06-27 18:36:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:36:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:36:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 18:36:04,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-06-27 18:36:04,504 INFO L175 Difference]: Start difference. First operand has 347 places, 433 transitions, 7150 flow. Second operand 10 states and 183 transitions. [2024-06-27 18:36:04,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 494 transitions, 8681 flow [2024-06-27 18:36:06,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 494 transitions, 8448 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-27 18:36:06,854 INFO L231 Difference]: Finished difference. Result has 353 places, 447 transitions, 7498 flow [2024-06-27 18:36:06,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6940, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7498, PETRI_PLACES=353, PETRI_TRANSITIONS=447} [2024-06-27 18:36:06,855 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 312 predicate places. [2024-06-27 18:36:06,855 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 447 transitions, 7498 flow [2024-06-27 18:36:06,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:06,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:06,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:06,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 18:36:06,856 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:06,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1678748597, now seen corresponding path program 3 times [2024-06-27 18:36:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849235273] [2024-06-27 18:36:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:36:07,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849235273] [2024-06-27 18:36:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849235273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:36:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268901531] [2024-06-27 18:36:07,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:07,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:36:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:07,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:36:07,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:36:07,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:07,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 447 transitions, 7498 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:07,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:07,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:07,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:09,876 INFO L124 PetriNetUnfolderBase]: 4382/8112 cut-off events. [2024-06-27 18:36:09,876 INFO L125 PetriNetUnfolderBase]: For 276366/276675 co-relation queries the response was YES. [2024-06-27 18:36:09,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56032 conditions, 8112 events. 4382/8112 cut-off events. For 276366/276675 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 64871 event pairs, 1596 based on Foata normal form. 183/8160 useless extension candidates. Maximal degree in co-relation 55858. Up to 7231 conditions per place. [2024-06-27 18:36:09,990 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 446 selfloop transitions, 29 changer transitions 0/484 dead transitions. [2024-06-27 18:36:09,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 484 transitions, 8629 flow [2024-06-27 18:36:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:36:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:36:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-27 18:36:09,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45135135135135135 [2024-06-27 18:36:09,991 INFO L175 Difference]: Start difference. First operand has 353 places, 447 transitions, 7498 flow. Second operand 10 states and 167 transitions. [2024-06-27 18:36:09,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 484 transitions, 8629 flow [2024-06-27 18:36:12,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 484 transitions, 8479 flow, removed 64 selfloop flow, removed 3 redundant places. [2024-06-27 18:36:12,756 INFO L231 Difference]: Finished difference. Result has 361 places, 450 transitions, 7478 flow [2024-06-27 18:36:12,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7348, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7478, PETRI_PLACES=361, PETRI_TRANSITIONS=450} [2024-06-27 18:36:12,757 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 320 predicate places. [2024-06-27 18:36:12,757 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 450 transitions, 7478 flow [2024-06-27 18:36:12,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:12,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:12,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:12,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 18:36:12,758 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:12,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash 292459313, now seen corresponding path program 4 times [2024-06-27 18:36:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:12,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926516105] [2024-06-27 18:36:12,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:12,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:13,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-27 18:36:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926516105] [2024-06-27 18:36:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926516105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:36:13,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883357239] [2024-06-27 18:36:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:13,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:36:13,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:36:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:36:13,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:13,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 450 transitions, 7478 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:13,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:13,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:13,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:15,658 INFO L124 PetriNetUnfolderBase]: 4400/8103 cut-off events. [2024-06-27 18:36:15,658 INFO L125 PetriNetUnfolderBase]: For 284256/284569 co-relation queries the response was YES. [2024-06-27 18:36:15,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56457 conditions, 8103 events. 4400/8103 cut-off events. For 284256/284569 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 64607 event pairs, 1628 based on Foata normal form. 186/8151 useless extension candidates. Maximal degree in co-relation 56280. Up to 7277 conditions per place. [2024-06-27 18:36:15,774 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 450 selfloop transitions, 26 changer transitions 0/485 dead transitions. [2024-06-27 18:36:15,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 485 transitions, 8628 flow [2024-06-27 18:36:15,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:36:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:36:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-27 18:36:15,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45135135135135135 [2024-06-27 18:36:15,776 INFO L175 Difference]: Start difference. First operand has 361 places, 450 transitions, 7478 flow. Second operand 10 states and 167 transitions. [2024-06-27 18:36:15,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 485 transitions, 8628 flow [2024-06-27 18:36:18,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 485 transitions, 8533 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-27 18:36:18,125 INFO L231 Difference]: Finished difference. Result has 365 places, 452 transitions, 7507 flow [2024-06-27 18:36:18,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7383, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7507, PETRI_PLACES=365, PETRI_TRANSITIONS=452} [2024-06-27 18:36:18,126 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 324 predicate places. [2024-06-27 18:36:18,126 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 452 transitions, 7507 flow [2024-06-27 18:36:18,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:18,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:18,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:18,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 18:36:18,127 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:18,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 985098847, now seen corresponding path program 15 times [2024-06-27 18:36:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617452962] [2024-06-27 18:36:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:36:18,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:18,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617452962] [2024-06-27 18:36:18,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617452962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:18,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:18,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:36:18,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79532610] [2024-06-27 18:36:18,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:18,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:36:18,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:18,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:36:18,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:36:18,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:18,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 452 transitions, 7507 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:18,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:18,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:18,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:20,951 INFO L124 PetriNetUnfolderBase]: 4379/8109 cut-off events. [2024-06-27 18:36:20,951 INFO L125 PetriNetUnfolderBase]: For 283364/283660 co-relation queries the response was YES. [2024-06-27 18:36:21,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54332 conditions, 8109 events. 4379/8109 cut-off events. For 283364/283660 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 64885 event pairs, 1494 based on Foata normal form. 201/8181 useless extension candidates. Maximal degree in co-relation 54153. Up to 6557 conditions per place. [2024-06-27 18:36:21,083 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 448 selfloop transitions, 45 changer transitions 0/502 dead transitions. [2024-06-27 18:36:21,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 502 transitions, 8802 flow [2024-06-27 18:36:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:36:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:36:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 18:36:21,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-06-27 18:36:21,085 INFO L175 Difference]: Start difference. First operand has 365 places, 452 transitions, 7507 flow. Second operand 10 states and 183 transitions. [2024-06-27 18:36:21,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 502 transitions, 8802 flow [2024-06-27 18:36:23,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 502 transitions, 8716 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 18:36:23,227 INFO L231 Difference]: Finished difference. Result has 369 places, 452 transitions, 7518 flow [2024-06-27 18:36:23,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7421, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7518, PETRI_PLACES=369, PETRI_TRANSITIONS=452} [2024-06-27 18:36:23,228 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 328 predicate places. [2024-06-27 18:36:23,228 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 452 transitions, 7518 flow [2024-06-27 18:36:23,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:23,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:23,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:23,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 18:36:23,229 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:23,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:23,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2071559371, now seen corresponding path program 5 times [2024-06-27 18:36:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:23,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575644263] [2024-06-27 18:36:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:36:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575644263] [2024-06-27 18:36:24,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575644263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:24,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:24,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:36:24,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805010033] [2024-06-27 18:36:24,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:24,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:36:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:24,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:36:24,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:36:24,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:24,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 452 transitions, 7518 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:24,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:24,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:24,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:26,090 INFO L124 PetriNetUnfolderBase]: 4371/8052 cut-off events. [2024-06-27 18:36:26,090 INFO L125 PetriNetUnfolderBase]: For 196509/196822 co-relation queries the response was YES. [2024-06-27 18:36:26,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53930 conditions, 8052 events. 4371/8052 cut-off events. For 196509/196822 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 64121 event pairs, 1581 based on Foata normal form. 186/8102 useless extension candidates. Maximal degree in co-relation 53750. Up to 7204 conditions per place. [2024-06-27 18:36:26,207 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 452 selfloop transitions, 30 changer transitions 0/491 dead transitions. [2024-06-27 18:36:26,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 491 transitions, 8717 flow [2024-06-27 18:36:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:36:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:36:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 18:36:26,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-06-27 18:36:26,208 INFO L175 Difference]: Start difference. First operand has 369 places, 452 transitions, 7518 flow. Second operand 10 states and 169 transitions. [2024-06-27 18:36:26,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 491 transitions, 8717 flow [2024-06-27 18:36:28,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 491 transitions, 8630 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-27 18:36:28,134 INFO L231 Difference]: Finished difference. Result has 372 places, 454 transitions, 7565 flow [2024-06-27 18:36:28,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7431, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7565, PETRI_PLACES=372, PETRI_TRANSITIONS=454} [2024-06-27 18:36:28,135 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 331 predicate places. [2024-06-27 18:36:28,135 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 454 transitions, 7565 flow [2024-06-27 18:36:28,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:28,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:28,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:28,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 18:36:28,136 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:28,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:28,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1529619419, now seen corresponding path program 6 times [2024-06-27 18:36:28,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:28,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306488830] [2024-06-27 18:36:28,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:28,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:28,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-27 18:36:28,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:28,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306488830] [2024-06-27 18:36:28,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306488830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:28,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:36:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34895477] [2024-06-27 18:36:28,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:28,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:36:28,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:28,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:36:28,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:36:29,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:29,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 454 transitions, 7565 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:29,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:29,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:29,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:31,056 INFO L124 PetriNetUnfolderBase]: 4372/8095 cut-off events. [2024-06-27 18:36:31,056 INFO L125 PetriNetUnfolderBase]: For 192913/193222 co-relation queries the response was YES. [2024-06-27 18:36:31,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53906 conditions, 8095 events. 4372/8095 cut-off events. For 192913/193222 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 64910 event pairs, 1566 based on Foata normal form. 188/8149 useless extension candidates. Maximal degree in co-relation 53724. Up to 7172 conditions per place. [2024-06-27 18:36:31,166 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 443 selfloop transitions, 38 changer transitions 0/490 dead transitions. [2024-06-27 18:36:31,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 490 transitions, 8714 flow [2024-06-27 18:36:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:36:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:36:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-27 18:36:31,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2024-06-27 18:36:31,167 INFO L175 Difference]: Start difference. First operand has 372 places, 454 transitions, 7565 flow. Second operand 10 states and 168 transitions. [2024-06-27 18:36:31,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 490 transitions, 8714 flow [2024-06-27 18:36:32,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 490 transitions, 8614 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-27 18:36:32,900 INFO L231 Difference]: Finished difference. Result has 375 places, 455 transitions, 7594 flow [2024-06-27 18:36:32,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7465, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7594, PETRI_PLACES=375, PETRI_TRANSITIONS=455} [2024-06-27 18:36:32,901 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 334 predicate places. [2024-06-27 18:36:32,901 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 455 transitions, 7594 flow [2024-06-27 18:36:32,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:32,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:32,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:32,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 18:36:32,902 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:32,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:32,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1764248104, now seen corresponding path program 1 times [2024-06-27 18:36:32,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:32,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012741227] [2024-06-27 18:36:32,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:36:32,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:32,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012741227] [2024-06-27 18:36:32,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012741227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:32,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:32,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:36:32,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261039841] [2024-06-27 18:36:32,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:32,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:36:32,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:32,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:36:32,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:36:32,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-06-27 18:36:32,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 455 transitions, 7594 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-27 18:36:32,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:32,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-06-27 18:36:32,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:35,032 INFO L124 PetriNetUnfolderBase]: 4879/9513 cut-off events. [2024-06-27 18:36:35,033 INFO L125 PetriNetUnfolderBase]: For 155642/156427 co-relation queries the response was YES. [2024-06-27 18:36:35,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58667 conditions, 9513 events. 4879/9513 cut-off events. For 155642/156427 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 84866 event pairs, 1550 based on Foata normal form. 717/9927 useless extension candidates. Maximal degree in co-relation 58485. Up to 4478 conditions per place. [2024-06-27 18:36:35,159 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 220 selfloop transitions, 61 changer transitions 335/839 dead transitions. [2024-06-27 18:36:35,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 839 transitions, 15415 flow [2024-06-27 18:36:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:36:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:36:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-27 18:36:35,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-06-27 18:36:35,160 INFO L175 Difference]: Start difference. First operand has 375 places, 455 transitions, 7594 flow. Second operand 8 states and 178 transitions. [2024-06-27 18:36:35,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 839 transitions, 15415 flow [2024-06-27 18:36:37,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 839 transitions, 15211 flow, removed 50 selfloop flow, removed 8 redundant places. [2024-06-27 18:36:37,084 INFO L231 Difference]: Finished difference. Result has 380 places, 429 transitions, 7244 flow [2024-06-27 18:36:37,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7464, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7244, PETRI_PLACES=380, PETRI_TRANSITIONS=429} [2024-06-27 18:36:37,084 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 339 predicate places. [2024-06-27 18:36:37,084 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 429 transitions, 7244 flow [2024-06-27 18:36:37,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-27 18:36:37,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:37,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:37,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 18:36:37,085 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:37,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash -689103522, now seen corresponding path program 1 times [2024-06-27 18:36:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:37,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401641174] [2024-06-27 18:36:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:36:37,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:37,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401641174] [2024-06-27 18:36:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401641174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:37,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:37,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:36:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231620524] [2024-06-27 18:36:37,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:37,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:36:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:37,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:36:37,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:36:37,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:37,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 429 transitions, 7244 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:37,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:37,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:37,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:40,665 INFO L124 PetriNetUnfolderBase]: 5498/11121 cut-off events. [2024-06-27 18:36:40,665 INFO L125 PetriNetUnfolderBase]: For 248790/248964 co-relation queries the response was YES. [2024-06-27 18:36:40,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67940 conditions, 11121 events. 5498/11121 cut-off events. For 248790/248964 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 100976 event pairs, 864 based on Foata normal form. 157/11208 useless extension candidates. Maximal degree in co-relation 67752. Up to 3609 conditions per place. [2024-06-27 18:36:40,834 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 542 selfloop transitions, 193 changer transitions 23/769 dead transitions. [2024-06-27 18:36:40,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 769 transitions, 14045 flow [2024-06-27 18:36:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:36:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:36:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2024-06-27 18:36:40,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382882882882883 [2024-06-27 18:36:40,835 INFO L175 Difference]: Start difference. First operand has 380 places, 429 transitions, 7244 flow. Second operand 12 states and 239 transitions. [2024-06-27 18:36:40,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 769 transitions, 14045 flow [2024-06-27 18:36:44,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 769 transitions, 13917 flow, removed 51 selfloop flow, removed 3 redundant places. [2024-06-27 18:36:44,043 INFO L231 Difference]: Finished difference. Result has 394 places, 541 transitions, 10186 flow [2024-06-27 18:36:44,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7192, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10186, PETRI_PLACES=394, PETRI_TRANSITIONS=541} [2024-06-27 18:36:44,044 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 353 predicate places. [2024-06-27 18:36:44,044 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 541 transitions, 10186 flow [2024-06-27 18:36:44,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:44,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:44,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:44,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 18:36:44,044 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:44,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:44,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2019842732, now seen corresponding path program 2 times [2024-06-27 18:36:44,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:44,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943719763] [2024-06-27 18:36:44,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:44,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:36:44,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:44,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943719763] [2024-06-27 18:36:44,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943719763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:44,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:44,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:36:44,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911429807] [2024-06-27 18:36:44,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:44,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:36:44,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:44,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:36:44,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:36:44,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:44,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 541 transitions, 10186 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:44,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:44,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:44,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:48,136 INFO L124 PetriNetUnfolderBase]: 5273/10264 cut-off events. [2024-06-27 18:36:48,137 INFO L125 PetriNetUnfolderBase]: For 263357/263562 co-relation queries the response was YES. [2024-06-27 18:36:48,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66648 conditions, 10264 events. 5273/10264 cut-off events. For 263357/263562 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 90030 event pairs, 1427 based on Foata normal form. 193/10358 useless extension candidates. Maximal degree in co-relation 66452. Up to 4682 conditions per place. [2024-06-27 18:36:48,258 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 288 selfloop transitions, 321 changer transitions 0/620 dead transitions. [2024-06-27 18:36:48,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 620 transitions, 12296 flow [2024-06-27 18:36:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:36:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:36:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2024-06-27 18:36:48,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2024-06-27 18:36:48,259 INFO L175 Difference]: Start difference. First operand has 394 places, 541 transitions, 10186 flow. Second operand 12 states and 225 transitions. [2024-06-27 18:36:48,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 620 transitions, 12296 flow [2024-06-27 18:36:51,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 620 transitions, 12004 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-06-27 18:36:51,694 INFO L231 Difference]: Finished difference. Result has 401 places, 544 transitions, 10717 flow [2024-06-27 18:36:51,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9964, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10717, PETRI_PLACES=401, PETRI_TRANSITIONS=544} [2024-06-27 18:36:51,695 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 360 predicate places. [2024-06-27 18:36:51,695 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 544 transitions, 10717 flow [2024-06-27 18:36:51,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:51,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:51,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:51,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 18:36:51,696 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:51,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash -354638856, now seen corresponding path program 3 times [2024-06-27 18:36:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433065271] [2024-06-27 18:36:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:36:52,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433065271] [2024-06-27 18:36:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433065271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:52,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:52,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:36:52,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539422314] [2024-06-27 18:36:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:52,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:36:52,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:52,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:36:52,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:36:52,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:52,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 544 transitions, 10717 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:52,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:52,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:52,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:36:56,066 INFO L124 PetriNetUnfolderBase]: 5643/11175 cut-off events. [2024-06-27 18:36:56,066 INFO L125 PetriNetUnfolderBase]: For 306935/307148 co-relation queries the response was YES. [2024-06-27 18:36:56,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69918 conditions, 11175 events. 5643/11175 cut-off events. For 306935/307148 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 101267 event pairs, 1862 based on Foata normal form. 197/11271 useless extension candidates. Maximal degree in co-relation 69722. Up to 6920 conditions per place. [2024-06-27 18:36:56,377 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 303 selfloop transitions, 307 changer transitions 0/621 dead transitions. [2024-06-27 18:36:56,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 621 transitions, 12818 flow [2024-06-27 18:36:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:36:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:36:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2024-06-27 18:36:56,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282555282555282 [2024-06-27 18:36:56,380 INFO L175 Difference]: Start difference. First operand has 401 places, 544 transitions, 10717 flow. Second operand 11 states and 215 transitions. [2024-06-27 18:36:56,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 621 transitions, 12818 flow [2024-06-27 18:36:58,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 621 transitions, 12208 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-27 18:36:58,813 INFO L231 Difference]: Finished difference. Result has 406 places, 549 transitions, 10864 flow [2024-06-27 18:36:58,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10109, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10864, PETRI_PLACES=406, PETRI_TRANSITIONS=549} [2024-06-27 18:36:58,814 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 365 predicate places. [2024-06-27 18:36:58,814 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 549 transitions, 10864 flow [2024-06-27 18:36:58,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:58,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:36:58,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:36:58,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 18:36:58,815 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:36:58,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:36:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash -354494706, now seen corresponding path program 4 times [2024-06-27 18:36:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:36:58,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964096476] [2024-06-27 18:36:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:36:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:36:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:36:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:36:59,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:36:59,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964096476] [2024-06-27 18:36:59,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964096476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:36:59,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:36:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:36:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495794837] [2024-06-27 18:36:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:36:59,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:36:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:36:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:36:59,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:36:59,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:36:59,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 549 transitions, 10864 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:36:59,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:36:59,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:36:59,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:37:04,072 INFO L124 PetriNetUnfolderBase]: 5949/12371 cut-off events. [2024-06-27 18:37:04,072 INFO L125 PetriNetUnfolderBase]: For 376958/377183 co-relation queries the response was YES. [2024-06-27 18:37:04,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74762 conditions, 12371 events. 5949/12371 cut-off events. For 376958/377183 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 118597 event pairs, 2361 based on Foata normal form. 214/12500 useless extension candidates. Maximal degree in co-relation 74565. Up to 7498 conditions per place. [2024-06-27 18:37:04,245 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 377 selfloop transitions, 243 changer transitions 1/632 dead transitions. [2024-06-27 18:37:04,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 632 transitions, 12749 flow [2024-06-27 18:37:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 18:37:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 18:37:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 262 transitions. [2024-06-27 18:37:04,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057915057915058 [2024-06-27 18:37:04,247 INFO L175 Difference]: Start difference. First operand has 406 places, 549 transitions, 10864 flow. Second operand 14 states and 262 transitions. [2024-06-27 18:37:04,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 632 transitions, 12749 flow [2024-06-27 18:37:07,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 632 transitions, 12115 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 18:37:07,587 INFO L231 Difference]: Finished difference. Result has 414 places, 551 transitions, 10785 flow [2024-06-27 18:37:07,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10232, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10785, PETRI_PLACES=414, PETRI_TRANSITIONS=551} [2024-06-27 18:37:07,588 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 373 predicate places. [2024-06-27 18:37:07,588 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 551 transitions, 10785 flow [2024-06-27 18:37:07,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:37:07,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:37:07,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:37:07,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 18:37:07,589 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:37:07,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:37:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash -474258614, now seen corresponding path program 5 times [2024-06-27 18:37:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:37:07,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733740177] [2024-06-27 18:37:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:37:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:37:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:37:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:37:08,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:37:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733740177] [2024-06-27 18:37:08,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733740177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:37:08,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:37:08,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:37:08,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178383850] [2024-06-27 18:37:08,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:37:08,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:37:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:37:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:37:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:37:08,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:37:08,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 551 transitions, 10785 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:37:08,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:37:08,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:37:08,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:37:12,896 INFO L124 PetriNetUnfolderBase]: 6159/12262 cut-off events. [2024-06-27 18:37:12,896 INFO L125 PetriNetUnfolderBase]: For 352657/352876 co-relation queries the response was YES. [2024-06-27 18:37:13,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75486 conditions, 12262 events. 6159/12262 cut-off events. For 352657/352876 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 113846 event pairs, 2190 based on Foata normal form. 201/12362 useless extension candidates. Maximal degree in co-relation 75287. Up to 7306 conditions per place. [2024-06-27 18:37:13,063 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 310 selfloop transitions, 314 changer transitions 0/635 dead transitions. [2024-06-27 18:37:13,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 635 transitions, 12986 flow [2024-06-27 18:37:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:37:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:37:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2024-06-27 18:37:13,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292792792792793 [2024-06-27 18:37:13,065 INFO L175 Difference]: Start difference. First operand has 414 places, 551 transitions, 10785 flow. Second operand 12 states and 235 transitions. [2024-06-27 18:37:13,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 635 transitions, 12986 flow [2024-06-27 18:37:16,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 635 transitions, 12667 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 18:37:16,744 INFO L231 Difference]: Finished difference. Result has 419 places, 558 transitions, 11276 flow [2024-06-27 18:37:16,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10467, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=307, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11276, PETRI_PLACES=419, PETRI_TRANSITIONS=558} [2024-06-27 18:37:16,745 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 378 predicate places. [2024-06-27 18:37:16,745 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 558 transitions, 11276 flow [2024-06-27 18:37:16,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:37:16,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:37:16,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:37:16,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 18:37:16,760 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:37:16,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:37:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash -470533964, now seen corresponding path program 6 times [2024-06-27 18:37:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:37:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982621127] [2024-06-27 18:37:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:37:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:37:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:37:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:37:17,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:37:17,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982621127] [2024-06-27 18:37:17,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982621127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:37:17,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:37:17,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:37:17,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345948124] [2024-06-27 18:37:17,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:37:17,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:37:17,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:37:17,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:37:17,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:37:17,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:37:17,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 558 transitions, 11276 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:37:17,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:37:17,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:37:17,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:37:22,133 INFO L124 PetriNetUnfolderBase]: 6151/12805 cut-off events. [2024-06-27 18:37:22,133 INFO L125 PetriNetUnfolderBase]: For 336131/336363 co-relation queries the response was YES. [2024-06-27 18:37:22,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75906 conditions, 12805 events. 6151/12805 cut-off events. For 336131/336363 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 123708 event pairs, 2678 based on Foata normal form. 223/12939 useless extension candidates. Maximal degree in co-relation 75703. Up to 8698 conditions per place. [2024-06-27 18:37:22,316 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 379 selfloop transitions, 248 changer transitions 1/639 dead transitions. [2024-06-27 18:37:22,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 639 transitions, 12963 flow [2024-06-27 18:37:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 18:37:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 18:37:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 275 transitions. [2024-06-27 18:37:22,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-27 18:37:22,318 INFO L175 Difference]: Start difference. First operand has 419 places, 558 transitions, 11276 flow. Second operand 15 states and 275 transitions. [2024-06-27 18:37:22,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 639 transitions, 12963 flow [2024-06-27 18:37:25,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 639 transitions, 12310 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-27 18:37:25,548 INFO L231 Difference]: Finished difference. Result has 427 places, 559 transitions, 11157 flow [2024-06-27 18:37:25,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10623, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11157, PETRI_PLACES=427, PETRI_TRANSITIONS=559} [2024-06-27 18:37:25,549 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 386 predicate places. [2024-06-27 18:37:25,549 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 559 transitions, 11157 flow [2024-06-27 18:37:25,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:37:25,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:37:25,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:37:25,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 18:37:25,550 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:37:25,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:37:25,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1490340080, now seen corresponding path program 7 times [2024-06-27 18:37:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:37:25,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336368035] [2024-06-27 18:37:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:37:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:37:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:37:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:37:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:37:26,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336368035] [2024-06-27 18:37:26,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336368035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:37:26,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:37:26,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:37:26,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953417497] [2024-06-27 18:37:26,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:37:26,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:37:26,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:37:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:37:26,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:37:26,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:37:26,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 559 transitions, 11157 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:37:26,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:37:26,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:37:26,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:37:31,500 INFO L124 PetriNetUnfolderBase]: 6537/13598 cut-off events. [2024-06-27 18:37:31,500 INFO L125 PetriNetUnfolderBase]: For 298444/298678 co-relation queries the response was YES. [2024-06-27 18:37:31,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79256 conditions, 13598 events. 6537/13598 cut-off events. For 298444/298678 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 132620 event pairs, 2981 based on Foata normal form. 212/13722 useless extension candidates. Maximal degree in co-relation 79052. Up to 9622 conditions per place. [2024-06-27 18:37:31,711 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 502 selfloop transitions, 116 changer transitions 0/629 dead transitions. [2024-06-27 18:37:31,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 629 transitions, 12847 flow [2024-06-27 18:37:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:37:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:37:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-27 18:37:31,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515970515970516 [2024-06-27 18:37:31,713 INFO L175 Difference]: Start difference. First operand has 427 places, 559 transitions, 11157 flow. Second operand 11 states and 210 transitions. [2024-06-27 18:37:31,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 629 transitions, 12847 flow [2024-06-27 18:37:35,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 629 transitions, 12362 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-27 18:37:35,765 INFO L231 Difference]: Finished difference. Result has 428 places, 562 transitions, 10988 flow [2024-06-27 18:37:35,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10672, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10988, PETRI_PLACES=428, PETRI_TRANSITIONS=562} [2024-06-27 18:37:35,766 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 387 predicate places. [2024-06-27 18:37:35,766 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 562 transitions, 10988 flow [2024-06-27 18:37:35,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:37:35,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:37:35,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:37:35,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 18:37:35,767 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:37:35,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:37:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1351811930, now seen corresponding path program 8 times [2024-06-27 18:37:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:37:35,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523420448] [2024-06-27 18:37:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:37:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:37:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:37:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:37:36,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:37:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523420448] [2024-06-27 18:37:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523420448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:37:36,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:37:36,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:37:36,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578396194] [2024-06-27 18:37:36,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:37:36,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:37:36,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:37:36,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:37:36,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:37:36,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:37:36,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 562 transitions, 10988 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:37:36,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:37:36,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:37:36,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand