./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe031_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe031_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:54:17,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:54:17,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:54:17,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:54:17,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:54:17,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:54:17,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:54:17,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:54:17,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:54:17,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:54:17,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:54:17,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:54:17,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:54:17,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:54:17,718 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:54:17,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:54:17,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:54:17,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:54:17,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:54:17,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:54:17,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:54:17,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:54:17,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:54:17,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:54:17,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:54:17,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:54:17,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:54:17,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:54:17,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:54:17,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:54:17,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:54:17,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:54:17,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:54:17,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:54:17,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:54:17,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:54:17,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:54:17,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:54:17,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:54:17,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:54:17,724 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:54:17,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:54:17,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:54:17,725 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:54:17,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:54:17,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:54:17,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:54:17,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:54:17,948 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:54:17,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-06-27 22:54:18,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:54:19,104 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:54:19,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-06-27 22:54:19,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53f17c7e9/a2ba289e71d84737ad5201734d07f03e/FLAGe34d21d6a [2024-06-27 22:54:19,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53f17c7e9/a2ba289e71d84737ad5201734d07f03e [2024-06-27 22:54:19,126 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:54:19,127 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:54:19,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe031_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-27 22:54:19,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:54:19,198 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:54:19,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:54:19,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:54:19,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:54:19,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:54:19" (1/2) ... [2024-06-27 22:54:19,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc8bb32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:19, skipping insertion in model container [2024-06-27 22:54:19,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:54:19" (1/2) ... [2024-06-27 22:54:19,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ac69711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:19, skipping insertion in model container [2024-06-27 22:54:19,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:19" (2/2) ... [2024-06-27 22:54:19,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc8bb32 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19, skipping insertion in model container [2024-06-27 22:54:19,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:19" (2/2) ... [2024-06-27 22:54:19,208 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:54:19,229 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:54:19,231 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] ! multithreaded || (((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:54:19,231 INFO L97 edCorrectnessWitness]: Location invariant before [L820-L820] ! multithreaded || (((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:54:19,231 INFO L97 edCorrectnessWitness]: Location invariant before [L821-L821] ! multithreaded || (((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:54:19,231 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:54:19,231 INFO L106 edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1; [2024-06-27 22:54:19,268 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:54:19,383 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2024-06-27 22:54:19,525 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:54:19,538 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:54:19,567 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:54:19,641 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:54:19,673 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:54:19,674 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19 WrapperNode [2024-06-27 22:54:19,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:54:19,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:54:19,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:54:19,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:54:19,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,724 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2024-06-27 22:54:19,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:54:19,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:54:19,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:54:19,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:54:19,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,766 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:54:19,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:54:19,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:54:19,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:54:19,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:54:19,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (1/1) ... [2024-06-27 22:54:19,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:54:19,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:54:19,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:54:19,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:54:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:54:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:54:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:54:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:54:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:54:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:54:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:54:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:54:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:54:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:54:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:54:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:54:19,872 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:54:19,983 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:54:19,985 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:54:20,325 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:54:20,325 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:54:20,463 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:54:20,464 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:54:20,464 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:54:20 BoogieIcfgContainer [2024-06-27 22:54:20,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:54:20,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:54:20,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:54:20,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:54:20,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:54:19" (1/4) ... [2024-06-27 22:54:20,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b629519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:54:20, skipping insertion in model container [2024-06-27 22:54:20,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:19" (2/4) ... [2024-06-27 22:54:20,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b629519 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:54:20, skipping insertion in model container [2024-06-27 22:54:20,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:19" (3/4) ... [2024-06-27 22:54:20,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b629519 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:54:20, skipping insertion in model container [2024-06-27 22:54:20,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:54:20" (4/4) ... [2024-06-27 22:54:20,474 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2024-06-27 22:54:20,487 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:54:20,487 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:54:20,487 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:54:20,525 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:54:20,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:54:20,577 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-06-27 22:54:20,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:54:20,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-27 22:54:20,581 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:54:20,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-06-27 22:54:20,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:54:20,604 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;@7ea127e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:54:20,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:54:20,609 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:54:20,609 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:54:20,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:54:20,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:20,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:54:20,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:20,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash 346944903, now seen corresponding path program 1 times [2024-06-27 22:54:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579423766] [2024-06-27 22:54:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:20,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:21,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579423766] [2024-06-27 22:54:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579423766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:21,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:21,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:54:21,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522223530] [2024-06-27 22:54:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:21,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:54:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:21,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:54:21,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:54:21,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:21,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:21,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:21,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:21,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:21,452 INFO L124 PetriNetUnfolderBase]: 614/1124 cut-off events. [2024-06-27 22:54:21,453 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 22:54:21,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 1124 events. 614/1124 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7377 event pairs, 485 based on Foata normal form. 40/1056 useless extension candidates. Maximal degree in co-relation 2092. Up to 915 conditions per place. [2024-06-27 22:54:21,464 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 33 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2024-06-27 22:54:21,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 192 flow [2024-06-27 22:54:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:54:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:54:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-06-27 22:54:21,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7446808510638298 [2024-06-27 22:54:21,475 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 105 transitions. [2024-06-27 22:54:21,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 192 flow [2024-06-27 22:54:21,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:21,482 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 113 flow [2024-06-27 22:54:21,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-27 22:54:21,488 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-06-27 22:54:21,488 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 113 flow [2024-06-27 22:54:21,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:21,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:21,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:21,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:54:21,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:21,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash -551255711, now seen corresponding path program 1 times [2024-06-27 22:54:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072623442] [2024-06-27 22:54:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:21,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072623442] [2024-06-27 22:54:21,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072623442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:21,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:21,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030430961] [2024-06-27 22:54:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:21,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:21,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:21,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:21,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-06-27 22:54:21,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:21,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:21,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-06-27 22:54:21,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:22,194 INFO L124 PetriNetUnfolderBase]: 1109/1973 cut-off events. [2024-06-27 22:54:22,195 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-06-27 22:54:22,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4081 conditions, 1973 events. 1109/1973 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12807 event pairs, 362 based on Foata normal form. 9/1884 useless extension candidates. Maximal degree in co-relation 4068. Up to 1527 conditions per place. [2024-06-27 22:54:22,208 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 60 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2024-06-27 22:54:22,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 355 flow [2024-06-27 22:54:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-27 22:54:22,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-06-27 22:54:22,215 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 113 flow. Second operand 6 states and 180 transitions. [2024-06-27 22:54:22,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 355 flow [2024-06-27 22:54:22,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:54:22,250 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 191 flow [2024-06-27 22:54:22,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-06-27 22:54:22,251 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-06-27 22:54:22,251 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 191 flow [2024-06-27 22:54:22,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:22,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:22,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:22,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:54:22,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:22,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:22,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1165416130, now seen corresponding path program 1 times [2024-06-27 22:54:22,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:22,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463265788] [2024-06-27 22:54:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:22,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463265788] [2024-06-27 22:54:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463265788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:22,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:54:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43910373] [2024-06-27 22:54:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:22,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:54:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:54:22,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:54:22,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 47 [2024-06-27 22:54:22,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:22,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:22,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 47 [2024-06-27 22:54:22,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:22,517 INFO L124 PetriNetUnfolderBase]: 593/1217 cut-off events. [2024-06-27 22:54:22,517 INFO L125 PetriNetUnfolderBase]: For 463/504 co-relation queries the response was YES. [2024-06-27 22:54:22,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 1217 events. 593/1217 cut-off events. For 463/504 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8115 event pairs, 91 based on Foata normal form. 24/1210 useless extension candidates. Maximal degree in co-relation 2466. Up to 718 conditions per place. [2024-06-27 22:54:22,525 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 28 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2024-06-27 22:54:22,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 256 flow [2024-06-27 22:54:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:54:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:54:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-06-27 22:54:22,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7446808510638298 [2024-06-27 22:54:22,527 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 191 flow. Second operand 3 states and 105 transitions. [2024-06-27 22:54:22,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 256 flow [2024-06-27 22:54:22,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 59 transitions, 254 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 22:54:22,530 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 180 flow [2024-06-27 22:54:22,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-06-27 22:54:22,531 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2024-06-27 22:54:22,531 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 180 flow [2024-06-27 22:54:22,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:22,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:22,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:22,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:54:22,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:22,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1165375958, now seen corresponding path program 1 times [2024-06-27 22:54:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:22,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719295549] [2024-06-27 22:54:22,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719295549] [2024-06-27 22:54:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719295549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:22,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:22,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:54:22,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482569199] [2024-06-27 22:54:22,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:22,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:22,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:22,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:22,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:22,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:22,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:22,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:22,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:22,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:23,044 INFO L124 PetriNetUnfolderBase]: 732/1433 cut-off events. [2024-06-27 22:54:23,044 INFO L125 PetriNetUnfolderBase]: For 770/772 co-relation queries the response was YES. [2024-06-27 22:54:23,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 1433 events. 732/1433 cut-off events. For 770/772 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9261 event pairs, 370 based on Foata normal form. 3/1381 useless extension candidates. Maximal degree in co-relation 3164. Up to 1061 conditions per place. [2024-06-27 22:54:23,053 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 39 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2024-06-27 22:54:23,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 318 flow [2024-06-27 22:54:23,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-06-27 22:54:23,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6861702127659575 [2024-06-27 22:54:23,054 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 180 flow. Second operand 4 states and 129 transitions. [2024-06-27 22:54:23,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 318 flow [2024-06-27 22:54:23,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 69 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:23,057 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 214 flow [2024-06-27 22:54:23,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-06-27 22:54:23,059 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-06-27 22:54:23,059 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 214 flow [2024-06-27 22:54:23,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:23,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:23,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:23,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:54:23,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:23,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1320869635, now seen corresponding path program 1 times [2024-06-27 22:54:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:23,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538901479] [2024-06-27 22:54:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:23,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:23,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538901479] [2024-06-27 22:54:23,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538901479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:23,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:23,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:23,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197892580] [2024-06-27 22:54:23,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:23,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:23,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-06-27 22:54:23,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:23,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:23,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-06-27 22:54:23,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:23,742 INFO L124 PetriNetUnfolderBase]: 1125/2067 cut-off events. [2024-06-27 22:54:23,742 INFO L125 PetriNetUnfolderBase]: For 1595/1599 co-relation queries the response was YES. [2024-06-27 22:54:23,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 2067 events. 1125/2067 cut-off events. For 1595/1599 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13744 event pairs, 211 based on Foata normal form. 14/2066 useless extension candidates. Maximal degree in co-relation 5198. Up to 1441 conditions per place. [2024-06-27 22:54:23,756 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 63 selfloop transitions, 12 changer transitions 4/94 dead transitions. [2024-06-27 22:54:23,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 489 flow [2024-06-27 22:54:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-06-27 22:54:23,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.601823708206687 [2024-06-27 22:54:23,758 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 214 flow. Second operand 7 states and 198 transitions. [2024-06-27 22:54:23,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 489 flow [2024-06-27 22:54:23,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 472 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:23,766 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 250 flow [2024-06-27 22:54:23,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-06-27 22:54:23,769 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2024-06-27 22:54:23,772 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 250 flow [2024-06-27 22:54:23,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:23,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:23,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:23,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:54:23,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:23,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1548948415, now seen corresponding path program 2 times [2024-06-27 22:54:23,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870564365] [2024-06-27 22:54:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:24,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:24,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870564365] [2024-06-27 22:54:24,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870564365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:24,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606681990] [2024-06-27 22:54:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:24,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:24,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:24,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-06-27 22:54:24,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:24,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:24,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-06-27 22:54:24,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:24,375 INFO L124 PetriNetUnfolderBase]: 1101/2052 cut-off events. [2024-06-27 22:54:24,375 INFO L125 PetriNetUnfolderBase]: For 2117/2121 co-relation queries the response was YES. [2024-06-27 22:54:24,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 2052 events. 1101/2052 cut-off events. For 2117/2121 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13956 event pairs, 61 based on Foata normal form. 14/2053 useless extension candidates. Maximal degree in co-relation 5336. Up to 1060 conditions per place. [2024-06-27 22:54:24,387 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 60 selfloop transitions, 15 changer transitions 0/90 dead transitions. [2024-06-27 22:54:24,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 498 flow [2024-06-27 22:54:24,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-06-27 22:54:24,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2024-06-27 22:54:24,389 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 250 flow. Second operand 6 states and 174 transitions. [2024-06-27 22:54:24,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 498 flow [2024-06-27 22:54:24,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 471 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:24,392 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 269 flow [2024-06-27 22:54:24,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2024-06-27 22:54:24,393 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2024-06-27 22:54:24,393 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 269 flow [2024-06-27 22:54:24,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:24,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:24,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:24,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:54:24,393 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:24,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:24,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1089076161, now seen corresponding path program 3 times [2024-06-27 22:54:24,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:24,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061531797] [2024-06-27 22:54:24,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061531797] [2024-06-27 22:54:24,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061531797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:24,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:24,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821661143] [2024-06-27 22:54:24,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:24,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:24,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:24,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:24,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:24,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-06-27 22:54:24,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:24,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:24,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-06-27 22:54:24,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:24,918 INFO L124 PetriNetUnfolderBase]: 1081/2020 cut-off events. [2024-06-27 22:54:24,918 INFO L125 PetriNetUnfolderBase]: For 2381/2385 co-relation queries the response was YES. [2024-06-27 22:54:24,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5352 conditions, 2020 events. 1081/2020 cut-off events. For 2381/2385 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13775 event pairs, 53 based on Foata normal form. 14/2021 useless extension candidates. Maximal degree in co-relation 5327. Up to 1208 conditions per place. [2024-06-27 22:54:24,930 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 50 selfloop transitions, 14 changer transitions 0/79 dead transitions. [2024-06-27 22:54:24,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 79 transitions, 445 flow [2024-06-27 22:54:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-06-27 22:54:24,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5780141843971631 [2024-06-27 22:54:24,932 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 269 flow. Second operand 6 states and 163 transitions. [2024-06-27 22:54:24,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 79 transitions, 445 flow [2024-06-27 22:54:24,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 420 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:24,937 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 271 flow [2024-06-27 22:54:24,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-06-27 22:54:24,937 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2024-06-27 22:54:24,937 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 271 flow [2024-06-27 22:54:24,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:24,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:24,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:24,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:54:24,938 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:24,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1022838901, now seen corresponding path program 1 times [2024-06-27 22:54:24,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:24,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203086120] [2024-06-27 22:54:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:25,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:25,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203086120] [2024-06-27 22:54:25,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203086120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:25,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:25,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:25,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640300768] [2024-06-27 22:54:25,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:25,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:25,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:25,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:25,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:25,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:25,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:25,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:25,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:25,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:25,377 INFO L124 PetriNetUnfolderBase]: 991/1894 cut-off events. [2024-06-27 22:54:25,378 INFO L125 PetriNetUnfolderBase]: For 2561/2565 co-relation queries the response was YES. [2024-06-27 22:54:25,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5067 conditions, 1894 events. 991/1894 cut-off events. For 2561/2565 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12793 event pairs, 315 based on Foata normal form. 3/1859 useless extension candidates. Maximal degree in co-relation 5041. Up to 1417 conditions per place. [2024-06-27 22:54:25,389 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 56 selfloop transitions, 12 changer transitions 0/85 dead transitions. [2024-06-27 22:54:25,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 85 transitions, 487 flow [2024-06-27 22:54:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 22:54:25,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6723404255319149 [2024-06-27 22:54:25,405 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 271 flow. Second operand 5 states and 158 transitions. [2024-06-27 22:54:25,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 85 transitions, 487 flow [2024-06-27 22:54:25,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 457 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:25,409 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 301 flow [2024-06-27 22:54:25,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-06-27 22:54:25,410 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2024-06-27 22:54:25,410 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 301 flow [2024-06-27 22:54:25,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:25,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:25,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:25,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:54:25,410 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:25,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:25,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1060138411, now seen corresponding path program 2 times [2024-06-27 22:54:25,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:25,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598595145] [2024-06-27 22:54:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:25,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:25,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 22:54:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:25,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598595145] [2024-06-27 22:54:25,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598595145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:25,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:25,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:25,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798043265] [2024-06-27 22:54:25,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:25,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:25,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:25,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:25,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:25,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:25,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:25,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:25,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:25,857 INFO L124 PetriNetUnfolderBase]: 996/1890 cut-off events. [2024-06-27 22:54:25,857 INFO L125 PetriNetUnfolderBase]: For 2686/2690 co-relation queries the response was YES. [2024-06-27 22:54:25,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5454 conditions, 1890 events. 996/1890 cut-off events. For 2686/2690 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12761 event pairs, 325 based on Foata normal form. 1/1857 useless extension candidates. Maximal degree in co-relation 5428. Up to 1406 conditions per place. [2024-06-27 22:54:25,869 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 52 selfloop transitions, 21 changer transitions 0/90 dead transitions. [2024-06-27 22:54:25,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 549 flow [2024-06-27 22:54:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2024-06-27 22:54:25,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6680851063829787 [2024-06-27 22:54:25,870 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 301 flow. Second operand 5 states and 157 transitions. [2024-06-27 22:54:25,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 549 flow [2024-06-27 22:54:25,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 90 transitions, 521 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:25,874 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 403 flow [2024-06-27 22:54:25,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-06-27 22:54:25,876 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-06-27 22:54:25,876 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 403 flow [2024-06-27 22:54:25,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:25,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:25,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:25,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:54:25,879 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:25,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1060129483, now seen corresponding path program 1 times [2024-06-27 22:54:25,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:25,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490705186] [2024-06-27 22:54:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:25,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490705186] [2024-06-27 22:54:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490705186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36956919] [2024-06-27 22:54:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:26,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:26,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:26,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:26,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:26,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:26,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:26,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:26,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:26,622 INFO L124 PetriNetUnfolderBase]: 929/1785 cut-off events. [2024-06-27 22:54:26,623 INFO L125 PetriNetUnfolderBase]: For 3260/3283 co-relation queries the response was YES. [2024-06-27 22:54:26,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5449 conditions, 1785 events. 929/1785 cut-off events. For 3260/3283 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12066 event pairs, 184 based on Foata normal form. 27/1763 useless extension candidates. Maximal degree in co-relation 5421. Up to 1164 conditions per place. [2024-06-27 22:54:26,637 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 52 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2024-06-27 22:54:26,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 613 flow [2024-06-27 22:54:26,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-06-27 22:54:26,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-06-27 22:54:26,639 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 403 flow. Second operand 6 states and 170 transitions. [2024-06-27 22:54:26,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 613 flow [2024-06-27 22:54:26,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 579 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:26,643 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 416 flow [2024-06-27 22:54:26,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-06-27 22:54:26,645 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2024-06-27 22:54:26,645 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 416 flow [2024-06-27 22:54:26,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:26,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:26,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:26,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:54:26,647 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:26,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -215487244, now seen corresponding path program 1 times [2024-06-27 22:54:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663990297] [2024-06-27 22:54:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:26,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663990297] [2024-06-27 22:54:26,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663990297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:26,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:26,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:26,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68098920] [2024-06-27 22:54:26,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:26,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:26,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:26,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:26,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:27,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:27,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 416 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:27,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:27,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:27,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:27,325 INFO L124 PetriNetUnfolderBase]: 1137/2187 cut-off events. [2024-06-27 22:54:27,326 INFO L125 PetriNetUnfolderBase]: For 4124/4128 co-relation queries the response was YES. [2024-06-27 22:54:27,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 2187 events. 1137/2187 cut-off events. For 4124/4128 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15251 event pairs, 495 based on Foata normal form. 8/2115 useless extension candidates. Maximal degree in co-relation 6811. Up to 1483 conditions per place. [2024-06-27 22:54:27,341 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 77 selfloop transitions, 16 changer transitions 0/110 dead transitions. [2024-06-27 22:54:27,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 110 transitions, 760 flow [2024-06-27 22:54:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-06-27 22:54:27,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6702127659574468 [2024-06-27 22:54:27,343 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 416 flow. Second operand 6 states and 189 transitions. [2024-06-27 22:54:27,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 110 transitions, 760 flow [2024-06-27 22:54:27,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 110 transitions, 727 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:27,349 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 479 flow [2024-06-27 22:54:27,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2024-06-27 22:54:27,350 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-06-27 22:54:27,350 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 479 flow [2024-06-27 22:54:27,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:27,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:27,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:27,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:54:27,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:27,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1009221940, now seen corresponding path program 2 times [2024-06-27 22:54:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252631509] [2024-06-27 22:54:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:27,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252631509] [2024-06-27 22:54:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252631509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:27,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093142843] [2024-06-27 22:54:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:27,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:27,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:27,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 479 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:27,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:27,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:27,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:28,057 INFO L124 PetriNetUnfolderBase]: 1145/2174 cut-off events. [2024-06-27 22:54:28,057 INFO L125 PetriNetUnfolderBase]: For 5752/5756 co-relation queries the response was YES. [2024-06-27 22:54:28,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7337 conditions, 2174 events. 1145/2174 cut-off events. For 5752/5756 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15062 event pairs, 349 based on Foata normal form. 2/2133 useless extension candidates. Maximal degree in co-relation 7307. Up to 1592 conditions per place. [2024-06-27 22:54:28,070 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 57 selfloop transitions, 27 changer transitions 0/101 dead transitions. [2024-06-27 22:54:28,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 749 flow [2024-06-27 22:54:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 22:54:28,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6723404255319149 [2024-06-27 22:54:28,072 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 479 flow. Second operand 5 states and 158 transitions. [2024-06-27 22:54:28,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 101 transitions, 749 flow [2024-06-27 22:54:28,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 727 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:28,082 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 568 flow [2024-06-27 22:54:28,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2024-06-27 22:54:28,083 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2024-06-27 22:54:28,083 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 568 flow [2024-06-27 22:54:28,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:28,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:28,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:28,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:54:28,084 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:28,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1009228884, now seen corresponding path program 1 times [2024-06-27 22:54:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809671284] [2024-06-27 22:54:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:28,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:28,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809671284] [2024-06-27 22:54:28,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809671284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:28,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:28,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728920153] [2024-06-27 22:54:28,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:28,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:28,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:28,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:28,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:28,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 568 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:28,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:28,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:28,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:28,790 INFO L124 PetriNetUnfolderBase]: 1217/2318 cut-off events. [2024-06-27 22:54:28,790 INFO L125 PetriNetUnfolderBase]: For 7559/7563 co-relation queries the response was YES. [2024-06-27 22:54:28,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8274 conditions, 2318 events. 1217/2318 cut-off events. For 7559/7563 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16300 event pairs, 374 based on Foata normal form. 6/2275 useless extension candidates. Maximal degree in co-relation 8242. Up to 1658 conditions per place. [2024-06-27 22:54:28,806 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 70 selfloop transitions, 22 changer transitions 0/109 dead transitions. [2024-06-27 22:54:28,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 109 transitions, 868 flow [2024-06-27 22:54:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-06-27 22:54:28,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-06-27 22:54:28,807 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 568 flow. Second operand 6 states and 186 transitions. [2024-06-27 22:54:28,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 109 transitions, 868 flow [2024-06-27 22:54:28,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 109 transitions, 801 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:28,816 INFO L231 Difference]: Finished difference. Result has 85 places, 82 transitions, 561 flow [2024-06-27 22:54:28,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=561, PETRI_PLACES=85, PETRI_TRANSITIONS=82} [2024-06-27 22:54:28,817 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2024-06-27 22:54:28,817 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 561 flow [2024-06-27 22:54:28,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:28,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:28,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:28,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:54:28,818 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:28,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1017799764, now seen corresponding path program 2 times [2024-06-27 22:54:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:28,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796883061] [2024-06-27 22:54:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:29,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:29,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796883061] [2024-06-27 22:54:29,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796883061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:29,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:29,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:29,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206695430] [2024-06-27 22:54:29,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:29,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:29,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:29,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:29,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:29,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:29,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 561 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:29,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:29,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:29,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:29,451 INFO L124 PetriNetUnfolderBase]: 1326/2533 cut-off events. [2024-06-27 22:54:29,452 INFO L125 PetriNetUnfolderBase]: For 8597/8601 co-relation queries the response was YES. [2024-06-27 22:54:29,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9041 conditions, 2533 events. 1326/2533 cut-off events. For 8597/8601 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18061 event pairs, 382 based on Foata normal form. 6/2484 useless extension candidates. Maximal degree in co-relation 9008. Up to 1629 conditions per place. [2024-06-27 22:54:29,469 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 76 selfloop transitions, 25 changer transitions 0/118 dead transitions. [2024-06-27 22:54:29,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 118 transitions, 940 flow [2024-06-27 22:54:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-06-27 22:54:29,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 22:54:29,471 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 561 flow. Second operand 6 states and 188 transitions. [2024-06-27 22:54:29,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 118 transitions, 940 flow [2024-06-27 22:54:29,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 118 transitions, 894 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:29,481 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 619 flow [2024-06-27 22:54:29,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2024-06-27 22:54:29,482 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2024-06-27 22:54:29,482 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 619 flow [2024-06-27 22:54:29,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:29,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:29,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:29,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:54:29,483 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:29,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2127797844, now seen corresponding path program 1 times [2024-06-27 22:54:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:29,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350171398] [2024-06-27 22:54:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:29,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:29,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350171398] [2024-06-27 22:54:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350171398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:29,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:29,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964429976] [2024-06-27 22:54:29,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:29,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:29,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:29,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:29,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:29,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 619 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:29,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:29,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:29,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:29,960 INFO L124 PetriNetUnfolderBase]: 2296/4113 cut-off events. [2024-06-27 22:54:29,960 INFO L125 PetriNetUnfolderBase]: For 7457/7647 co-relation queries the response was YES. [2024-06-27 22:54:29,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12340 conditions, 4113 events. 2296/4113 cut-off events. For 7457/7647 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 28287 event pairs, 267 based on Foata normal form. 221/4143 useless extension candidates. Maximal degree in co-relation 12305. Up to 1975 conditions per place. [2024-06-27 22:54:29,983 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 80 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2024-06-27 22:54:29,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 121 transitions, 988 flow [2024-06-27 22:54:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-06-27 22:54:29,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7021276595744681 [2024-06-27 22:54:29,985 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 619 flow. Second operand 4 states and 132 transitions. [2024-06-27 22:54:29,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 121 transitions, 988 flow [2024-06-27 22:54:29,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 121 transitions, 956 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:29,992 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 581 flow [2024-06-27 22:54:29,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=581, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2024-06-27 22:54:29,994 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2024-06-27 22:54:29,994 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 581 flow [2024-06-27 22:54:29,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:29,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:29,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:29,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:54:29,995 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:29,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash -967991109, now seen corresponding path program 1 times [2024-06-27 22:54:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:29,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910045516] [2024-06-27 22:54:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:29,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:30,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:30,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910045516] [2024-06-27 22:54:30,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910045516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:30,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:30,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644174978] [2024-06-27 22:54:30,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:30,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:30,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:30,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:30,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:30,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:30,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:30,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:30,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:30,645 INFO L124 PetriNetUnfolderBase]: 1816/3602 cut-off events. [2024-06-27 22:54:30,645 INFO L125 PetriNetUnfolderBase]: For 10964/11073 co-relation queries the response was YES. [2024-06-27 22:54:30,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12805 conditions, 3602 events. 1816/3602 cut-off events. For 10964/11073 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 27323 event pairs, 356 based on Foata normal form. 16/3383 useless extension candidates. Maximal degree in co-relation 12767. Up to 2014 conditions per place. [2024-06-27 22:54:30,670 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 72 selfloop transitions, 20 changer transitions 0/113 dead transitions. [2024-06-27 22:54:30,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 113 transitions, 917 flow [2024-06-27 22:54:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 22:54:30,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6723404255319149 [2024-06-27 22:54:30,671 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 581 flow. Second operand 5 states and 158 transitions. [2024-06-27 22:54:30,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 113 transitions, 917 flow [2024-06-27 22:54:30,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 113 transitions, 915 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:54:30,689 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 683 flow [2024-06-27 22:54:30,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=683, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-06-27 22:54:30,689 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2024-06-27 22:54:30,690 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 683 flow [2024-06-27 22:54:30,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:30,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:30,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:30,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:54:30,690 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:30,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1581786127, now seen corresponding path program 2 times [2024-06-27 22:54:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:30,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870239034] [2024-06-27 22:54:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:30,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:30,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870239034] [2024-06-27 22:54:30,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870239034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:30,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:30,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:30,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089854832] [2024-06-27 22:54:30,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:30,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:30,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:30,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:30,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:30,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:30,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 683 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:30,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:30,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:30,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:31,353 INFO L124 PetriNetUnfolderBase]: 1871/3653 cut-off events. [2024-06-27 22:54:31,353 INFO L125 PetriNetUnfolderBase]: For 13819/13930 co-relation queries the response was YES. [2024-06-27 22:54:31,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13998 conditions, 3653 events. 1871/3653 cut-off events. For 13819/13930 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 27346 event pairs, 374 based on Foata normal form. 12/3419 useless extension candidates. Maximal degree in co-relation 13958. Up to 2016 conditions per place. [2024-06-27 22:54:31,384 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 69 selfloop transitions, 34 changer transitions 0/124 dead transitions. [2024-06-27 22:54:31,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 124 transitions, 1091 flow [2024-06-27 22:54:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-06-27 22:54:31,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 22:54:31,386 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 683 flow. Second operand 6 states and 188 transitions. [2024-06-27 22:54:31,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 124 transitions, 1091 flow [2024-06-27 22:54:31,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 124 transitions, 1043 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:31,414 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 820 flow [2024-06-27 22:54:31,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=820, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2024-06-27 22:54:31,415 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-06-27 22:54:31,415 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 820 flow [2024-06-27 22:54:31,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:31,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:31,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:31,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:54:31,416 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:31,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash -848188417, now seen corresponding path program 3 times [2024-06-27 22:54:31,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:31,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713393061] [2024-06-27 22:54:31,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:31,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:31,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713393061] [2024-06-27 22:54:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713393061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:31,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:31,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083014199] [2024-06-27 22:54:31,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:31,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:31,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:31,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 820 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:31,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:31,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:31,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:32,169 INFO L124 PetriNetUnfolderBase]: 2240/4429 cut-off events. [2024-06-27 22:54:32,169 INFO L125 PetriNetUnfolderBase]: For 21867/22018 co-relation queries the response was YES. [2024-06-27 22:54:32,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17411 conditions, 4429 events. 2240/4429 cut-off events. For 21867/22018 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 35154 event pairs, 391 based on Foata normal form. 34/4171 useless extension candidates. Maximal degree in co-relation 17369. Up to 2071 conditions per place. [2024-06-27 22:54:32,208 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 100 selfloop transitions, 12 changer transitions 0/133 dead transitions. [2024-06-27 22:54:32,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 133 transitions, 1290 flow [2024-06-27 22:54:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-06-27 22:54:32,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-06-27 22:54:32,209 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 820 flow. Second operand 6 states and 186 transitions. [2024-06-27 22:54:32,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 133 transitions, 1290 flow [2024-06-27 22:54:32,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 133 transitions, 1219 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:32,237 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 776 flow [2024-06-27 22:54:32,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2024-06-27 22:54:32,238 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2024-06-27 22:54:32,238 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 776 flow [2024-06-27 22:54:32,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:32,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:32,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:32,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:54:32,238 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:32,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash -933365837, now seen corresponding path program 4 times [2024-06-27 22:54:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:32,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165262552] [2024-06-27 22:54:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:32,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:32,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165262552] [2024-06-27 22:54:32,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165262552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:32,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:32,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:32,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192236556] [2024-06-27 22:54:32,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:32,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:32,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:32,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:32,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:32,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:32,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:32,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:32,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:32,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:32,951 INFO L124 PetriNetUnfolderBase]: 2404/4798 cut-off events. [2024-06-27 22:54:32,952 INFO L125 PetriNetUnfolderBase]: For 23375/23542 co-relation queries the response was YES. [2024-06-27 22:54:32,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18948 conditions, 4798 events. 2404/4798 cut-off events. For 23375/23542 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 38682 event pairs, 459 based on Foata normal form. 17/4479 useless extension candidates. Maximal degree in co-relation 18905. Up to 2496 conditions per place. [2024-06-27 22:54:32,994 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 81 selfloop transitions, 28 changer transitions 0/130 dead transitions. [2024-06-27 22:54:32,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 130 transitions, 1246 flow [2024-06-27 22:54:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-06-27 22:54:32,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-06-27 22:54:32,995 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 776 flow. Second operand 6 states and 183 transitions. [2024-06-27 22:54:32,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 130 transitions, 1246 flow [2024-06-27 22:54:33,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 130 transitions, 1217 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:33,025 INFO L231 Difference]: Finished difference. Result has 105 places, 103 transitions, 957 flow [2024-06-27 22:54:33,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=957, PETRI_PLACES=105, PETRI_TRANSITIONS=103} [2024-06-27 22:54:33,026 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 52 predicate places. [2024-06-27 22:54:33,026 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 103 transitions, 957 flow [2024-06-27 22:54:33,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:33,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:33,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:33,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:54:33,026 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:33,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1385791891, now seen corresponding path program 5 times [2024-06-27 22:54:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26546363] [2024-06-27 22:54:33,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:33,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26546363] [2024-06-27 22:54:33,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26546363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:33,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:33,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918331615] [2024-06-27 22:54:33,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:33,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:33,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:33,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:33,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:33,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:33,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 957 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:33,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:33,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:33,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:33,798 INFO L124 PetriNetUnfolderBase]: 2433/4886 cut-off events. [2024-06-27 22:54:33,798 INFO L125 PetriNetUnfolderBase]: For 30096/30263 co-relation queries the response was YES. [2024-06-27 22:54:33,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20893 conditions, 4886 events. 2433/4886 cut-off events. For 30096/30263 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 39639 event pairs, 1013 based on Foata normal form. 12/4510 useless extension candidates. Maximal degree in co-relation 20849. Up to 3433 conditions per place. [2024-06-27 22:54:33,841 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 84 selfloop transitions, 20 changer transitions 0/125 dead transitions. [2024-06-27 22:54:33,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 125 transitions, 1309 flow [2024-06-27 22:54:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2024-06-27 22:54:33,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.624113475177305 [2024-06-27 22:54:33,842 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 957 flow. Second operand 6 states and 176 transitions. [2024-06-27 22:54:33,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 125 transitions, 1309 flow [2024-06-27 22:54:33,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 125 transitions, 1217 flow, removed 39 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:33,886 INFO L231 Difference]: Finished difference. Result has 109 places, 106 transitions, 969 flow [2024-06-27 22:54:33,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=969, PETRI_PLACES=109, PETRI_TRANSITIONS=106} [2024-06-27 22:54:33,886 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 56 predicate places. [2024-06-27 22:54:33,886 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 106 transitions, 969 flow [2024-06-27 22:54:33,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:33,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:33,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:33,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:54:33,887 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:33,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash -793124461, now seen corresponding path program 6 times [2024-06-27 22:54:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449731807] [2024-06-27 22:54:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:34,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449731807] [2024-06-27 22:54:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449731807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:34,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:34,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:34,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963067674] [2024-06-27 22:54:34,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:34,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:34,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:34,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:34,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:34,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:34,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:34,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:34,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:34,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:34,561 INFO L124 PetriNetUnfolderBase]: 2339/4635 cut-off events. [2024-06-27 22:54:34,561 INFO L125 PetriNetUnfolderBase]: For 27612/27743 co-relation queries the response was YES. [2024-06-27 22:54:34,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19810 conditions, 4635 events. 2339/4635 cut-off events. For 27612/27743 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 37264 event pairs, 636 based on Foata normal form. 7/4291 useless extension candidates. Maximal degree in co-relation 19764. Up to 2379 conditions per place. [2024-06-27 22:54:34,594 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 62 selfloop transitions, 46 changer transitions 0/129 dead transitions. [2024-06-27 22:54:34,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 129 transitions, 1351 flow [2024-06-27 22:54:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-06-27 22:54:34,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6347517730496454 [2024-06-27 22:54:34,595 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 969 flow. Second operand 6 states and 179 transitions. [2024-06-27 22:54:34,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 129 transitions, 1351 flow [2024-06-27 22:54:34,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 129 transitions, 1219 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:34,633 INFO L231 Difference]: Finished difference. Result has 110 places, 109 transitions, 999 flow [2024-06-27 22:54:34,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=999, PETRI_PLACES=110, PETRI_TRANSITIONS=109} [2024-06-27 22:54:34,633 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2024-06-27 22:54:34,633 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 109 transitions, 999 flow [2024-06-27 22:54:34,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:34,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:34,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:34,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:54:34,634 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:34,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash -800285421, now seen corresponding path program 1 times [2024-06-27 22:54:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:34,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259893276] [2024-06-27 22:54:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:34,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:35,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:35,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259893276] [2024-06-27 22:54:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259893276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:35,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:35,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873832507] [2024-06-27 22:54:35,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:35,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:35,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:35,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:35,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:35,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:35,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 109 transitions, 999 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:35,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:35,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:35,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:35,677 INFO L124 PetriNetUnfolderBase]: 2422/4821 cut-off events. [2024-06-27 22:54:35,677 INFO L125 PetriNetUnfolderBase]: For 32166/32330 co-relation queries the response was YES. [2024-06-27 22:54:35,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20839 conditions, 4821 events. 2422/4821 cut-off events. For 32166/32330 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 39120 event pairs, 1147 based on Foata normal form. 14/4438 useless extension candidates. Maximal degree in co-relation 20793. Up to 3291 conditions per place. [2024-06-27 22:54:35,708 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 93 selfloop transitions, 23 changer transitions 0/137 dead transitions. [2024-06-27 22:54:35,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 137 transitions, 1431 flow [2024-06-27 22:54:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-06-27 22:54:35,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6560283687943262 [2024-06-27 22:54:35,709 INFO L175 Difference]: Start difference. First operand has 110 places, 109 transitions, 999 flow. Second operand 6 states and 185 transitions. [2024-06-27 22:54:35,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 137 transitions, 1431 flow [2024-06-27 22:54:35,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 1291 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:35,748 INFO L231 Difference]: Finished difference. Result has 112 places, 110 transitions, 927 flow [2024-06-27 22:54:35,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=927, PETRI_PLACES=112, PETRI_TRANSITIONS=110} [2024-06-27 22:54:35,749 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 59 predicate places. [2024-06-27 22:54:35,749 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 110 transitions, 927 flow [2024-06-27 22:54:35,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:35,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:35,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:35,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:54:35,750 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:35,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:35,750 INFO L85 PathProgramCache]: Analyzing trace with hash -132881034, now seen corresponding path program 1 times [2024-06-27 22:54:35,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:35,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672584392] [2024-06-27 22:54:35,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:35,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:36,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672584392] [2024-06-27 22:54:36,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672584392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:36,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:36,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:36,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800331650] [2024-06-27 22:54:36,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:36,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:36,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:36,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:36,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:36,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 110 transitions, 927 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:36,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:36,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:36,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:36,830 INFO L124 PetriNetUnfolderBase]: 2842/5640 cut-off events. [2024-06-27 22:54:36,830 INFO L125 PetriNetUnfolderBase]: For 40364/40555 co-relation queries the response was YES. [2024-06-27 22:54:36,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24095 conditions, 5640 events. 2842/5640 cut-off events. For 40364/40555 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 46836 event pairs, 876 based on Foata normal form. 32/5230 useless extension candidates. Maximal degree in co-relation 24048. Up to 2663 conditions per place. [2024-06-27 22:54:36,873 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 101 selfloop transitions, 26 changer transitions 0/148 dead transitions. [2024-06-27 22:54:36,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 148 transitions, 1509 flow [2024-06-27 22:54:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-06-27 22:54:36,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6737588652482269 [2024-06-27 22:54:36,874 INFO L175 Difference]: Start difference. First operand has 112 places, 110 transitions, 927 flow. Second operand 6 states and 190 transitions. [2024-06-27 22:54:36,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 148 transitions, 1509 flow [2024-06-27 22:54:36,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 148 transitions, 1463 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:36,907 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 1038 flow [2024-06-27 22:54:36,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1038, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2024-06-27 22:54:36,908 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 62 predicate places. [2024-06-27 22:54:36,908 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 1038 flow [2024-06-27 22:54:36,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:36,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:36,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:36,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:54:36,908 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:36,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:36,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2082600370, now seen corresponding path program 2 times [2024-06-27 22:54:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322424560] [2024-06-27 22:54:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:37,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:37,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322424560] [2024-06-27 22:54:37,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322424560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:37,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:37,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:37,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119014123] [2024-06-27 22:54:37,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:37,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:37,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:37,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:37,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 1038 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:37,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:37,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:37,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:38,129 INFO L124 PetriNetUnfolderBase]: 3159/6281 cut-off events. [2024-06-27 22:54:38,129 INFO L125 PetriNetUnfolderBase]: For 54954/55184 co-relation queries the response was YES. [2024-06-27 22:54:38,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28111 conditions, 6281 events. 3159/6281 cut-off events. For 54954/55184 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 53654 event pairs, 939 based on Foata normal form. 34/5834 useless extension candidates. Maximal degree in co-relation 28062. Up to 3069 conditions per place. [2024-06-27 22:54:38,185 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 90 selfloop transitions, 45 changer transitions 0/156 dead transitions. [2024-06-27 22:54:38,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 156 transitions, 1670 flow [2024-06-27 22:54:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2024-06-27 22:54:38,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717325227963525 [2024-06-27 22:54:38,187 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 1038 flow. Second operand 7 states and 221 transitions. [2024-06-27 22:54:38,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 156 transitions, 1670 flow [2024-06-27 22:54:38,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 156 transitions, 1589 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:38,242 INFO L231 Difference]: Finished difference. Result has 118 places, 116 transitions, 1154 flow [2024-06-27 22:54:38,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1154, PETRI_PLACES=118, PETRI_TRANSITIONS=116} [2024-06-27 22:54:38,243 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 65 predicate places. [2024-06-27 22:54:38,243 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 116 transitions, 1154 flow [2024-06-27 22:54:38,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:38,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:38,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:38,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:54:38,244 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:38,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash 632787702, now seen corresponding path program 1 times [2024-06-27 22:54:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:38,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404140122] [2024-06-27 22:54:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:38,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404140122] [2024-06-27 22:54:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404140122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:38,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:38,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:54:38,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040615589] [2024-06-27 22:54:38,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:38,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:54:38,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:54:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:54:38,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-06-27 22:54:38,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 116 transitions, 1154 flow. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:38,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:38,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-06-27 22:54:38,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:39,603 INFO L124 PetriNetUnfolderBase]: 3995/7907 cut-off events. [2024-06-27 22:54:39,603 INFO L125 PetriNetUnfolderBase]: For 68139/68423 co-relation queries the response was YES. [2024-06-27 22:54:39,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34683 conditions, 7907 events. 3995/7907 cut-off events. For 68139/68423 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 68823 event pairs, 1459 based on Foata normal form. 25/7362 useless extension candidates. Maximal degree in co-relation 34632. Up to 3168 conditions per place. [2024-06-27 22:54:39,672 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 135 selfloop transitions, 26 changer transitions 0/180 dead transitions. [2024-06-27 22:54:39,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 180 transitions, 1936 flow [2024-06-27 22:54:39,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 284 transitions. [2024-06-27 22:54:39,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6042553191489362 [2024-06-27 22:54:39,673 INFO L175 Difference]: Start difference. First operand has 118 places, 116 transitions, 1154 flow. Second operand 10 states and 284 transitions. [2024-06-27 22:54:39,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 180 transitions, 1936 flow [2024-06-27 22:54:39,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 180 transitions, 1817 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:39,744 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 1124 flow [2024-06-27 22:54:39,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1124, PETRI_PLACES=125, PETRI_TRANSITIONS=118} [2024-06-27 22:54:39,744 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 72 predicate places. [2024-06-27 22:54:39,744 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 1124 flow [2024-06-27 22:54:39,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:39,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:39,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:39,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:54:39,745 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:39,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:39,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1195330408, now seen corresponding path program 3 times [2024-06-27 22:54:39,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:39,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957363029] [2024-06-27 22:54:39,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:39,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:40,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:40,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957363029] [2024-06-27 22:54:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957363029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136767375] [2024-06-27 22:54:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:40,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:40,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:40,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 118 transitions, 1124 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:40,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:40,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:40,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:40,983 INFO L124 PetriNetUnfolderBase]: 3611/7212 cut-off events. [2024-06-27 22:54:40,983 INFO L125 PetriNetUnfolderBase]: For 65639/65887 co-relation queries the response was YES. [2024-06-27 22:54:41,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32883 conditions, 7212 events. 3611/7212 cut-off events. For 65639/65887 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 63410 event pairs, 1060 based on Foata normal form. 18/6663 useless extension candidates. Maximal degree in co-relation 32830. Up to 4119 conditions per place. [2024-06-27 22:54:41,038 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 94 selfloop transitions, 35 changer transitions 0/150 dead transitions. [2024-06-27 22:54:41,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 150 transitions, 1698 flow [2024-06-27 22:54:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-06-27 22:54:41,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-06-27 22:54:41,039 INFO L175 Difference]: Start difference. First operand has 125 places, 118 transitions, 1124 flow. Second operand 6 states and 183 transitions. [2024-06-27 22:54:41,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 150 transitions, 1698 flow [2024-06-27 22:54:41,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 150 transitions, 1612 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-27 22:54:41,099 INFO L231 Difference]: Finished difference. Result has 125 places, 123 transitions, 1280 flow [2024-06-27 22:54:41,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1280, PETRI_PLACES=125, PETRI_TRANSITIONS=123} [2024-06-27 22:54:41,099 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 72 predicate places. [2024-06-27 22:54:41,099 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 123 transitions, 1280 flow [2024-06-27 22:54:41,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:41,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:41,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:41,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:54:41,100 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:41,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1402845592, now seen corresponding path program 2 times [2024-06-27 22:54:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:41,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71321421] [2024-06-27 22:54:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:41,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:41,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:41,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71321421] [2024-06-27 22:54:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71321421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:41,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:41,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782048418] [2024-06-27 22:54:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:41,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:41,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:41,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:41,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 123 transitions, 1280 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:41,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:41,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:41,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:42,343 INFO L124 PetriNetUnfolderBase]: 3890/7797 cut-off events. [2024-06-27 22:54:42,343 INFO L125 PetriNetUnfolderBase]: For 85002/85278 co-relation queries the response was YES. [2024-06-27 22:54:42,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36416 conditions, 7797 events. 3890/7797 cut-off events. For 85002/85278 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 69679 event pairs, 1141 based on Foata normal form. 32/7191 useless extension candidates. Maximal degree in co-relation 36364. Up to 4248 conditions per place. [2024-06-27 22:54:42,406 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 110 selfloop transitions, 28 changer transitions 0/159 dead transitions. [2024-06-27 22:54:42,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 159 transitions, 1844 flow [2024-06-27 22:54:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2024-06-27 22:54:42,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6443768996960486 [2024-06-27 22:54:42,407 INFO L175 Difference]: Start difference. First operand has 125 places, 123 transitions, 1280 flow. Second operand 7 states and 212 transitions. [2024-06-27 22:54:42,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 159 transitions, 1844 flow [2024-06-27 22:54:42,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 159 transitions, 1740 flow, removed 45 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:42,514 INFO L231 Difference]: Finished difference. Result has 130 places, 123 transitions, 1235 flow [2024-06-27 22:54:42,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1235, PETRI_PLACES=130, PETRI_TRANSITIONS=123} [2024-06-27 22:54:42,515 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 77 predicate places. [2024-06-27 22:54:42,515 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 123 transitions, 1235 flow [2024-06-27 22:54:42,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:42,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:42,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:42,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:54:42,516 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:42,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1336991318, now seen corresponding path program 3 times [2024-06-27 22:54:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86604282] [2024-06-27 22:54:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:42,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:42,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86604282] [2024-06-27 22:54:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86604282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:42,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:42,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:42,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197798604] [2024-06-27 22:54:42,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:42,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:42,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:42,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:42,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:42,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:42,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 123 transitions, 1235 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:42,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:42,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:42,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:43,881 INFO L124 PetriNetUnfolderBase]: 4548/9297 cut-off events. [2024-06-27 22:54:43,881 INFO L125 PetriNetUnfolderBase]: For 87973/88278 co-relation queries the response was YES. [2024-06-27 22:54:43,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41132 conditions, 9297 events. 4548/9297 cut-off events. For 87973/88278 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 87105 event pairs, 1485 based on Foata normal form. 35/8515 useless extension candidates. Maximal degree in co-relation 41078. Up to 3821 conditions per place. [2024-06-27 22:54:43,970 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 114 selfloop transitions, 28 changer transitions 0/163 dead transitions. [2024-06-27 22:54:43,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 163 transitions, 1885 flow [2024-06-27 22:54:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2024-06-27 22:54:43,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6474164133738601 [2024-06-27 22:54:43,971 INFO L175 Difference]: Start difference. First operand has 130 places, 123 transitions, 1235 flow. Second operand 7 states and 213 transitions. [2024-06-27 22:54:43,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 163 transitions, 1885 flow [2024-06-27 22:54:44,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 163 transitions, 1830 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:44,060 INFO L231 Difference]: Finished difference. Result has 132 places, 123 transitions, 1239 flow [2024-06-27 22:54:44,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1239, PETRI_PLACES=132, PETRI_TRANSITIONS=123} [2024-06-27 22:54:44,061 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 79 predicate places. [2024-06-27 22:54:44,061 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 123 transitions, 1239 flow [2024-06-27 22:54:44,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:44,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:44,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:44,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:54:44,061 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:44,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash -575708362, now seen corresponding path program 4 times [2024-06-27 22:54:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353963662] [2024-06-27 22:54:44,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:44,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:44,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353963662] [2024-06-27 22:54:44,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353963662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:44,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:44,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:44,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381090637] [2024-06-27 22:54:44,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:44,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:44,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:44,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:44,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:44,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 123 transitions, 1239 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:44,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:44,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:44,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:45,502 INFO L124 PetriNetUnfolderBase]: 4608/9070 cut-off events. [2024-06-27 22:54:45,502 INFO L125 PetriNetUnfolderBase]: For 89880/90151 co-relation queries the response was YES. [2024-06-27 22:54:45,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41146 conditions, 9070 events. 4608/9070 cut-off events. For 89880/90151 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 82968 event pairs, 1196 based on Foata normal form. 16/8450 useless extension candidates. Maximal degree in co-relation 41091. Up to 5227 conditions per place. [2024-06-27 22:54:45,572 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 71 selfloop transitions, 58 changer transitions 0/150 dead transitions. [2024-06-27 22:54:45,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 150 transitions, 1797 flow [2024-06-27 22:54:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-06-27 22:54:45,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6453900709219859 [2024-06-27 22:54:45,574 INFO L175 Difference]: Start difference. First operand has 132 places, 123 transitions, 1239 flow. Second operand 6 states and 182 transitions. [2024-06-27 22:54:45,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 150 transitions, 1797 flow [2024-06-27 22:54:45,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 150 transitions, 1747 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:45,661 INFO L231 Difference]: Finished difference. Result has 135 places, 127 transitions, 1453 flow [2024-06-27 22:54:45,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1453, PETRI_PLACES=135, PETRI_TRANSITIONS=127} [2024-06-27 22:54:45,661 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 82 predicate places. [2024-06-27 22:54:45,662 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 127 transitions, 1453 flow [2024-06-27 22:54:45,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:45,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:45,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:45,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:54:45,662 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:45,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:45,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1949144846, now seen corresponding path program 5 times [2024-06-27 22:54:45,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:45,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295538180] [2024-06-27 22:54:45,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:45,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:46,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295538180] [2024-06-27 22:54:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295538180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:46,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:46,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747798252] [2024-06-27 22:54:46,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:46,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:46,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:46,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:46,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:46,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:46,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 127 transitions, 1453 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:46,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:46,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:46,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:47,442 INFO L124 PetriNetUnfolderBase]: 4880/9952 cut-off events. [2024-06-27 22:54:47,442 INFO L125 PetriNetUnfolderBase]: For 111579/111908 co-relation queries the response was YES. [2024-06-27 22:54:47,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46253 conditions, 9952 events. 4880/9952 cut-off events. For 111579/111908 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 94355 event pairs, 2791 based on Foata normal form. 37/9088 useless extension candidates. Maximal degree in co-relation 46196. Up to 6563 conditions per place. [2024-06-27 22:54:47,541 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 115 selfloop transitions, 21 changer transitions 0/157 dead transitions. [2024-06-27 22:54:47,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 157 transitions, 1965 flow [2024-06-27 22:54:47,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2024-06-27 22:54:47,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6322188449848024 [2024-06-27 22:54:47,542 INFO L175 Difference]: Start difference. First operand has 135 places, 127 transitions, 1453 flow. Second operand 7 states and 208 transitions. [2024-06-27 22:54:47,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 157 transitions, 1965 flow [2024-06-27 22:54:47,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 157 transitions, 1805 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:47,683 INFO L231 Difference]: Finished difference. Result has 140 places, 127 transitions, 1350 flow [2024-06-27 22:54:47,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1350, PETRI_PLACES=140, PETRI_TRANSITIONS=127} [2024-06-27 22:54:47,684 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 87 predicate places. [2024-06-27 22:54:47,684 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 127 transitions, 1350 flow [2024-06-27 22:54:47,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:47,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:47,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:47,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:54:47,684 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:47,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -212053582, now seen corresponding path program 4 times [2024-06-27 22:54:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779291005] [2024-06-27 22:54:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:47,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:48,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:48,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779291005] [2024-06-27 22:54:48,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779291005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:48,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:48,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:48,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968154431] [2024-06-27 22:54:48,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:48,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:48,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:48,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:48,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:48,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:48,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 127 transitions, 1350 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:48,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:48,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:48,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:49,429 INFO L124 PetriNetUnfolderBase]: 5878/11733 cut-off events. [2024-06-27 22:54:49,429 INFO L125 PetriNetUnfolderBase]: For 129049/129405 co-relation queries the response was YES. [2024-06-27 22:54:49,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52305 conditions, 11733 events. 5878/11733 cut-off events. For 129049/129405 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 113418 event pairs, 2057 based on Foata normal form. 32/10802 useless extension candidates. Maximal degree in co-relation 52246. Up to 5640 conditions per place. [2024-06-27 22:54:49,539 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 96 selfloop transitions, 46 changer transitions 0/163 dead transitions. [2024-06-27 22:54:49,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 163 transitions, 2006 flow [2024-06-27 22:54:49,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2024-06-27 22:54:49,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6474164133738601 [2024-06-27 22:54:49,540 INFO L175 Difference]: Start difference. First operand has 140 places, 127 transitions, 1350 flow. Second operand 7 states and 213 transitions. [2024-06-27 22:54:49,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 163 transitions, 2006 flow [2024-06-27 22:54:49,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 163 transitions, 1939 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:49,697 INFO L231 Difference]: Finished difference. Result has 142 places, 127 transitions, 1378 flow [2024-06-27 22:54:49,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1378, PETRI_PLACES=142, PETRI_TRANSITIONS=127} [2024-06-27 22:54:49,698 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 89 predicate places. [2024-06-27 22:54:49,698 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 127 transitions, 1378 flow [2024-06-27 22:54:49,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:49,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:49,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:49,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:54:49,699 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:49,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1940567022, now seen corresponding path program 5 times [2024-06-27 22:54:49,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:49,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094496856] [2024-06-27 22:54:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:49,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:49,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094496856] [2024-06-27 22:54:49,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094496856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:49,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:49,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765240940] [2024-06-27 22:54:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:49,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:49,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:50,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:50,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 127 transitions, 1378 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:50,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:50,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:50,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:51,505 INFO L124 PetriNetUnfolderBase]: 6168/12646 cut-off events. [2024-06-27 22:54:51,506 INFO L125 PetriNetUnfolderBase]: For 137300/137729 co-relation queries the response was YES. [2024-06-27 22:54:51,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56732 conditions, 12646 events. 6168/12646 cut-off events. For 137300/137729 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 125665 event pairs, 3735 based on Foata normal form. 34/11479 useless extension candidates. Maximal degree in co-relation 56672. Up to 8100 conditions per place. [2024-06-27 22:54:51,625 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 123 selfloop transitions, 21 changer transitions 0/165 dead transitions. [2024-06-27 22:54:51,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 165 transitions, 1982 flow [2024-06-27 22:54:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:54:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:54:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2024-06-27 22:54:51,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-06-27 22:54:51,627 INFO L175 Difference]: Start difference. First operand has 142 places, 127 transitions, 1378 flow. Second operand 8 states and 235 transitions. [2024-06-27 22:54:51,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 165 transitions, 1982 flow [2024-06-27 22:54:51,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 165 transitions, 1891 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:51,794 INFO L231 Difference]: Finished difference. Result has 146 places, 128 transitions, 1347 flow [2024-06-27 22:54:51,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1347, PETRI_PLACES=146, PETRI_TRANSITIONS=128} [2024-06-27 22:54:51,795 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 93 predicate places. [2024-06-27 22:54:51,795 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 128 transitions, 1347 flow [2024-06-27 22:54:51,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:51,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:51,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:51,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:54:51,795 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:51,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1983356494, now seen corresponding path program 6 times [2024-06-27 22:54:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:51,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370433988] [2024-06-27 22:54:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:52,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:52,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370433988] [2024-06-27 22:54:52,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370433988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:52,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:52,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501698296] [2024-06-27 22:54:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:52,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:52,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:52,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 128 transitions, 1347 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:52,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:52,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:52,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:53,490 INFO L124 PetriNetUnfolderBase]: 5957/11942 cut-off events. [2024-06-27 22:54:53,490 INFO L125 PetriNetUnfolderBase]: For 125046/125425 co-relation queries the response was YES. [2024-06-27 22:54:53,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53055 conditions, 11942 events. 5957/11942 cut-off events. For 125046/125425 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 116294 event pairs, 2285 based on Foata normal form. 29/10911 useless extension candidates. Maximal degree in co-relation 52993. Up to 7217 conditions per place. [2024-06-27 22:54:53,621 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 90 selfloop transitions, 46 changer transitions 0/157 dead transitions. [2024-06-27 22:54:53,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 157 transitions, 1845 flow [2024-06-27 22:54:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2024-06-27 22:54:53,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6322188449848024 [2024-06-27 22:54:53,629 INFO L175 Difference]: Start difference. First operand has 146 places, 128 transitions, 1347 flow. Second operand 7 states and 208 transitions. [2024-06-27 22:54:53,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 157 transitions, 1845 flow [2024-06-27 22:54:53,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 157 transitions, 1803 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:53,788 INFO L231 Difference]: Finished difference. Result has 148 places, 128 transitions, 1400 flow [2024-06-27 22:54:53,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1400, PETRI_PLACES=148, PETRI_TRANSITIONS=128} [2024-06-27 22:54:53,788 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 95 predicate places. [2024-06-27 22:54:53,788 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 128 transitions, 1400 flow [2024-06-27 22:54:53,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:53,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:53,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:53,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:54:53,789 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:53,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1729804722, now seen corresponding path program 7 times [2024-06-27 22:54:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:53,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785579538] [2024-06-27 22:54:53,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785579538] [2024-06-27 22:54:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785579538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:54,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861725628] [2024-06-27 22:54:54,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:54,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:54,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:54,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:54,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:54,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 128 transitions, 1400 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:54,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:54,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:54,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:55,771 INFO L124 PetriNetUnfolderBase]: 6253/12803 cut-off events. [2024-06-27 22:54:55,771 INFO L125 PetriNetUnfolderBase]: For 134906/135341 co-relation queries the response was YES. [2024-06-27 22:54:55,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56995 conditions, 12803 events. 6253/12803 cut-off events. For 134906/135341 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 127027 event pairs, 3632 based on Foata normal form. 34/11601 useless extension candidates. Maximal degree in co-relation 56932. Up to 8384 conditions per place. [2024-06-27 22:54:55,907 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 122 selfloop transitions, 21 changer transitions 0/164 dead transitions. [2024-06-27 22:54:55,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 164 transitions, 2028 flow [2024-06-27 22:54:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-06-27 22:54:55,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-06-27 22:54:55,909 INFO L175 Difference]: Start difference. First operand has 148 places, 128 transitions, 1400 flow. Second operand 7 states and 210 transitions. [2024-06-27 22:54:55,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 164 transitions, 2028 flow [2024-06-27 22:54:56,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 164 transitions, 1937 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:56,126 INFO L231 Difference]: Finished difference. Result has 150 places, 128 transitions, 1354 flow [2024-06-27 22:54:56,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1354, PETRI_PLACES=150, PETRI_TRANSITIONS=128} [2024-06-27 22:54:56,126 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 97 predicate places. [2024-06-27 22:54:56,126 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 128 transitions, 1354 flow [2024-06-27 22:54:56,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:56,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:56,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:56,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:54:56,127 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:56,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1590533138, now seen corresponding path program 8 times [2024-06-27 22:54:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479616255] [2024-06-27 22:54:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479616255] [2024-06-27 22:54:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479616255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211519207] [2024-06-27 22:54:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:56,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:56,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:56,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 128 transitions, 1354 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:56,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:56,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:56,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:58,021 INFO L124 PetriNetUnfolderBase]: 6711/13777 cut-off events. [2024-06-27 22:54:58,021 INFO L125 PetriNetUnfolderBase]: For 142038/142470 co-relation queries the response was YES. [2024-06-27 22:54:58,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59229 conditions, 13777 events. 6711/13777 cut-off events. For 142038/142470 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 139528 event pairs, 2372 based on Foata normal form. 32/12588 useless extension candidates. Maximal degree in co-relation 59165. Up to 3799 conditions per place. [2024-06-27 22:54:58,149 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 100 selfloop transitions, 47 changer transitions 0/168 dead transitions. [2024-06-27 22:54:58,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 168 transitions, 2044 flow [2024-06-27 22:54:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2024-06-27 22:54:58,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6504559270516718 [2024-06-27 22:54:58,151 INFO L175 Difference]: Start difference. First operand has 150 places, 128 transitions, 1354 flow. Second operand 7 states and 214 transitions. [2024-06-27 22:54:58,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 168 transitions, 2044 flow [2024-06-27 22:54:58,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 168 transitions, 1983 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 22:54:58,324 INFO L231 Difference]: Finished difference. Result has 151 places, 128 transitions, 1390 flow [2024-06-27 22:54:58,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1390, PETRI_PLACES=151, PETRI_TRANSITIONS=128} [2024-06-27 22:54:58,325 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 98 predicate places. [2024-06-27 22:54:58,325 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 128 transitions, 1390 flow [2024-06-27 22:54:58,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:58,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:58,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:58,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:54:58,326 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:58,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash -170859471, now seen corresponding path program 1 times [2024-06-27 22:54:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977028960] [2024-06-27 22:54:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:58,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:58,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977028960] [2024-06-27 22:54:58,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977028960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:58,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:58,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:54:58,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2586002] [2024-06-27 22:54:58,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:58,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:54:58,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:58,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:54:58,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:54:58,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-06-27 22:54:58,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 128 transitions, 1390 flow. Second operand has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:58,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:58,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-06-27 22:54:58,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:00,516 INFO L124 PetriNetUnfolderBase]: 6841/14025 cut-off events. [2024-06-27 22:55:00,516 INFO L125 PetriNetUnfolderBase]: For 140220/140703 co-relation queries the response was YES. [2024-06-27 22:55:00,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61241 conditions, 14025 events. 6841/14025 cut-off events. For 140220/140703 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 142263 event pairs, 3491 based on Foata normal form. 32/12673 useless extension candidates. Maximal degree in co-relation 61177. Up to 8194 conditions per place. [2024-06-27 22:55:00,627 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 108 selfloop transitions, 36 changer transitions 0/164 dead transitions. [2024-06-27 22:55:00,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 164 transitions, 1978 flow [2024-06-27 22:55:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:55:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:55:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 225 transitions. [2024-06-27 22:55:00,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.598404255319149 [2024-06-27 22:55:00,628 INFO L175 Difference]: Start difference. First operand has 151 places, 128 transitions, 1390 flow. Second operand 8 states and 225 transitions. [2024-06-27 22:55:00,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 164 transitions, 1978 flow [2024-06-27 22:55:00,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 164 transitions, 1883 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 22:55:00,802 INFO L231 Difference]: Finished difference. Result has 154 places, 128 transitions, 1371 flow [2024-06-27 22:55:00,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1371, PETRI_PLACES=154, PETRI_TRANSITIONS=128} [2024-06-27 22:55:00,802 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 101 predicate places. [2024-06-27 22:55:00,802 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 128 transitions, 1371 flow [2024-06-27 22:55:00,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:00,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:00,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:00,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:55:00,803 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:00,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2146563275, now seen corresponding path program 2 times [2024-06-27 22:55:00,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:00,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825069156] [2024-06-27 22:55:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:01,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:01,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825069156] [2024-06-27 22:55:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825069156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:01,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:01,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:55:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162938290] [2024-06-27 22:55:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:01,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:55:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:55:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:55:01,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-06-27 22:55:01,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 128 transitions, 1371 flow. Second operand has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:01,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:01,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-06-27 22:55:01,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:03,099 INFO L124 PetriNetUnfolderBase]: 6989/14282 cut-off events. [2024-06-27 22:55:03,099 INFO L125 PetriNetUnfolderBase]: For 142213/142691 co-relation queries the response was YES. [2024-06-27 22:55:03,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61693 conditions, 14282 events. 6989/14282 cut-off events. For 142213/142691 co-relation queries the response was YES. Maximal size of possible extension queue 1216. Compared 145079 event pairs, 3279 based on Foata normal form. 32/12974 useless extension candidates. Maximal degree in co-relation 61627. Up to 5936 conditions per place. [2024-06-27 22:55:03,220 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 113 selfloop transitions, 36 changer transitions 0/169 dead transitions. [2024-06-27 22:55:03,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 169 transitions, 2059 flow [2024-06-27 22:55:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:55:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:55:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2024-06-27 22:55:03,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.601063829787234 [2024-06-27 22:55:03,221 INFO L175 Difference]: Start difference. First operand has 154 places, 128 transitions, 1371 flow. Second operand 8 states and 226 transitions. [2024-06-27 22:55:03,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 169 transitions, 2059 flow [2024-06-27 22:55:03,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 169 transitions, 1980 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-27 22:55:03,402 INFO L231 Difference]: Finished difference. Result has 155 places, 129 transitions, 1388 flow [2024-06-27 22:55:03,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1388, PETRI_PLACES=155, PETRI_TRANSITIONS=129} [2024-06-27 22:55:03,402 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 102 predicate places. [2024-06-27 22:55:03,403 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 129 transitions, 1388 flow [2024-06-27 22:55:03,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:03,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:03,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:03,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:55:03,403 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:03,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2082178567, now seen corresponding path program 3 times [2024-06-27 22:55:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:03,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795977430] [2024-06-27 22:55:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:03,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:03,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795977430] [2024-06-27 22:55:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795977430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:03,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:55:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319035058] [2024-06-27 22:55:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:03,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:55:03,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:03,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:55:03,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:55:03,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:55:03,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 129 transitions, 1388 flow. Second operand has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:03,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:03,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:55:03,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:05,744 INFO L124 PetriNetUnfolderBase]: 7145/14558 cut-off events. [2024-06-27 22:55:05,744 INFO L125 PetriNetUnfolderBase]: For 148059/148535 co-relation queries the response was YES. [2024-06-27 22:55:05,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62615 conditions, 14558 events. 7145/14558 cut-off events. For 148059/148535 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 148356 event pairs, 2869 based on Foata normal form. 26/13309 useless extension candidates. Maximal degree in co-relation 62550. Up to 8373 conditions per place. [2024-06-27 22:55:05,889 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 81 selfloop transitions, 58 changer transitions 0/160 dead transitions. [2024-06-27 22:55:05,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 160 transitions, 1896 flow [2024-06-27 22:55:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:55:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:55:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-06-27 22:55:05,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-06-27 22:55:05,890 INFO L175 Difference]: Start difference. First operand has 155 places, 129 transitions, 1388 flow. Second operand 7 states and 210 transitions. [2024-06-27 22:55:05,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 160 transitions, 1896 flow [2024-06-27 22:55:06,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 160 transitions, 1833 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 22:55:06,129 INFO L231 Difference]: Finished difference. Result has 156 places, 129 transitions, 1445 flow [2024-06-27 22:55:06,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1445, PETRI_PLACES=156, PETRI_TRANSITIONS=129} [2024-06-27 22:55:06,130 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 103 predicate places. [2024-06-27 22:55:06,130 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 129 transitions, 1445 flow [2024-06-27 22:55:06,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:06,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:06,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:06,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:55:06,131 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:06,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash 303821553, now seen corresponding path program 4 times [2024-06-27 22:55:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:06,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595189441] [2024-06-27 22:55:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:06,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:06,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:06,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595189441] [2024-06-27 22:55:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595189441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:06,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:55:06,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936541887] [2024-06-27 22:55:06,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:06,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:55:06,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:06,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:55:06,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:55:06,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-06-27 22:55:06,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 129 transitions, 1445 flow. Second operand has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:06,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:06,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-06-27 22:55:06,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:08,793 INFO L124 PetriNetUnfolderBase]: 7232/15005 cut-off events. [2024-06-27 22:55:08,793 INFO L125 PetriNetUnfolderBase]: For 135751/136225 co-relation queries the response was YES. [2024-06-27 22:55:08,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63494 conditions, 15005 events. 7232/15005 cut-off events. For 135751/136225 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 155407 event pairs, 3040 based on Foata normal form. 27/13644 useless extension candidates. Maximal degree in co-relation 63429. Up to 6534 conditions per place. [2024-06-27 22:55:08,989 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 85 selfloop transitions, 59 changer transitions 0/164 dead transitions. [2024-06-27 22:55:08,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 164 transitions, 1977 flow [2024-06-27 22:55:08,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:55:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:55:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 225 transitions. [2024-06-27 22:55:08,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.598404255319149 [2024-06-27 22:55:08,990 INFO L175 Difference]: Start difference. First operand has 156 places, 129 transitions, 1445 flow. Second operand 8 states and 225 transitions. [2024-06-27 22:55:08,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 164 transitions, 1977 flow [2024-06-27 22:55:09,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 164 transitions, 1792 flow, removed 0 selfloop flow, removed 23 redundant places. [2024-06-27 22:55:09,179 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 1308 flow [2024-06-27 22:55:09,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1308, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2024-06-27 22:55:09,180 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 86 predicate places. [2024-06-27 22:55:09,180 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 1308 flow [2024-06-27 22:55:09,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:09,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:09,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:09,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:55:09,181 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:09,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash 278269775, now seen corresponding path program 1 times [2024-06-27 22:55:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:09,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222717448] [2024-06-27 22:55:09,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:09,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222717448] [2024-06-27 22:55:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222717448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:55:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51881431] [2024-06-27 22:55:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:09,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:55:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:55:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:55:09,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:55:09,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 1308 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:09,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:09,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:55:09,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:10,740 INFO L124 PetriNetUnfolderBase]: 9548/17057 cut-off events. [2024-06-27 22:55:10,741 INFO L125 PetriNetUnfolderBase]: For 119254/121016 co-relation queries the response was YES. [2024-06-27 22:55:10,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66958 conditions, 17057 events. 9548/17057 cut-off events. For 119254/121016 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 148228 event pairs, 851 based on Foata normal form. 877/17142 useless extension candidates. Maximal degree in co-relation 66913. Up to 7361 conditions per place. [2024-06-27 22:55:10,841 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 144 selfloop transitions, 8 changer transitions 0/189 dead transitions. [2024-06-27 22:55:10,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 189 transitions, 2231 flow [2024-06-27 22:55:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:55:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:55:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-06-27 22:55:10,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7106382978723405 [2024-06-27 22:55:10,842 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 1308 flow. Second operand 5 states and 167 transitions. [2024-06-27 22:55:10,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 189 transitions, 2231 flow [2024-06-27 22:55:10,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 189 transitions, 1945 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-27 22:55:10,935 INFO L231 Difference]: Finished difference. Result has 132 places, 113 transitions, 986 flow [2024-06-27 22:55:10,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=986, PETRI_PLACES=132, PETRI_TRANSITIONS=113} [2024-06-27 22:55:10,936 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 79 predicate places. [2024-06-27 22:55:10,936 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 113 transitions, 986 flow [2024-06-27 22:55:10,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:10,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:10,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:10,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:55:10,936 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:10,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:10,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1106591814, now seen corresponding path program 1 times [2024-06-27 22:55:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:10,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574286783] [2024-06-27 22:55:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:10,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:11,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574286783] [2024-06-27 22:55:11,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574286783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:11,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:11,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:55:11,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442879439] [2024-06-27 22:55:11,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:11,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:55:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:11,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:55:11,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:55:11,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:55:11,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 113 transitions, 986 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:11,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:11,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:55:11,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:11,902 INFO L124 PetriNetUnfolderBase]: 6402/11217 cut-off events. [2024-06-27 22:55:11,902 INFO L125 PetriNetUnfolderBase]: For 59963/62762 co-relation queries the response was YES. [2024-06-27 22:55:11,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44635 conditions, 11217 events. 6402/11217 cut-off events. For 59963/62762 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 89960 event pairs, 500 based on Foata normal form. 658/11473 useless extension candidates. Maximal degree in co-relation 44594. Up to 4168 conditions per place. [2024-06-27 22:55:11,966 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 118 selfloop transitions, 11 changer transitions 0/166 dead transitions. [2024-06-27 22:55:11,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 166 transitions, 1625 flow [2024-06-27 22:55:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:55:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:55:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-06-27 22:55:11,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6631205673758865 [2024-06-27 22:55:11,969 INFO L175 Difference]: Start difference. First operand has 132 places, 113 transitions, 986 flow. Second operand 6 states and 187 transitions. [2024-06-27 22:55:11,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 166 transitions, 1625 flow [2024-06-27 22:55:12,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 166 transitions, 1403 flow, removed 41 selfloop flow, removed 9 redundant places. [2024-06-27 22:55:12,050 INFO L231 Difference]: Finished difference. Result has 130 places, 102 transitions, 720 flow [2024-06-27 22:55:12,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=720, PETRI_PLACES=130, PETRI_TRANSITIONS=102} [2024-06-27 22:55:12,051 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 77 predicate places. [2024-06-27 22:55:12,051 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 102 transitions, 720 flow [2024-06-27 22:55:12,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:12,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:12,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:12,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:55:12,052 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:12,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash 521349609, now seen corresponding path program 1 times [2024-06-27 22:55:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456256381] [2024-06-27 22:55:12,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:12,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:12,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456256381] [2024-06-27 22:55:12,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456256381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:12,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:12,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:55:12,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151002095] [2024-06-27 22:55:12,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:12,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:55:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:12,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:55:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:55:12,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:55:12,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 102 transitions, 720 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:12,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:12,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:55:12,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:13,351 INFO L124 PetriNetUnfolderBase]: 6356/13085 cut-off events. [2024-06-27 22:55:13,351 INFO L125 PetriNetUnfolderBase]: For 37720/39256 co-relation queries the response was YES. [2024-06-27 22:55:13,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41051 conditions, 13085 events. 6356/13085 cut-off events. For 37720/39256 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 128666 event pairs, 2339 based on Foata normal form. 321/12066 useless extension candidates. Maximal degree in co-relation 41015. Up to 4341 conditions per place. [2024-06-27 22:55:13,426 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 61 selfloop transitions, 6 changer transitions 64/160 dead transitions. [2024-06-27 22:55:13,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 160 transitions, 1369 flow [2024-06-27 22:55:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:55:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:55:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2024-06-27 22:55:13,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2024-06-27 22:55:13,427 INFO L175 Difference]: Start difference. First operand has 130 places, 102 transitions, 720 flow. Second operand 6 states and 178 transitions. [2024-06-27 22:55:13,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 160 transitions, 1369 flow [2024-06-27 22:55:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 160 transitions, 1345 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 22:55:13,558 INFO L231 Difference]: Finished difference. Result has 136 places, 81 transitions, 564 flow [2024-06-27 22:55:13,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=564, PETRI_PLACES=136, PETRI_TRANSITIONS=81} [2024-06-27 22:55:13,561 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 83 predicate places. [2024-06-27 22:55:13,561 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 81 transitions, 564 flow [2024-06-27 22:55:13,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:13,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:13,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:13,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:55:13,561 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:13,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:13,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1387404515, now seen corresponding path program 2 times [2024-06-27 22:55:13,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:13,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610866835] [2024-06-27 22:55:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:13,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:13,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610866835] [2024-06-27 22:55:13,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610866835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:13,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:13,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:55:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753250696] [2024-06-27 22:55:13,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:13,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:55:13,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:13,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:55:13,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:55:13,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:55:13,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 81 transitions, 564 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:13,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:13,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:55:13,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:14,525 INFO L124 PetriNetUnfolderBase]: 2654/5508 cut-off events. [2024-06-27 22:55:14,525 INFO L125 PetriNetUnfolderBase]: For 13991/14362 co-relation queries the response was YES. [2024-06-27 22:55:14,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16849 conditions, 5508 events. 2654/5508 cut-off events. For 13991/14362 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 46963 event pairs, 727 based on Foata normal form. 125/5053 useless extension candidates. Maximal degree in co-relation 16819. Up to 1720 conditions per place. [2024-06-27 22:55:14,548 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 29 selfloop transitions, 8 changer transitions 60/120 dead transitions. [2024-06-27 22:55:14,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 120 transitions, 958 flow [2024-06-27 22:55:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:55:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:55:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 225 transitions. [2024-06-27 22:55:14,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.598404255319149 [2024-06-27 22:55:14,549 INFO L175 Difference]: Start difference. First operand has 136 places, 81 transitions, 564 flow. Second operand 8 states and 225 transitions. [2024-06-27 22:55:14,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 120 transitions, 958 flow [2024-06-27 22:55:14,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 120 transitions, 801 flow, removed 19 selfloop flow, removed 19 redundant places. [2024-06-27 22:55:14,576 INFO L231 Difference]: Finished difference. Result has 117 places, 56 transitions, 299 flow [2024-06-27 22:55:14,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=299, PETRI_PLACES=117, PETRI_TRANSITIONS=56} [2024-06-27 22:55:14,577 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-06-27 22:55:14,577 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 56 transitions, 299 flow [2024-06-27 22:55:14,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:14,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:14,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:14,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:55:14,577 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:14,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:14,578 INFO L85 PathProgramCache]: Analyzing trace with hash 915823393, now seen corresponding path program 3 times [2024-06-27 22:55:14,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:14,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306631378] [2024-06-27 22:55:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:14,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306631378] [2024-06-27 22:55:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306631378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:15,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422653778] [2024-06-27 22:55:15,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:15,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:55:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:15,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:55:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:55:15,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2024-06-27 22:55:15,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 56 transitions, 299 flow. Second operand has 9 states, 9 states have (on average 25.0) internal successors, (225), 9 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:15,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:15,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2024-06-27 22:55:15,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:15,527 INFO L124 PetriNetUnfolderBase]: 889/1862 cut-off events. [2024-06-27 22:55:15,527 INFO L125 PetriNetUnfolderBase]: For 2673/2799 co-relation queries the response was YES. [2024-06-27 22:55:15,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5271 conditions, 1862 events. 889/1862 cut-off events. For 2673/2799 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 13013 event pairs, 227 based on Foata normal form. 46/1730 useless extension candidates. Maximal degree in co-relation 5246. Up to 620 conditions per place. [2024-06-27 22:55:15,534 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 24 selfloop transitions, 5 changer transitions 22/76 dead transitions. [2024-06-27 22:55:15,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 76 transitions, 464 flow [2024-06-27 22:55:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:55:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:55:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2024-06-27 22:55:15,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.601063829787234 [2024-06-27 22:55:15,535 INFO L175 Difference]: Start difference. First operand has 117 places, 56 transitions, 299 flow. Second operand 8 states and 226 transitions. [2024-06-27 22:55:15,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 76 transitions, 464 flow [2024-06-27 22:55:15,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 406 flow, removed 16 selfloop flow, removed 16 redundant places. [2024-06-27 22:55:15,542 INFO L231 Difference]: Finished difference. Result has 84 places, 48 transitions, 230 flow [2024-06-27 22:55:15,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=230, PETRI_PLACES=84, PETRI_TRANSITIONS=48} [2024-06-27 22:55:15,543 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2024-06-27 22:55:15,543 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 48 transitions, 230 flow [2024-06-27 22:55:15,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.0) internal successors, (225), 9 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:15,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:15,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:15,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:55:15,543 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:15,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:15,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1708220817, now seen corresponding path program 4 times [2024-06-27 22:55:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:15,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745420396] [2024-06-27 22:55:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:15,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:55:15,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:55:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:55:15,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:55:15,598 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:55:15,599 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-06-27 22:55:15,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-06-27 22:55:15,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-06-27 22:55:15,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-06-27 22:55:15,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 9 remaining) [2024-06-27 22:55:15,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-06-27 22:55:15,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-06-27 22:55:15,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2024-06-27 22:55:15,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-06-27 22:55:15,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:55:15,606 INFO L445 BasicCegarLoop]: Path program histogram: [8, 6, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:15,615 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:55:15,616 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:55:15,668 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-27 22:55:15,669 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-27 22:55:15,669 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:55:15 BasicIcfg [2024-06-27 22:55:15,669 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:55:15,670 INFO L158 Benchmark]: Toolchain (without parser) took 56472.39ms. Allocated memory was 130.0MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 91.0MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 656.6MB. Max. memory is 16.1GB. [2024-06-27 22:55:15,670 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:55:15,670 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:55:15,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.65ms. Allocated memory is still 130.0MB. Free memory was 90.6MB in the beginning and 61.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-06-27 22:55:15,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.22ms. Allocated memory is still 130.0MB. Free memory was 61.3MB in the beginning and 57.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:55:15,671 INFO L158 Benchmark]: Boogie Preprocessor took 53.02ms. Allocated memory is still 130.0MB. Free memory was 57.8MB in the beginning and 97.8MB in the end (delta: -40.0MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-06-27 22:55:15,671 INFO L158 Benchmark]: RCFGBuilder took 685.81ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 97.8MB in the beginning and 136.2MB in the end (delta: -38.4MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2024-06-27 22:55:15,671 INFO L158 Benchmark]: TraceAbstraction took 55203.21ms. Allocated memory was 169.9MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 135.2MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 659.9MB. Max. memory is 16.1GB. [2024-06-27 22:55:15,672 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.65ms. Allocated memory is still 130.0MB. Free memory was 90.6MB in the beginning and 61.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.22ms. Allocated memory is still 130.0MB. Free memory was 61.3MB in the beginning and 57.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.02ms. Allocated memory is still 130.0MB. Free memory was 57.8MB in the beginning and 97.8MB in the end (delta: -40.0MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 685.81ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 97.8MB in the beginning and 136.2MB in the end (delta: -38.4MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * TraceAbstraction took 55203.21ms. Allocated memory was 169.9MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 135.2MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 659.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t2517; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] 0 //@ assert (!multithreaded || (((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) y$r_buff0_thd3) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd3) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd3) + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd3 - (long long) y$r_buff1_thd3) >= 0LL)) && (((long long) y$r_buff0_thd3 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd3 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd3 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL))); [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, t2517=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L819] 0 pthread_t t2518; VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, t2517=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L820] 0 //@ assert (!multithreaded || (((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) y$r_buff0_thd3) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd3) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd3) + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd3 - (long long) y$r_buff1_thd3) >= 0LL)) && (((long long) y$r_buff0_thd3 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd3 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd3 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL))); [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L821] 0 //@ assert (!multithreaded || (((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) y$r_buff0_thd3) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd3) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd3) + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd3 - (long long) y$r_buff1_thd3) >= 0LL)) && (((long long) y$r_buff0_thd3 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd3 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd3 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 73 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 55.1s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 41.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2156 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1836 mSDsluCounter, 525 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 366 mSDsCounter, 475 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9176 IncrementalHoareTripleChecker+Invalid, 9651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 475 mSolverCounterUnsat, 159 mSDtfsCounter, 9176 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1453occurred in iteration=29, InterpolantAutomatonStates: 275, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 821 ConstructedInterpolants, 0 QuantifiedInterpolants, 15359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 22:55:15,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE