./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c ./goblint.2024-05-07_14-17-48.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.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-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:54:06,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:54:06,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:54:06,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:54:06,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:54:06,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:54:06,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:54:06,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:54:06,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:54:06,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:54:06,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:54:06,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:54:06,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:54:06,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:54:06,302 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:54:06,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:54:06,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:54:06,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:54:06,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:54:06,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:54:06,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:54:06,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:54:06,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:54:06,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:54:06,304 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:54:06,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:54:06,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:54:06,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:54:06,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:54:06,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:54:06,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:54:06,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:54:06,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:54:06,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:54:06,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:54:06,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:54:06,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:54:06,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:54:06,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:54:06,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:54:06,308 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:54:06,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:54:06,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:54:06,308 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-05-12 12:54:06,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:54:06,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:54:06,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:54:06,549 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:54:06,550 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:54:06,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml [2024-05-12 12:54:06,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:54:06,701 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:54:06,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-05-12 12:54:07,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:54:07,886 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:54:07,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-05-12 12:54:07,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5980dcd46/d1ec419f8f684efa8a1989239e9408d1/FLAG93747b24f [2024-05-12 12:54:07,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5980dcd46/d1ec419f8f684efa8a1989239e9408d1 [2024-05-12 12:54:07,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:54:07,903 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:54:07,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:54:07,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:54:07,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:54:07,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:54:06" (1/2) ... [2024-05-12 12:54:07,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b61482d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:54:07, skipping insertion in model container [2024-05-12 12:54:07,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:54:06" (1/2) ... [2024-05-12 12:54:07,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1e15ac69 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:54:07, skipping insertion in model container [2024-05-12 12:54:07,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:54:07" (2/2) ... [2024-05-12 12:54:07,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b61482d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07, skipping insertion in model container [2024-05-12 12:54:07,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:54:07" (2/2) ... [2024-05-12 12:54:07,915 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:54:07,927 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:54:07,928 INFO L97 edCorrectnessWitness]: Location invariant before [L99-L99] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-05-12 12:54:07,928 INFO L97 edCorrectnessWitness]: Location invariant before [L96-L96] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-05-12 12:54:07,928 INFO L97 edCorrectnessWitness]: Location invariant before [L98-L98] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-05-12 12:54:07,928 INFO L97 edCorrectnessWitness]: Location invariant before [L97-L97] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-05-12 12:54:07,928 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:54:07,929 INFO L106 edCorrectnessWitness]: ghost_update [L95-L95] multithreaded = 1; [2024-05-12 12:54:07,943 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:54:08,097 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2024-05-12 12:54:08,107 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:54:08,119 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:54:08,170 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2024-05-12 12:54:08,173 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:54:08,186 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:54:08,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08 WrapperNode [2024-05-12 12:54:08,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:54:08,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:54:08,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:54:08,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:54:08,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,240 INFO L138 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2024-05-12 12:54:08,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:54:08,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:54:08,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:54:08,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:54:08,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,278 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-05-12 12:54:08,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:54:08,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:54:08,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:54:08,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:54:08,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (1/1) ... [2024-05-12 12:54:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:54:08,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:08,330 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-05-12 12:54:08,365 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-05-12 12:54:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:54:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-12 12:54:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-12 12:54:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-12 12:54:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-12 12:54:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-12 12:54:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-12 12:54:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-12 12:54:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-12 12:54:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:54:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:54:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:54:08,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 12:54:08,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 12:54:08,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:54:08,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:54:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:54:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:54:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 12:54:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 12:54:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:54:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:54:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:54:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:54:08,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 12:54:08,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 12:54:08,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 12:54:08,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 12:54:08,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 12:54:08,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:54:08,381 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:54:08,486 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:54:08,487 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:54:08,729 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:54:08,729 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:54:08,966 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:54:08,966 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-12 12:54:08,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:54:08 BoogieIcfgContainer [2024-05-12 12:54:08,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:54:08,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:54:08,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:54:08,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:54:08,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:54:06" (1/4) ... [2024-05-12 12:54:08,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8cfb81 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:54:08, skipping insertion in model container [2024-05-12 12:54:08,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:54:07" (2/4) ... [2024-05-12 12:54:08,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8cfb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:54:08, skipping insertion in model container [2024-05-12 12:54:08,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:08" (3/4) ... [2024-05-12 12:54:08,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8cfb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:54:08, skipping insertion in model container [2024-05-12 12:54:08,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:54:08" (4/4) ... [2024-05-12 12:54:08,976 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-05-12 12:54:08,989 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:54:08,990 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 12:54:08,990 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:54:09,032 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-12 12:54:09,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 118 flow [2024-05-12 12:54:09,090 INFO L124 PetriNetUnfolderBase]: 4/41 cut-off events. [2024-05-12 12:54:09,093 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-05-12 12:54:09,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 41 events. 4/41 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-05-12 12:54:09,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 45 transitions, 118 flow [2024-05-12 12:54:09,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 40 transitions, 104 flow [2024-05-12 12:54:09,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:54:09,114 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;@2a759a4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:54:09,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 12:54:09,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:54:09,118 INFO L124 PetriNetUnfolderBase]: 1/8 cut-off events. [2024-05-12 12:54:09,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:54:09,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:09,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:54:09,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:09,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash -530851118, now seen corresponding path program 1 times [2024-05-12 12:54:09,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:09,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975257472] [2024-05-12 12:54:09,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:09,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:09,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975257472] [2024-05-12 12:54:09,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975257472] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:09,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:54:09,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224235894] [2024-05-12 12:54:09,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:09,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:54:09,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:54:09,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:54:09,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:09,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:09,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:09,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:09,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:09,745 INFO L124 PetriNetUnfolderBase]: 783/1115 cut-off events. [2024-05-12 12:54:09,747 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-05-12 12:54:09,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2253 conditions, 1115 events. 783/1115 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3664 event pairs, 180 based on Foata normal form. 0/1086 useless extension candidates. Maximal degree in co-relation 1805. Up to 715 conditions per place. [2024-05-12 12:54:09,759 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 54 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2024-05-12 12:54:09,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 284 flow [2024-05-12 12:54:09,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:54:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:54:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-05-12 12:54:09,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2024-05-12 12:54:09,774 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 104 flow. Second operand 3 states and 89 transitions. [2024-05-12 12:54:09,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 284 flow [2024-05-12 12:54:09,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 256 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:54:09,784 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 116 flow [2024-05-12 12:54:09,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2024-05-12 12:54:09,791 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2024-05-12 12:54:09,791 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 116 flow [2024-05-12 12:54:09,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:09,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:09,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:09,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:54:09,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:09,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1606960346, now seen corresponding path program 1 times [2024-05-12 12:54:09,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:09,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785245830] [2024-05-12 12:54:09,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:09,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:09,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785245830] [2024-05-12 12:54:09,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785245830] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:09,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:09,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:54:09,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405275375] [2024-05-12 12:54:09,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:09,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:54:09,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:09,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:54:09,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:54:09,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-05-12 12:54:09,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:09,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:09,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-05-12 12:54:09,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:10,077 INFO L124 PetriNetUnfolderBase]: 999/1503 cut-off events. [2024-05-12 12:54:10,077 INFO L125 PetriNetUnfolderBase]: For 422/436 co-relation queries the response was YES. [2024-05-12 12:54:10,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 1503 events. 999/1503 cut-off events. For 422/436 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5784 event pairs, 172 based on Foata normal form. 89/1581 useless extension candidates. Maximal degree in co-relation 1414. Up to 1080 conditions per place. [2024-05-12 12:54:10,092 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 52 selfloop transitions, 3 changer transitions 3/66 dead transitions. [2024-05-12 12:54:10,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 290 flow [2024-05-12 12:54:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:54:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:54:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-05-12 12:54:10,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7185185185185186 [2024-05-12 12:54:10,095 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 116 flow. Second operand 3 states and 97 transitions. [2024-05-12 12:54:10,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 290 flow [2024-05-12 12:54:10,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:54:10,098 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 137 flow [2024-05-12 12:54:10,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=137, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2024-05-12 12:54:10,099 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2024-05-12 12:54:10,099 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 137 flow [2024-05-12 12:54:10,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:10,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:10,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:10,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:54:10,100 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:10,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1899233448, now seen corresponding path program 1 times [2024-05-12 12:54:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636909880] [2024-05-12 12:54:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:10,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:10,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636909880] [2024-05-12 12:54:10,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636909880] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:10,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:54:10,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395206712] [2024-05-12 12:54:10,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:10,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:54:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:10,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:54:10,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:54:10,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:10,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:10,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:10,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:10,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:10,551 INFO L124 PetriNetUnfolderBase]: 1349/1992 cut-off events. [2024-05-12 12:54:10,551 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2024-05-12 12:54:10,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4845 conditions, 1992 events. 1349/1992 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7934 event pairs, 178 based on Foata normal form. 28/2019 useless extension candidates. Maximal degree in co-relation 1550. Up to 751 conditions per place. [2024-05-12 12:54:10,560 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 91 selfloop transitions, 8 changer transitions 3/107 dead transitions. [2024-05-12 12:54:10,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 107 transitions, 497 flow [2024-05-12 12:54:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:54:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:54:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-05-12 12:54:10,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-05-12 12:54:10,562 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 137 flow. Second operand 5 states and 150 transitions. [2024-05-12 12:54:10,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 107 transitions, 497 flow [2024-05-12 12:54:10,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 107 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:54:10,564 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 165 flow [2024-05-12 12:54:10,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-05-12 12:54:10,564 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-05-12 12:54:10,565 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 165 flow [2024-05-12 12:54:10,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:10,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:10,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:10,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:54:10,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:10,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1999337182, now seen corresponding path program 1 times [2024-05-12 12:54:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329649151] [2024-05-12 12:54:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329649151] [2024-05-12 12:54:10,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329649151] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:10,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:10,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:54:10,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838193052] [2024-05-12 12:54:10,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:10,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:54:10,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:10,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:54:10,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:54:10,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:10,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:10,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:10,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:10,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:10,896 INFO L124 PetriNetUnfolderBase]: 1665/2439 cut-off events. [2024-05-12 12:54:10,897 INFO L125 PetriNetUnfolderBase]: For 2102/2102 co-relation queries the response was YES. [2024-05-12 12:54:10,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 2439 events. 1665/2439 cut-off events. For 2102/2102 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10365 event pairs, 308 based on Foata normal form. 24/2462 useless extension candidates. Maximal degree in co-relation 3817. Up to 1614 conditions per place. [2024-05-12 12:54:10,908 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 74 selfloop transitions, 6 changer transitions 3/88 dead transitions. [2024-05-12 12:54:10,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 88 transitions, 443 flow [2024-05-12 12:54:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:54:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:54:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-05-12 12:54:10,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-05-12 12:54:10,909 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 165 flow. Second operand 4 states and 116 transitions. [2024-05-12 12:54:10,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 88 transitions, 443 flow [2024-05-12 12:54:10,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 88 transitions, 429 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 12:54:10,917 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 191 flow [2024-05-12 12:54:10,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2024-05-12 12:54:10,918 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2024-05-12 12:54:10,918 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 191 flow [2024-05-12 12:54:10,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:10,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:10,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:10,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:54:10,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:10,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 793913308, now seen corresponding path program 1 times [2024-05-12 12:54:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:10,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423140675] [2024-05-12 12:54:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:10,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423140675] [2024-05-12 12:54:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423140675] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:11,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:54:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740329742] [2024-05-12 12:54:11,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:11,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:54:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:11,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:54:11,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:54:11,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:11,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:11,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:11,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:11,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:11,392 INFO L124 PetriNetUnfolderBase]: 1981/2928 cut-off events. [2024-05-12 12:54:11,393 INFO L125 PetriNetUnfolderBase]: For 2961/2961 co-relation queries the response was YES. [2024-05-12 12:54:11,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8117 conditions, 2928 events. 1981/2928 cut-off events. For 2961/2961 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12931 event pairs, 194 based on Foata normal form. 24/2951 useless extension candidates. Maximal degree in co-relation 4956. Up to 1621 conditions per place. [2024-05-12 12:54:11,407 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 96 selfloop transitions, 8 changer transitions 3/112 dead transitions. [2024-05-12 12:54:11,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 112 transitions, 577 flow [2024-05-12 12:54:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:54:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:54:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-05-12 12:54:11,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2024-05-12 12:54:11,409 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 191 flow. Second operand 5 states and 149 transitions. [2024-05-12 12:54:11,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 112 transitions, 577 flow [2024-05-12 12:54:11,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 112 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:54:11,416 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 224 flow [2024-05-12 12:54:11,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2024-05-12 12:54:11,417 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-05-12 12:54:11,417 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 224 flow [2024-05-12 12:54:11,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:11,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:11,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:11,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:54:11,418 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:11,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash 815483728, now seen corresponding path program 2 times [2024-05-12 12:54:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:11,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668163965] [2024-05-12 12:54:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:11,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:11,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:11,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668163965] [2024-05-12 12:54:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668163965] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:11,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:11,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:54:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233905256] [2024-05-12 12:54:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:11,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:54:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:54:11,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:54:11,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:11,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:11,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:11,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:11,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:11,777 INFO L124 PetriNetUnfolderBase]: 2613/3808 cut-off events. [2024-05-12 12:54:11,778 INFO L125 PetriNetUnfolderBase]: For 6102/6102 co-relation queries the response was YES. [2024-05-12 12:54:11,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11244 conditions, 3808 events. 2613/3808 cut-off events. For 6102/6102 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17186 event pairs, 388 based on Foata normal form. 24/3830 useless extension candidates. Maximal degree in co-relation 6984. Up to 1401 conditions per place. [2024-05-12 12:54:11,797 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 93 selfloop transitions, 15 changer transitions 0/113 dead transitions. [2024-05-12 12:54:11,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 113 transitions, 638 flow [2024-05-12 12:54:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:54:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:54:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-05-12 12:54:11,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-05-12 12:54:11,799 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 224 flow. Second operand 5 states and 146 transitions. [2024-05-12 12:54:11,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 113 transitions, 638 flow [2024-05-12 12:54:11,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 113 transitions, 623 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 12:54:11,803 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 307 flow [2024-05-12 12:54:11,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2024-05-12 12:54:11,804 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-05-12 12:54:11,804 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 307 flow [2024-05-12 12:54:11,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:11,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:11,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:11,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:54:11,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:11,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1734006804, now seen corresponding path program 1 times [2024-05-12 12:54:11,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:11,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128012103] [2024-05-12 12:54:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:11,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128012103] [2024-05-12 12:54:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128012103] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:11,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:54:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116683258] [2024-05-12 12:54:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:11,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:54:11,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:11,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:54:11,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:54:11,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:11,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:11,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:11,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:11,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:12,274 INFO L124 PetriNetUnfolderBase]: 2929/4249 cut-off events. [2024-05-12 12:54:12,275 INFO L125 PetriNetUnfolderBase]: For 9844/9844 co-relation queries the response was YES. [2024-05-12 12:54:12,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13706 conditions, 4249 events. 2929/4249 cut-off events. For 9844/9844 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 19780 event pairs, 466 based on Foata normal form. 24/4272 useless extension candidates. Maximal degree in co-relation 8362. Up to 2898 conditions per place. [2024-05-12 12:54:12,301 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 100 selfloop transitions, 8 changer transitions 3/116 dead transitions. [2024-05-12 12:54:12,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 116 transitions, 704 flow [2024-05-12 12:54:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:54:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:54:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-05-12 12:54:12,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-05-12 12:54:12,302 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 307 flow. Second operand 5 states and 146 transitions. [2024-05-12 12:54:12,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 116 transitions, 704 flow [2024-05-12 12:54:12,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 116 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:54:12,318 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 338 flow [2024-05-12 12:54:12,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-05-12 12:54:12,319 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-05-12 12:54:12,319 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 338 flow [2024-05-12 12:54:12,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:12,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:12,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:12,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:54:12,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:12,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1014369410, now seen corresponding path program 1 times [2024-05-12 12:54:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:12,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880314823] [2024-05-12 12:54:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:12,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880314823] [2024-05-12 12:54:12,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880314823] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:12,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:12,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:54:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958637643] [2024-05-12 12:54:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:12,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:54:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:12,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:54:12,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:54:12,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:12,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:12,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:12,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:12,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:12,829 INFO L124 PetriNetUnfolderBase]: 3245/4768 cut-off events. [2024-05-12 12:54:12,830 INFO L125 PetriNetUnfolderBase]: For 12470/12470 co-relation queries the response was YES. [2024-05-12 12:54:12,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15517 conditions, 4768 events. 3245/4768 cut-off events. For 12470/12470 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 23022 event pairs, 338 based on Foata normal form. 24/4791 useless extension candidates. Maximal degree in co-relation 11104. Up to 2831 conditions per place. [2024-05-12 12:54:12,854 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 123 selfloop transitions, 9 changer transitions 3/140 dead transitions. [2024-05-12 12:54:12,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 140 transitions, 859 flow [2024-05-12 12:54:12,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:54:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:54:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-05-12 12:54:12,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2024-05-12 12:54:12,856 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 338 flow. Second operand 6 states and 179 transitions. [2024-05-12 12:54:12,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 140 transitions, 859 flow [2024-05-12 12:54:12,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 140 transitions, 844 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-05-12 12:54:12,891 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 363 flow [2024-05-12 12:54:12,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-05-12 12:54:12,891 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-05-12 12:54:12,891 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 363 flow [2024-05-12 12:54:12,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:12,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:12,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:12,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:54:12,892 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:12,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1780457406, now seen corresponding path program 2 times [2024-05-12 12:54:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309696854] [2024-05-12 12:54:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:13,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:13,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309696854] [2024-05-12 12:54:13,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309696854] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:13,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:13,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:54:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319438773] [2024-05-12 12:54:13,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:13,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:54:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:13,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:54:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:54:13,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:13,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:13,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:13,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:13,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:13,500 INFO L124 PetriNetUnfolderBase]: 3561/5205 cut-off events. [2024-05-12 12:54:13,500 INFO L125 PetriNetUnfolderBase]: For 15161/15161 co-relation queries the response was YES. [2024-05-12 12:54:13,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17248 conditions, 5205 events. 3561/5205 cut-off events. For 15161/15161 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 25370 event pairs, 406 based on Foata normal form. 24/5228 useless extension candidates. Maximal degree in co-relation 14134. Up to 2907 conditions per place. [2024-05-12 12:54:13,519 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 122 selfloop transitions, 11 changer transitions 3/141 dead transitions. [2024-05-12 12:54:13,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 884 flow [2024-05-12 12:54:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:54:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:54:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-05-12 12:54:13,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2024-05-12 12:54:13,521 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 363 flow. Second operand 6 states and 179 transitions. [2024-05-12 12:54:13,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 884 flow [2024-05-12 12:54:13,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 141 transitions, 868 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 12:54:13,555 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 394 flow [2024-05-12 12:54:13,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-05-12 12:54:13,555 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-05-12 12:54:13,555 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 394 flow [2024-05-12 12:54:13,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:13,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:13,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:13,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:54:13,556 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:13,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash 66823338, now seen corresponding path program 3 times [2024-05-12 12:54:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:13,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701673083] [2024-05-12 12:54:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:13,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:13,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701673083] [2024-05-12 12:54:13,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701673083] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:13,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:13,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:54:13,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021159305] [2024-05-12 12:54:13,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:13,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:54:13,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:13,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:54:13,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:54:13,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:13,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:13,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:13,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:13,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:14,157 INFO L124 PetriNetUnfolderBase]: 4413/6430 cut-off events. [2024-05-12 12:54:14,157 INFO L125 PetriNetUnfolderBase]: For 23175/23175 co-relation queries the response was YES. [2024-05-12 12:54:14,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21827 conditions, 6430 events. 4413/6430 cut-off events. For 23175/23175 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 31920 event pairs, 532 based on Foata normal form. 48/6476 useless extension candidates. Maximal degree in co-relation 17594. Up to 1767 conditions per place. [2024-05-12 12:54:14,190 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 116 selfloop transitions, 20 changer transitions 0/141 dead transitions. [2024-05-12 12:54:14,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 141 transitions, 952 flow [2024-05-12 12:54:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:54:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:54:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2024-05-12 12:54:14,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2024-05-12 12:54:14,191 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 394 flow. Second operand 6 states and 177 transitions. [2024-05-12 12:54:14,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 141 transitions, 952 flow [2024-05-12 12:54:14,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 141 transitions, 928 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 12:54:14,241 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 478 flow [2024-05-12 12:54:14,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2024-05-12 12:54:14,241 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2024-05-12 12:54:14,241 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 478 flow [2024-05-12 12:54:14,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:14,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:14,242 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-05-12 12:54:14,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:54:14,242 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:14,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1245471637, now seen corresponding path program 1 times [2024-05-12 12:54:14,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:14,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290760309] [2024-05-12 12:54:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290760309] [2024-05-12 12:54:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290760309] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:14,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:14,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:54:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476614168] [2024-05-12 12:54:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:14,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:54:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:54:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:54:14,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:14,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 478 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:14,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:14,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:14,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:14,814 INFO L124 PetriNetUnfolderBase]: 4657/6811 cut-off events. [2024-05-12 12:54:14,815 INFO L125 PetriNetUnfolderBase]: For 29254/29254 co-relation queries the response was YES. [2024-05-12 12:54:14,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24223 conditions, 6811 events. 4657/6811 cut-off events. For 29254/29254 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 35131 event pairs, 750 based on Foata normal form. 16/6826 useless extension candidates. Maximal degree in co-relation 20132. Up to 5251 conditions per place. [2024-05-12 12:54:14,845 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 107 selfloop transitions, 8 changer transitions 3/123 dead transitions. [2024-05-12 12:54:14,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 907 flow [2024-05-12 12:54:14,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:54:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:54:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-05-12 12:54:14,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-05-12 12:54:14,846 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 478 flow. Second operand 5 states and 144 transitions. [2024-05-12 12:54:14,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 907 flow [2024-05-12 12:54:14,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 886 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 12:54:14,931 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 498 flow [2024-05-12 12:54:14,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=498, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2024-05-12 12:54:14,931 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2024-05-12 12:54:14,932 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 498 flow [2024-05-12 12:54:14,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:14,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:14,932 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-05-12 12:54:14,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:54:14,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:14,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash 151706559, now seen corresponding path program 1 times [2024-05-12 12:54:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:14,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434200010] [2024-05-12 12:54:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434200010] [2024-05-12 12:54:15,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434200010] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:15,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:15,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:54:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493378171] [2024-05-12 12:54:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:15,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:54:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:15,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:54:15,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:54:15,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:15,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 498 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:15,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:15,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:15,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:15,636 INFO L124 PetriNetUnfolderBase]: 4901/7070 cut-off events. [2024-05-12 12:54:15,637 INFO L125 PetriNetUnfolderBase]: For 34045/34045 co-relation queries the response was YES. [2024-05-12 12:54:15,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26552 conditions, 7070 events. 4901/7070 cut-off events. For 34045/34045 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 36076 event pairs, 1036 based on Foata normal form. 16/7085 useless extension candidates. Maximal degree in co-relation 22837. Up to 5588 conditions per place. [2024-05-12 12:54:15,729 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 106 selfloop transitions, 8 changer transitions 3/122 dead transitions. [2024-05-12 12:54:15,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 122 transitions, 918 flow [2024-05-12 12:54:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:54:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:54:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-05-12 12:54:15,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2024-05-12 12:54:15,745 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 498 flow. Second operand 5 states and 141 transitions. [2024-05-12 12:54:15,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 122 transitions, 918 flow [2024-05-12 12:54:15,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 122 transitions, 905 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 12:54:15,848 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 534 flow [2024-05-12 12:54:15,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=534, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-05-12 12:54:15,849 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2024-05-12 12:54:15,849 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 534 flow [2024-05-12 12:54:15,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:15,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:15,849 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-05-12 12:54:15,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:54:15,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:15,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1312613953, now seen corresponding path program 1 times [2024-05-12 12:54:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785565021] [2024-05-12 12:54:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785565021] [2024-05-12 12:54:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785565021] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:15,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:54:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768276043] [2024-05-12 12:54:15,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:15,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:54:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:15,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:54:15,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:54:15,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-05-12 12:54:15,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 534 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:15,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:15,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-05-12 12:54:15,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:16,636 INFO L124 PetriNetUnfolderBase]: 9107/13370 cut-off events. [2024-05-12 12:54:16,636 INFO L125 PetriNetUnfolderBase]: For 79572/79588 co-relation queries the response was YES. [2024-05-12 12:54:16,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49794 conditions, 13370 events. 9107/13370 cut-off events. For 79572/79588 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 78873 event pairs, 1723 based on Foata normal form. 540/13885 useless extension candidates. Maximal degree in co-relation 40640. Up to 6842 conditions per place. [2024-05-12 12:54:16,719 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 99 selfloop transitions, 29 changer transitions 3/137 dead transitions. [2024-05-12 12:54:16,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 137 transitions, 1219 flow [2024-05-12 12:54:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:54:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:54:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-05-12 12:54:16,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7611111111111111 [2024-05-12 12:54:16,720 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 534 flow. Second operand 4 states and 137 transitions. [2024-05-12 12:54:16,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 137 transitions, 1219 flow [2024-05-12 12:54:17,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 137 transitions, 1186 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 12:54:17,130 INFO L231 Difference]: Finished difference. Result has 72 places, 92 transitions, 983 flow [2024-05-12 12:54:17,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=983, PETRI_PLACES=72, PETRI_TRANSITIONS=92} [2024-05-12 12:54:17,131 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2024-05-12 12:54:17,131 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 92 transitions, 983 flow [2024-05-12 12:54:17,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:17,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:17,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] [2024-05-12 12:54:17,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:54:17,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:17,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1315473889, now seen corresponding path program 1 times [2024-05-12 12:54:17,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:17,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456639421] [2024-05-12 12:54:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:17,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:17,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456639421] [2024-05-12 12:54:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456639421] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:54:17,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764344502] [2024-05-12 12:54:17,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:17,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:54:17,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:54:17,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:54:17,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:17,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 92 transitions, 983 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:17,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:17,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:17,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:18,374 INFO L124 PetriNetUnfolderBase]: 9415/13932 cut-off events. [2024-05-12 12:54:18,375 INFO L125 PetriNetUnfolderBase]: For 96536/96536 co-relation queries the response was YES. [2024-05-12 12:54:18,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58120 conditions, 13932 events. 9415/13932 cut-off events. For 96536/96536 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 84007 event pairs, 1544 based on Foata normal form. 16/13947 useless extension candidates. Maximal degree in co-relation 47495. Up to 10548 conditions per place. [2024-05-12 12:54:18,524 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 151 selfloop transitions, 14 changer transitions 3/173 dead transitions. [2024-05-12 12:54:18,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 173 transitions, 1626 flow [2024-05-12 12:54:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:54:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:54:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-05-12 12:54:18,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-05-12 12:54:18,526 INFO L175 Difference]: Start difference. First operand has 72 places, 92 transitions, 983 flow. Second operand 6 states and 174 transitions. [2024-05-12 12:54:18,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 173 transitions, 1626 flow [2024-05-12 12:54:18,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 173 transitions, 1624 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-05-12 12:54:18,875 INFO L231 Difference]: Finished difference. Result has 78 places, 93 transitions, 1034 flow [2024-05-12 12:54:18,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1034, PETRI_PLACES=78, PETRI_TRANSITIONS=93} [2024-05-12 12:54:18,876 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2024-05-12 12:54:18,876 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 1034 flow [2024-05-12 12:54:18,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:18,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:18,876 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-05-12 12:54:18,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:54:18,877 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:18,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1396304473, now seen corresponding path program 2 times [2024-05-12 12:54:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:18,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614743660] [2024-05-12 12:54:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:18,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:18,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614743660] [2024-05-12 12:54:18,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614743660] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:18,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:18,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:54:18,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638924564] [2024-05-12 12:54:18,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:18,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:54:18,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:18,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:54:18,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:54:18,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:18,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 1034 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:18,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:18,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:18,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:20,280 INFO L124 PetriNetUnfolderBase]: 10077/14906 cut-off events. [2024-05-12 12:54:20,281 INFO L125 PetriNetUnfolderBase]: For 113211/113211 co-relation queries the response was YES. [2024-05-12 12:54:20,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63233 conditions, 14906 events. 10077/14906 cut-off events. For 113211/113211 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 90878 event pairs, 1690 based on Foata normal form. 48/14953 useless extension candidates. Maximal degree in co-relation 54964. Up to 10839 conditions per place. [2024-05-12 12:54:20,361 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 156 selfloop transitions, 16 changer transitions 3/180 dead transitions. [2024-05-12 12:54:20,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 180 transitions, 1855 flow [2024-05-12 12:54:20,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:54:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:54:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-05-12 12:54:20,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-05-12 12:54:20,363 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 1034 flow. Second operand 6 states and 171 transitions. [2024-05-12 12:54:20,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 180 transitions, 1855 flow [2024-05-12 12:54:20,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 180 transitions, 1830 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 12:54:20,785 INFO L231 Difference]: Finished difference. Result has 80 places, 95 transitions, 1090 flow [2024-05-12 12:54:20,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1090, PETRI_PLACES=80, PETRI_TRANSITIONS=95} [2024-05-12 12:54:20,786 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places. [2024-05-12 12:54:20,786 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 95 transitions, 1090 flow [2024-05-12 12:54:20,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:20,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:20,786 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-05-12 12:54:20,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:54:20,787 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:20,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:20,787 INFO L85 PathProgramCache]: Analyzing trace with hash -247411331, now seen corresponding path program 3 times [2024-05-12 12:54:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118401255] [2024-05-12 12:54:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118401255] [2024-05-12 12:54:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118401255] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:20,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:20,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:54:20,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831728987] [2024-05-12 12:54:20,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:20,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:54:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:20,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:54:20,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:54:20,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:20,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 95 transitions, 1090 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:20,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:20,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:20,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:22,140 INFO L124 PetriNetUnfolderBase]: 10565/15556 cut-off events. [2024-05-12 12:54:22,140 INFO L125 PetriNetUnfolderBase]: For 128133/128133 co-relation queries the response was YES. [2024-05-12 12:54:22,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67404 conditions, 15556 events. 10565/15556 cut-off events. For 128133/128133 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 94206 event pairs, 1464 based on Foata normal form. 16/15569 useless extension candidates. Maximal degree in co-relation 56603. Up to 10741 conditions per place. [2024-05-12 12:54:22,228 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 146 selfloop transitions, 23 changer transitions 0/174 dead transitions. [2024-05-12 12:54:22,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 174 transitions, 1772 flow [2024-05-12 12:54:22,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:54:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:54:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-05-12 12:54:22,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-05-12 12:54:22,230 INFO L175 Difference]: Start difference. First operand has 80 places, 95 transitions, 1090 flow. Second operand 6 states and 171 transitions. [2024-05-12 12:54:22,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 174 transitions, 1772 flow [2024-05-12 12:54:22,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 174 transitions, 1743 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-05-12 12:54:22,568 INFO L231 Difference]: Finished difference. Result has 82 places, 97 transitions, 1159 flow [2024-05-12 12:54:22,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1159, PETRI_PLACES=82, PETRI_TRANSITIONS=97} [2024-05-12 12:54:22,568 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-05-12 12:54:22,569 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 1159 flow [2024-05-12 12:54:22,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:22,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:22,569 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-05-12 12:54:22,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:54:22,569 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:22,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1774812703, now seen corresponding path program 4 times [2024-05-12 12:54:22,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:22,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886606656] [2024-05-12 12:54:22,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:22,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886606656] [2024-05-12 12:54:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886606656] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:22,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:22,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:54:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529972139] [2024-05-12 12:54:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:22,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:54:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:54:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:54:22,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:22,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 97 transitions, 1159 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:22,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:22,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:22,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:24,179 INFO L124 PetriNetUnfolderBase]: 11959/17542 cut-off events. [2024-05-12 12:54:24,179 INFO L125 PetriNetUnfolderBase]: For 163146/163146 co-relation queries the response was YES. [2024-05-12 12:54:24,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77891 conditions, 17542 events. 11959/17542 cut-off events. For 163146/163146 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 106677 event pairs, 1660 based on Foata normal form. 48/17587 useless extension candidates. Maximal degree in co-relation 66822. Up to 9666 conditions per place. [2024-05-12 12:54:24,284 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 149 selfloop transitions, 32 changer transitions 0/186 dead transitions. [2024-05-12 12:54:24,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 186 transitions, 2097 flow [2024-05-12 12:54:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:54:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:54:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-05-12 12:54:24,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-05-12 12:54:24,286 INFO L175 Difference]: Start difference. First operand has 82 places, 97 transitions, 1159 flow. Second operand 6 states and 168 transitions. [2024-05-12 12:54:24,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 186 transitions, 2097 flow [2024-05-12 12:54:24,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 186 transitions, 2049 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 12:54:24,662 INFO L231 Difference]: Finished difference. Result has 85 places, 103 transitions, 1336 flow [2024-05-12 12:54:24,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1336, PETRI_PLACES=85, PETRI_TRANSITIONS=103} [2024-05-12 12:54:24,663 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places. [2024-05-12 12:54:24,663 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 103 transitions, 1336 flow [2024-05-12 12:54:24,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:24,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:24,664 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:24,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:54:24,664 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:24,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:24,665 INFO L85 PathProgramCache]: Analyzing trace with hash 45454275, now seen corresponding path program 2 times [2024-05-12 12:54:24,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:24,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736585605] [2024-05-12 12:54:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:24,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736585605] [2024-05-12 12:54:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736585605] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333997335] [2024-05-12 12:54:24,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 12:54:24,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:24,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:24,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:24,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-05-12 12:54:24,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-05-12 12:54:24,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:24,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 12:54:24,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-12 12:54:25,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-12 12:54:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333997335] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:25,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-12 12:54:25,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2024-05-12 12:54:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736380775] [2024-05-12 12:54:25,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:25,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:54:25,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:54:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:54:25,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2024-05-12 12:54:25,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 103 transitions, 1336 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:25,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:25,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2024-05-12 12:54:25,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:26,536 INFO L124 PetriNetUnfolderBase]: 12445/18061 cut-off events. [2024-05-12 12:54:26,536 INFO L125 PetriNetUnfolderBase]: For 194514/194514 co-relation queries the response was YES. [2024-05-12 12:54:26,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82038 conditions, 18061 events. 12445/18061 cut-off events. For 194514/194514 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 108570 event pairs, 4167 based on Foata normal form. 96/18154 useless extension candidates. Maximal degree in co-relation 72555. Up to 8125 conditions per place. [2024-05-12 12:54:26,668 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 116 selfloop transitions, 37 changer transitions 0/158 dead transitions. [2024-05-12 12:54:26,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 158 transitions, 2052 flow [2024-05-12 12:54:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:54:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:54:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-05-12 12:54:26,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-05-12 12:54:26,670 INFO L175 Difference]: Start difference. First operand has 85 places, 103 transitions, 1336 flow. Second operand 7 states and 140 transitions. [2024-05-12 12:54:26,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 158 transitions, 2052 flow [2024-05-12 12:54:27,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 158 transitions, 1924 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-05-12 12:54:27,396 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 1350 flow [2024-05-12 12:54:27,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1350, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2024-05-12 12:54:27,397 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-05-12 12:54:27,397 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 1350 flow [2024-05-12 12:54:27,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:27,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:27,398 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] [2024-05-12 12:54:27,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-05-12 12:54:27,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-12 12:54:27,608 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:27,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:27,609 INFO L85 PathProgramCache]: Analyzing trace with hash -78028327, now seen corresponding path program 1 times [2024-05-12 12:54:27,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:27,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464481709] [2024-05-12 12:54:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:27,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464481709] [2024-05-12 12:54:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464481709] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:27,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269260496] [2024-05-12 12:54:27,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:27,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:27,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:27,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:27,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-12 12:54:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:27,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjunts are in the unsatisfiable core [2024-05-12 12:54:27,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:27,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:27,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269260496] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:27,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-12 12:54:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2024-05-12 12:54:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916413276] [2024-05-12 12:54:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:27,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:54:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:27,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:54:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:54:27,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-05-12 12:54:27,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 1350 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:27,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:27,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-05-12 12:54:27,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:31,267 INFO L124 PetriNetUnfolderBase]: 31651/44560 cut-off events. [2024-05-12 12:54:31,268 INFO L125 PetriNetUnfolderBase]: For 424084/424336 co-relation queries the response was YES. [2024-05-12 12:54:31,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188444 conditions, 44560 events. 31651/44560 cut-off events. For 424084/424336 co-relation queries the response was YES. Maximal size of possible extension queue 1836. Compared 284590 event pairs, 7846 based on Foata normal form. 36/39109 useless extension candidates. Maximal degree in co-relation 169842. Up to 17702 conditions per place. [2024-05-12 12:54:31,799 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 215 selfloop transitions, 17 changer transitions 0/235 dead transitions. [2024-05-12 12:54:31,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 235 transitions, 3712 flow [2024-05-12 12:54:31,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:54:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:54:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-05-12 12:54:31,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-05-12 12:54:31,800 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 1350 flow. Second operand 4 states and 126 transitions. [2024-05-12 12:54:31,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 235 transitions, 3712 flow [2024-05-12 12:54:34,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 235 transitions, 3694 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 12:54:34,249 INFO L231 Difference]: Finished difference. Result has 90 places, 108 transitions, 1425 flow [2024-05-12 12:54:34,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1425, PETRI_PLACES=90, PETRI_TRANSITIONS=108} [2024-05-12 12:54:34,249 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 41 predicate places. [2024-05-12 12:54:34,249 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 108 transitions, 1425 flow [2024-05-12 12:54:34,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:34,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:34,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:34,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:34,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:34,466 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:34,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:34,467 INFO L85 PathProgramCache]: Analyzing trace with hash -988889537, now seen corresponding path program 2 times [2024-05-12 12:54:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:34,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132410265] [2024-05-12 12:54:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:34,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132410265] [2024-05-12 12:54:34,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132410265] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:34,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:34,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:54:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509647378] [2024-05-12 12:54:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:34,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:54:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:34,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:54:34,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:54:34,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-05-12 12:54:34,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 108 transitions, 1425 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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-05-12 12:54:34,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:34,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-05-12 12:54:34,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:37,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), 18#L56true, Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), 109#true, Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 244#true, 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, 132#(<= ~counter~0 1), Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), 434#(<= ~N1~0 ~i1~0), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 386#(< ~j1~0 ~M1~0), 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 31#L99-3true, Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:37,790 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-05-12 12:54:37,790 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-05-12 12:54:37,790 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-05-12 12:54:37,790 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-05-12 12:54:38,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), 18#L56true, Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 244#true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 5#thread4EXITtrue, Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), 31#L99-3true, Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,003 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-05-12 12:54:38,003 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-05-12 12:54:38,003 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-05-12 12:54:38,003 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-05-12 12:54:38,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), 109#true, Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 244#true, 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 23#L52true, 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 31#L99-3true, Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,059 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,059 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,059 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,059 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), 24#thread2EXITtrue, Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), 109#true, Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 244#true, 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), 434#(<= ~N1~0 ~i1~0), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 386#(< ~j1~0 ~M1~0), 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 31#L99-3true, Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,061 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,061 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,061 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,061 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), 18#L56true, Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), 109#true, Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 7#L100-1true, 244#true, 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,065 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,065 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,065 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,065 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-05-12 12:54:38,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 244#true, 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 23#L52true, 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 5#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 31#L99-3true, Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,197 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,197 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,198 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,198 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), 24#thread2EXITtrue, Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 244#true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 5#thread4EXITtrue, Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), 31#L99-3true, Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,198 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,198 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,199 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,199 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), 18#L56true, Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 244#true, 7#L100-1true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, 132#(<= ~counter~0 1), Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), 434#(<= ~N1~0 ~i1~0), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 386#(< ~j1~0 ~M1~0), 5#thread4EXITtrue, Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,200 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,200 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,200 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,200 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:54:38,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 7#L100-1true, 244#true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 23#L52true, 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,233 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-05-12 12:54:38,233 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-05-12 12:54:38,234 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-05-12 12:54:38,234 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-05-12 12:54:38,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), 24#thread2EXITtrue, Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 7#L100-1true, 244#true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,235 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-05-12 12:54:38,235 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-05-12 12:54:38,235 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-05-12 12:54:38,236 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-05-12 12:54:38,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 244#true, 7#L100-1true, 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 23#L52true, 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 5#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,313 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,313 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,313 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,313 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), 24#thread2EXITtrue, Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 244#true, 7#L100-1true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 5#thread4EXITtrue, Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,313 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,314 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,314 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,314 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 244#true, 46#L100-2true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 25#L79true, Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,314 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,314 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,314 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,315 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 12:54:38,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 244#true, 46#L100-2true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 5#thread4EXITtrue, Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,389 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-05-12 12:54:38,389 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-05-12 12:54:38,390 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-05-12 12:54:38,390 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-05-12 12:54:38,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), 32#L101-1true, Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 244#true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 25#L79true, Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,390 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-05-12 12:54:38,390 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-05-12 12:54:38,390 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-05-12 12:54:38,390 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-05-12 12:54:38,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([404] L64-->L67: Formula: (and (= (+ v_~counter~0_62 1) v_~counter~0_61) (= v_~j1~0_22 (+ v_~j1~0_23 1))) InVars {~counter~0=v_~counter~0_62, ~j1~0=v_~j1~0_23} OutVars{~counter~0=v_~counter~0_61, ~j1~0=v_~j1~0_22, thread3Thread1of1ForFork3_#t~post6=|v_thread3Thread1of1ForFork3_#t~post6_1|, thread3Thread1of1ForFork3_#t~post5=|v_thread3Thread1of1ForFork3_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, ~j1~0, thread3Thread1of1ForFork3_#t~post6, thread3Thread1of1ForFork3_#t~post5][89], [Black: 127#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 63#(= ~counter~0 0), Black: 69#(and (= ~j2~0 0) (= ~j1~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 32#L101-1true, Black: 131#(= ~counter~0 0), Black: 74#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (= ~i2~0 0)), 109#true, Black: 141#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 80#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 148#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 85#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 86#(and (<= 1 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 242#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), 244#true, Black: 155#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 8#L67true, Black: 161#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (<= 1 ~j2~0) (= ~i2~0 0)), 132#(<= ~counter~0 1), Black: 162#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 100#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 417#(or (< ~N1~0 (+ ~i1~0 1)) (< ~j1~0 ~M1~0)), Black: 107#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 434#(<= ~N1~0 ~i1~0), Black: 386#(< ~j1~0 ~M1~0), 5#thread4EXITtrue, Black: 238#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 |#ghost~multithreaded|) (<= 1 ~i2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 0 ~i1~0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 121#(and (<= 1 ~j2~0) (= ~j1~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (<= 0 ~i1~0) (= ~j2~0 0) (= ~j1~0 0) (= ~i2~0 0))]) [2024-05-12 12:54:38,432 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-05-12 12:54:38,432 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 12:54:38,432 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 12:54:38,432 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 12:54:38,500 INFO L124 PetriNetUnfolderBase]: 38900/54641 cut-off events. [2024-05-12 12:54:38,500 INFO L125 PetriNetUnfolderBase]: For 526030/527905 co-relation queries the response was YES. [2024-05-12 12:54:38,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252335 conditions, 54641 events. 38900/54641 cut-off events. For 526030/527905 co-relation queries the response was YES. Maximal size of possible extension queue 2281. Compared 358064 event pairs, 6834 based on Foata normal form. 695/51101 useless extension candidates. Maximal degree in co-relation 229512. Up to 17333 conditions per place. [2024-05-12 12:54:39,132 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 188 selfloop transitions, 48 changer transitions 0/241 dead transitions. [2024-05-12 12:54:39,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 241 transitions, 3510 flow [2024-05-12 12:54:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:54:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:54:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-05-12 12:54:39,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-05-12 12:54:39,133 INFO L175 Difference]: Start difference. First operand has 90 places, 108 transitions, 1425 flow. Second operand 5 states and 150 transitions. [2024-05-12 12:54:39,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 241 transitions, 3510 flow [2024-05-12 12:54:42,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 241 transitions, 3510 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 12:54:42,118 INFO L231 Difference]: Finished difference. Result has 96 places, 134 transitions, 2043 flow [2024-05-12 12:54:42,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2043, PETRI_PLACES=96, PETRI_TRANSITIONS=134} [2024-05-12 12:54:42,118 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2024-05-12 12:54:42,118 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 134 transitions, 2043 flow [2024-05-12 12:54:42,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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-05-12 12:54:42,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:42,119 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] [2024-05-12 12:54:42,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:54:42,119 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:54:42,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:42,119 INFO L85 PathProgramCache]: Analyzing trace with hash -978041355, now seen corresponding path program 3 times [2024-05-12 12:54:42,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:42,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260574533] [2024-05-12 12:54:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:42,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:42,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260574533] [2024-05-12 12:54:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260574533] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:42,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:42,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:54:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225005946] [2024-05-12 12:54:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:42,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:54:42,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:42,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:54:42,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:54:42,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-05-12 12:54:42,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 134 transitions, 2043 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:42,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:42,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-05-12 12:54:42,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:46,596 INFO L124 PetriNetUnfolderBase]: 29441/41644 cut-off events. [2024-05-12 12:54:46,597 INFO L125 PetriNetUnfolderBase]: For 445167/445466 co-relation queries the response was YES. [2024-05-12 12:54:46,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208864 conditions, 41644 events. 29441/41644 cut-off events. For 445167/445466 co-relation queries the response was YES. Maximal size of possible extension queue 1758. Compared 266359 event pairs, 9360 based on Foata normal form. 74/41718 useless extension candidates. Maximal degree in co-relation 188813. Up to 39313 conditions per place.