./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.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-more-buffer-series2.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-more-buffer-series2.wvr.c ./goblint.2024-05-07_14-17-48.files/protection/popl20-more-buffer-series2.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:53:26,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:53:26,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:53:26,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:53:26,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:53:26,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:53:26,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:53:26,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:53:26,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:53:26,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:53:26,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:53:26,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:53:26,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:53:26,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:53:26,375 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:53:26,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:53:26,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:53:26,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:53:26,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:53:26,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:53:26,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:53:26,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:53:26,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:53:26,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:53:26,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:53:26,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:53:26,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:53:26,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:53:26,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:53:26,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:53:26,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:53:26,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:53:26,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:53:26,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:53:26,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:53:26,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:53:26,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:53:26,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:53:26,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:53:26,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:53:26,383 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:53:26,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:53:26,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:53:26,384 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:53:26,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:53:26,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:53:26,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:53:26,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:53:26,667 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:53:26,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-05-12 12:53:27,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:53:28,098 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:53:28,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-05-12 12:53:28,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4fdd439/b79ad433cf6d49398c7ca397df856425/FLAG042189e6a [2024-05-12 12:53:28,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4fdd439/b79ad433cf6d49398c7ca397df856425 [2024-05-12 12:53:28,120 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:53:28,121 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:53:28,121 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-more-buffer-series2.wvr.yml/witness.yml [2024-05-12 12:53:28,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:53:28,200 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:53:28,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:53:28,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:53:28,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:53:28,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:53:28" (1/2) ... [2024-05-12 12:53:28,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afd8999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:28, skipping insertion in model container [2024-05-12 12:53:28,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:53:28" (1/2) ... [2024-05-12 12:53:28,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d0427ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:53:28, skipping insertion in model container [2024-05-12 12:53:28,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:53:28" (2/2) ... [2024-05-12 12:53:28,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afd8999 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28, skipping insertion in model container [2024-05-12 12:53:28,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:53:28" (2/2) ... [2024-05-12 12:53:28,209 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:53:28,225 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:53:28,229 INFO L97 edCorrectnessWitness]: Location invariant before [L142-L142] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-05-12 12:53:28,229 INFO L97 edCorrectnessWitness]: Location invariant before [L145-L145] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-05-12 12:53:28,229 INFO L97 edCorrectnessWitness]: Location invariant before [L144-L144] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-05-12 12:53:28,229 INFO L97 edCorrectnessWitness]: Location invariant before [L143-L143] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-05-12 12:53:28,229 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:53:28,230 INFO L106 edCorrectnessWitness]: ghost_update [L141-L141] multithreaded = 1; [2024-05-12 12:53:28,255 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:53:28,454 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-more-buffer-series2.wvr.c[4232,4245] [2024-05-12 12:53:28,464 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:53:28,471 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:53:28,546 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-more-buffer-series2.wvr.c[4232,4245] [2024-05-12 12:53:28,551 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:53:28,567 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:53:28,567 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28 WrapperNode [2024-05-12 12:53:28,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:53:28,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:53:28,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:53:28,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:53:28,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,616 INFO L138 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 363 [2024-05-12 12:53:28,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:53:28,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:53:28,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:53:28,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:53:28,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,657 INFO L175 MemorySlicer]: Split 20 memory accesses to 6 slices as follows [2, 2, 2, 2, 10, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 1, 1, 3, 1]. [2024-05-12 12:53:28,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:53:28,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:53:28,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:53:28,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:53:28,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (1/1) ... [2024-05-12 12:53:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:53:28,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:53:28,720 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:53:28,735 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:53:28,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:53:28,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:53:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:53:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:53:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:53:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 12:53:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 12:53:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-05-12 12:53:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 12:53:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 12:53:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 12:53:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 12:53:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 12:53:28,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-05-12 12:53:28,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-12 12:53:28,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-12 12:53:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-12 12:53:28,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-12 12:53:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-12 12:53:28,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-12 12:53:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-12 12:53:28,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-12 12:53:28,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:53:28,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:53:28,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:53:28,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 12:53:28,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 12:53:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-05-12 12:53:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:53:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:53:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-12 12:53:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:53:28,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:53:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:53:28,770 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:53:28,917 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:53:28,920 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:53:29,449 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:53:29,449 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:53:29,888 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:53:29,889 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-05-12 12:53:29,891 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:53:29 BoogieIcfgContainer [2024-05-12 12:53:29,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:53:29,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:53:29,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:53:29,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:53:29,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:53:28" (1/4) ... [2024-05-12 12:53:29,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e595c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:53:29, skipping insertion in model container [2024-05-12 12:53:29,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:53:28" (2/4) ... [2024-05-12 12:53:29,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e595c16 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:53:29, skipping insertion in model container [2024-05-12 12:53:29,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:53:28" (3/4) ... [2024-05-12 12:53:29,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e595c16 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:53:29, skipping insertion in model container [2024-05-12 12:53:29,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:53:29" (4/4) ... [2024-05-12 12:53:29,902 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-05-12 12:53:29,923 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:53:29,924 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 12:53:29,924 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:53:29,994 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-12 12:53:30,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 146 flow [2024-05-12 12:53:30,089 INFO L124 PetriNetUnfolderBase]: 7/55 cut-off events. [2024-05-12 12:53:30,089 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-05-12 12:53:30,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 7/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-05-12 12:53:30,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 59 transitions, 146 flow [2024-05-12 12:53:30,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 54 transitions, 132 flow [2024-05-12 12:53:30,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:53:30,123 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;@79c342c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:53:30,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 12:53:30,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:53:30,133 INFO L124 PetriNetUnfolderBase]: 3/14 cut-off events. [2024-05-12 12:53:30,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:53:30,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:30,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:30,136 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:53:30,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash -993038455, now seen corresponding path program 1 times [2024-05-12 12:53:30,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:30,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858727791] [2024-05-12 12:53:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:30,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:30,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858727791] [2024-05-12 12:53:30,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858727791] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:30,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:30,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:53:30,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705249009] [2024-05-12 12:53:30,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:30,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:53:30,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:30,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:53:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:53:30,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-05-12 12:53:30,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:30,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:30,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-05-12 12:53:30,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:31,400 INFO L124 PetriNetUnfolderBase]: 2178/3384 cut-off events. [2024-05-12 12:53:31,401 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-05-12 12:53:31,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6463 conditions, 3384 events. 2178/3384 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 19482 event pairs, 439 based on Foata normal form. 0/3162 useless extension candidates. Maximal degree in co-relation 5474. Up to 2278 conditions per place. [2024-05-12 12:53:31,435 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 65 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-05-12 12:53:31,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 343 flow [2024-05-12 12:53:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-05-12 12:53:31,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2024-05-12 12:53:31,450 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 132 flow. Second operand 3 states and 123 transitions. [2024-05-12 12:53:31,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 343 flow [2024-05-12 12:53:31,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 313 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:53:31,464 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 141 flow [2024-05-12 12:53:31,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2024-05-12 12:53:31,469 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2024-05-12 12:53:31,469 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 141 flow [2024-05-12 12:53:31,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:31,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:31,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:31,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:53:31,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:31,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:31,471 INFO L85 PathProgramCache]: Analyzing trace with hash 127942173, now seen corresponding path program 1 times [2024-05-12 12:53:31,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:31,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842964579] [2024-05-12 12:53:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:31,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:31,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:31,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842964579] [2024-05-12 12:53:31,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842964579] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:31,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:31,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:53:31,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112292321] [2024-05-12 12:53:31,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:31,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:53:31,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:31,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:53:31,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:53:31,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-05-12 12:53:31,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:53:31,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:31,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-05-12 12:53:31,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:32,237 INFO L124 PetriNetUnfolderBase]: 2266/3567 cut-off events. [2024-05-12 12:53:32,237 INFO L125 PetriNetUnfolderBase]: For 651/729 co-relation queries the response was YES. [2024-05-12 12:53:32,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7702 conditions, 3567 events. 2266/3567 cut-off events. For 651/729 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 21382 event pairs, 425 based on Foata normal form. 54/3532 useless extension candidates. Maximal degree in co-relation 1331. Up to 1689 conditions per place. [2024-05-12 12:53:32,264 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 87 selfloop transitions, 4 changer transitions 0/104 dead transitions. [2024-05-12 12:53:32,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 104 transitions, 434 flow [2024-05-12 12:53:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:53:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:53:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-05-12 12:53:32,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.690677966101695 [2024-05-12 12:53:32,272 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 141 flow. Second operand 4 states and 163 transitions. [2024-05-12 12:53:32,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 104 transitions, 434 flow [2024-05-12 12:53:32,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 104 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:53:32,276 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 156 flow [2024-05-12 12:53:32,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2024-05-12 12:53:32,276 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2024-05-12 12:53:32,277 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 156 flow [2024-05-12 12:53:32,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:53:32,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:32,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:32,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:53:32,278 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:53:32,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 865439839, now seen corresponding path program 1 times [2024-05-12 12:53:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:32,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564962019] [2024-05-12 12:53:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:32,403 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:53:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564962019] [2024-05-12 12:53:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564962019] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:32,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:32,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:53:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250835685] [2024-05-12 12:53:32,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:32,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:53:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:53:32,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:53:32,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-05-12 12:53:32,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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:53:32,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:32,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-05-12 12:53:32,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:32,942 INFO L124 PetriNetUnfolderBase]: 2416/3910 cut-off events. [2024-05-12 12:53:32,943 INFO L125 PetriNetUnfolderBase]: For 1976/2080 co-relation queries the response was YES. [2024-05-12 12:53:32,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8773 conditions, 3910 events. 2416/3910 cut-off events. For 1976/2080 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24887 event pairs, 552 based on Foata normal form. 52/3877 useless extension candidates. Maximal degree in co-relation 3341. Up to 1932 conditions per place. [2024-05-12 12:53:33,011 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 88 selfloop transitions, 4 changer transitions 0/105 dead transitions. [2024-05-12 12:53:33,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 457 flow [2024-05-12 12:53:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:53:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:53:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2024-05-12 12:53:33,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864406779661016 [2024-05-12 12:53:33,015 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 156 flow. Second operand 4 states and 162 transitions. [2024-05-12 12:53:33,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 457 flow [2024-05-12 12:53:33,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 105 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:53:33,021 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 172 flow [2024-05-12 12:53:33,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-05-12 12:53:33,022 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-05-12 12:53:33,022 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 172 flow [2024-05-12 12:53:33,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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:53:33,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:33,023 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:53:33,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:53:33,023 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:33,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash 272765939, now seen corresponding path program 1 times [2024-05-12 12:53:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947120663] [2024-05-12 12:53:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:33,152 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:53:33,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:33,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947120663] [2024-05-12 12:53:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947120663] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:33,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:33,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:53:33,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200895925] [2024-05-12 12:53:33,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:33,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:53:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:33,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:53:33,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:53:33,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:53:33,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 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:53:33,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:33,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:53:33,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:33,694 INFO L124 PetriNetUnfolderBase]: 2988/4460 cut-off events. [2024-05-12 12:53:33,694 INFO L125 PetriNetUnfolderBase]: For 3943/3955 co-relation queries the response was YES. [2024-05-12 12:53:33,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10767 conditions, 4460 events. 2988/4460 cut-off events. For 3943/3955 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26329 event pairs, 2354 based on Foata normal form. 234/4540 useless extension candidates. Maximal degree in co-relation 5925. Up to 3183 conditions per place. [2024-05-12 12:53:33,726 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 73 selfloop transitions, 7 changer transitions 0/96 dead transitions. [2024-05-12 12:53:33,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 427 flow [2024-05-12 12:53:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:53:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:53:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-05-12 12:53:33,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6169491525423729 [2024-05-12 12:53:33,728 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 172 flow. Second operand 5 states and 182 transitions. [2024-05-12 12:53:33,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 427 flow [2024-05-12 12:53:33,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:53:33,732 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 222 flow [2024-05-12 12:53:33,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-05-12 12:53:33,734 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-05-12 12:53:33,734 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 222 flow [2024-05-12 12:53:33,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 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:53:33,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:33,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:33,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:53:33,735 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:33,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1741305908, now seen corresponding path program 1 times [2024-05-12 12:53:33,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:33,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91842361] [2024-05-12 12:53:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:53:33,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:33,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91842361] [2024-05-12 12:53:33,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91842361] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:33,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:33,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:53:33,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879106574] [2024-05-12 12:53:33,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:33,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:53:33,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:33,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:53:33,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:53:33,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:53:33,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:33,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:33,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:53:33,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:34,518 INFO L124 PetriNetUnfolderBase]: 3817/5864 cut-off events. [2024-05-12 12:53:34,518 INFO L125 PetriNetUnfolderBase]: For 4671/4671 co-relation queries the response was YES. [2024-05-12 12:53:34,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14220 conditions, 5864 events. 3817/5864 cut-off events. For 4671/4671 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 37640 event pairs, 3110 based on Foata normal form. 268/5974 useless extension candidates. Maximal degree in co-relation 11320. Up to 4115 conditions per place. [2024-05-12 12:53:34,557 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 77 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2024-05-12 12:53:34,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 492 flow [2024-05-12 12:53:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:53:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:53:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2024-05-12 12:53:34,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6567796610169492 [2024-05-12 12:53:34,559 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 222 flow. Second operand 4 states and 155 transitions. [2024-05-12 12:53:34,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 492 flow [2024-05-12 12:53:34,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 488 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 12:53:34,565 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 252 flow [2024-05-12 12:53:34,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-05-12 12:53:34,566 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2024-05-12 12:53:34,566 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 252 flow [2024-05-12 12:53:34,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:34,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:34,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:34,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:53:34,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:34,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash -860841696, now seen corresponding path program 1 times [2024-05-12 12:53:34,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:34,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555529785] [2024-05-12 12:53:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:34,682 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:53:34,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:34,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555529785] [2024-05-12 12:53:34,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555529785] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:34,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:34,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:53:34,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100328915] [2024-05-12 12:53:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:34,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:34,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:34,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:34,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:53:34,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-05-12 12:53:34,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:53:34,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:34,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-05-12 12:53:34,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:35,679 INFO L124 PetriNetUnfolderBase]: 4421/7471 cut-off events. [2024-05-12 12:53:35,679 INFO L125 PetriNetUnfolderBase]: For 5432/5536 co-relation queries the response was YES. [2024-05-12 12:53:35,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17846 conditions, 7471 events. 4421/7471 cut-off events. For 5432/5536 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 54320 event pairs, 1206 based on Foata normal form. 52/7385 useless extension candidates. Maximal degree in co-relation 14695. Up to 2379 conditions per place. [2024-05-12 12:53:35,729 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 120 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2024-05-12 12:53:35,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 687 flow [2024-05-12 12:53:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:53:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:53:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2024-05-12 12:53:35,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.688135593220339 [2024-05-12 12:53:35,731 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 252 flow. Second operand 5 states and 203 transitions. [2024-05-12 12:53:35,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 687 flow [2024-05-12 12:53:35,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 137 transitions, 677 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-05-12 12:53:35,743 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 257 flow [2024-05-12 12:53:35,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-05-12 12:53:35,746 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2024-05-12 12:53:35,746 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 257 flow [2024-05-12 12:53:35,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:53:35,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:35,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:35,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:53:35,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:35,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash -241314696, now seen corresponding path program 2 times [2024-05-12 12:53:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:35,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754169137] [2024-05-12 12:53:35,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:35,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:35,895 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:53:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754169137] [2024-05-12 12:53:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754169137] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:35,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:35,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:53:35,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103577623] [2024-05-12 12:53:35,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:35,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:35,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:35,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:35,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:53:35,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-05-12 12:53:35,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:53:35,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:35,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-05-12 12:53:35,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:36,862 INFO L124 PetriNetUnfolderBase]: 4261/7223 cut-off events. [2024-05-12 12:53:36,862 INFO L125 PetriNetUnfolderBase]: For 7103/7103 co-relation queries the response was YES. [2024-05-12 12:53:36,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17496 conditions, 7223 events. 4261/7223 cut-off events. For 7103/7103 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 52415 event pairs, 1172 based on Foata normal form. 52/7154 useless extension candidates. Maximal degree in co-relation 14717. Up to 2199 conditions per place. [2024-05-12 12:53:36,913 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 117 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2024-05-12 12:53:36,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 134 transitions, 656 flow [2024-05-12 12:53:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:53:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:53:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-05-12 12:53:36,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-05-12 12:53:36,915 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 257 flow. Second operand 5 states and 200 transitions. [2024-05-12 12:53:36,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 134 transitions, 656 flow [2024-05-12 12:53:36,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 134 transitions, 648 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 12:53:36,933 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 227 flow [2024-05-12 12:53:36,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-05-12 12:53:36,934 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2024-05-12 12:53:36,934 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 227 flow [2024-05-12 12:53:36,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:53:36,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:36,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:36,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:53:36,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:36,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash -992473556, now seen corresponding path program 1 times [2024-05-12 12:53:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:36,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419788946] [2024-05-12 12:53:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:36,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:53:37,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419788946] [2024-05-12 12:53:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419788946] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:37,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:37,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:53:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823828769] [2024-05-12 12:53:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:37,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:53:37,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:37,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:53:37,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:53:37,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:53:37,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:37,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:37,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:53:37,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:38,102 INFO L124 PetriNetUnfolderBase]: 6905/11044 cut-off events. [2024-05-12 12:53:38,102 INFO L125 PetriNetUnfolderBase]: For 9706/9706 co-relation queries the response was YES. [2024-05-12 12:53:38,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26564 conditions, 11044 events. 6905/11044 cut-off events. For 9706/9706 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 75628 event pairs, 1924 based on Foata normal form. 10/10798 useless extension candidates. Maximal degree in co-relation 22464. Up to 5839 conditions per place. [2024-05-12 12:53:38,168 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 69 selfloop transitions, 3 changer transitions 1/86 dead transitions. [2024-05-12 12:53:38,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 86 transitions, 469 flow [2024-05-12 12:53:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-05-12 12:53:38,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6836158192090396 [2024-05-12 12:53:38,170 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 227 flow. Second operand 3 states and 121 transitions. [2024-05-12 12:53:38,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 86 transitions, 469 flow [2024-05-12 12:53:38,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 457 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 12:53:38,176 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 243 flow [2024-05-12 12:53:38,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-05-12 12:53:38,177 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2024-05-12 12:53:38,177 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 243 flow [2024-05-12 12:53:38,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:38,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:38,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:38,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:53:38,178 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:38,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash -25238435, now seen corresponding path program 1 times [2024-05-12 12:53:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:38,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978013795] [2024-05-12 12:53:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:53:38,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:38,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978013795] [2024-05-12 12:53:38,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978013795] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:38,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:38,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:53:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713569882] [2024-05-12 12:53:38,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:38,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:53:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:38,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:53:38,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:53:38,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:53:38,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:38,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:38,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:53:38,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:39,226 INFO L124 PetriNetUnfolderBase]: 5899/9347 cut-off events. [2024-05-12 12:53:39,226 INFO L125 PetriNetUnfolderBase]: For 9285/9285 co-relation queries the response was YES. [2024-05-12 12:53:39,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24156 conditions, 9347 events. 5899/9347 cut-off events. For 9285/9285 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 62431 event pairs, 2276 based on Foata normal form. 110/9261 useless extension candidates. Maximal degree in co-relation 20811. Up to 4647 conditions per place. [2024-05-12 12:53:39,292 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 71 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2024-05-12 12:53:39,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 458 flow [2024-05-12 12:53:39,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-05-12 12:53:39,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7005649717514124 [2024-05-12 12:53:39,294 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 243 flow. Second operand 3 states and 124 transitions. [2024-05-12 12:53:39,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 458 flow [2024-05-12 12:53:39,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:53:39,308 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 253 flow [2024-05-12 12:53:39,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2024-05-12 12:53:39,308 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2024-05-12 12:53:39,309 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 253 flow [2024-05-12 12:53:39,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:39,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:39,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:39,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:53:39,310 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:39,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:39,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1120355481, now seen corresponding path program 1 times [2024-05-12 12:53:39,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:39,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850881757] [2024-05-12 12:53:39,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:53:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850881757] [2024-05-12 12:53:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850881757] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:39,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:53:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825048028] [2024-05-12 12:53:39,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:39,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:53:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:39,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:53:39,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:53:39,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-05-12 12:53:39,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:39,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:39,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-05-12 12:53:39,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:40,106 INFO L124 PetriNetUnfolderBase]: 4819/7727 cut-off events. [2024-05-12 12:53:40,107 INFO L125 PetriNetUnfolderBase]: For 9168/9168 co-relation queries the response was YES. [2024-05-12 12:53:40,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20070 conditions, 7727 events. 4819/7727 cut-off events. For 9168/9168 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 50208 event pairs, 1872 based on Foata normal form. 168/7705 useless extension candidates. Maximal degree in co-relation 16705. Up to 4199 conditions per place. [2024-05-12 12:53:40,149 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 74 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2024-05-12 12:53:40,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 484 flow [2024-05-12 12:53:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:53:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:53:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-05-12 12:53:40,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7175141242937854 [2024-05-12 12:53:40,151 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 253 flow. Second operand 3 states and 127 transitions. [2024-05-12 12:53:40,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 484 flow [2024-05-12 12:53:40,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 470 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 12:53:40,165 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 256 flow [2024-05-12 12:53:40,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-05-12 12:53:40,166 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2024-05-12 12:53:40,166 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 256 flow [2024-05-12 12:53:40,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:40,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:40,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:40,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:53:40,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:40,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1904943618, now seen corresponding path program 1 times [2024-05-12 12:53:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:40,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099581630] [2024-05-12 12:53:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-12 12:53:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:40,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099581630] [2024-05-12 12:53:40,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099581630] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:40,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:40,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:53:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829180951] [2024-05-12 12:53:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:40,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:53:40,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:53:40,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:53:40,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-05-12 12:53:40,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:40,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:40,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-05-12 12:53:40,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:41,834 INFO L124 PetriNetUnfolderBase]: 12227/18397 cut-off events. [2024-05-12 12:53:41,834 INFO L125 PetriNetUnfolderBase]: For 18192/18264 co-relation queries the response was YES. [2024-05-12 12:53:41,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47141 conditions, 18397 events. 12227/18397 cut-off events. For 18192/18264 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 127202 event pairs, 4686 based on Foata normal form. 16/17371 useless extension candidates. Maximal degree in co-relation 39475. Up to 7543 conditions per place. [2024-05-12 12:53:41,949 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 117 selfloop transitions, 10 changer transitions 1/138 dead transitions. [2024-05-12 12:53:41,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 751 flow [2024-05-12 12:53:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:53:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:53:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2024-05-12 12:53:41,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2024-05-12 12:53:41,951 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 256 flow. Second operand 6 states and 219 transitions. [2024-05-12 12:53:41,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 751 flow [2024-05-12 12:53:41,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 138 transitions, 725 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-05-12 12:53:41,976 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 287 flow [2024-05-12 12:53:41,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-05-12 12:53:41,977 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2024-05-12 12:53:41,977 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 287 flow [2024-05-12 12:53:41,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:41,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:41,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:41,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:53:41,978 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:41,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash -89787151, now seen corresponding path program 1 times [2024-05-12 12:53:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:41,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080744973] [2024-05-12 12:53:41,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-12 12:53:42,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:42,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080744973] [2024-05-12 12:53:42,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080744973] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:42,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:42,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:53:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480559406] [2024-05-12 12:53:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:42,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:53:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:42,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:53:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:53:42,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-05-12 12:53:42,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:42,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:42,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-05-12 12:53:42,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:43,566 INFO L124 PetriNetUnfolderBase]: 9255/14199 cut-off events. [2024-05-12 12:53:43,566 INFO L125 PetriNetUnfolderBase]: For 11542/11612 co-relation queries the response was YES. [2024-05-12 12:53:43,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35587 conditions, 14199 events. 9255/14199 cut-off events. For 11542/11612 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 94564 event pairs, 4078 based on Foata normal form. 12/13137 useless extension candidates. Maximal degree in co-relation 29510. Up to 7297 conditions per place. [2024-05-12 12:53:43,629 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 73 selfloop transitions, 8 changer transitions 42/133 dead transitions. [2024-05-12 12:53:43,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 133 transitions, 697 flow [2024-05-12 12:53:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:53:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:53:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2024-05-12 12:53:43,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.615819209039548 [2024-05-12 12:53:43,631 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 287 flow. Second operand 6 states and 218 transitions. [2024-05-12 12:53:43,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 133 transitions, 697 flow [2024-05-12 12:53:43,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 133 transitions, 690 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 12:53:43,651 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 286 flow [2024-05-12 12:53:43,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2024-05-12 12:53:43,652 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2024-05-12 12:53:43,652 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 286 flow [2024-05-12 12:53:43,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:43,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:43,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:43,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:53:43,653 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:43,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:43,653 INFO L85 PathProgramCache]: Analyzing trace with hash 697652753, now seen corresponding path program 1 times [2024-05-12 12:53:43,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:43,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484456069] [2024-05-12 12:53:43,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:43,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-12 12:53:43,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484456069] [2024-05-12 12:53:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484456069] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:53:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518755024] [2024-05-12 12:53:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:53:43,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:53:43,932 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:53:43,939 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:53:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:44,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-12 12:53:44,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:53:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-12 12:53:44,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:53:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-12 12:53:44,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518755024] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-12 12:53:44,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-12 12:53:44,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 14 [2024-05-12 12:53:44,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706677961] [2024-05-12 12:53:44,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:44,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:53:44,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:44,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:53:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-05-12 12:53:44,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-05-12 12:53:44,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 286 flow. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:53:44,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:44,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-05-12 12:53:44,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:46,466 INFO L124 PetriNetUnfolderBase]: 13993/20307 cut-off events. [2024-05-12 12:53:46,466 INFO L125 PetriNetUnfolderBase]: For 18378/18492 co-relation queries the response was YES. [2024-05-12 12:53:46,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53589 conditions, 20307 events. 13993/20307 cut-off events. For 18378/18492 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 131745 event pairs, 712 based on Foata normal form. 552/19849 useless extension candidates. Maximal degree in co-relation 46040. Up to 4161 conditions per place. [2024-05-12 12:53:46,580 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 199 selfloop transitions, 28 changer transitions 4/238 dead transitions. [2024-05-12 12:53:46,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 238 transitions, 1266 flow [2024-05-12 12:53:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-12 12:53:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-05-12 12:53:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 442 transitions. [2024-05-12 12:53:46,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4994350282485876 [2024-05-12 12:53:46,583 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 286 flow. Second operand 15 states and 442 transitions. [2024-05-12 12:53:46,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 238 transitions, 1266 flow [2024-05-12 12:53:46,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 238 transitions, 1235 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-05-12 12:53:46,656 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 443 flow [2024-05-12 12:53:46,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=443, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-05-12 12:53:46,657 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 38 predicate places. [2024-05-12 12:53:46,657 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 443 flow [2024-05-12 12:53:46,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:53:46,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:46,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:46,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-05-12 12:53:46,863 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,SelfDestructingSolverStorable12 [2024-05-12 12:53:46,864 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:46,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1162068854, now seen corresponding path program 1 times [2024-05-12 12:53:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:46,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687907015] [2024-05-12 12:53:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-12 12:53:47,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687907015] [2024-05-12 12:53:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687907015] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:47,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:47,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:53:47,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698667681] [2024-05-12 12:53:47,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:47,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:53:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:47,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:53:47,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:53:47,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-05-12 12:53:47,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:53:47,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:47,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-05-12 12:53:47,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:48,209 INFO L124 PetriNetUnfolderBase]: 7586/11430 cut-off events. [2024-05-12 12:53:48,209 INFO L125 PetriNetUnfolderBase]: For 36087/36281 co-relation queries the response was YES. [2024-05-12 12:53:48,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38351 conditions, 11430 events. 7586/11430 cut-off events. For 36087/36281 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 72454 event pairs, 1462 based on Foata normal form. 383/11530 useless extension candidates. Maximal degree in co-relation 38309. Up to 8145 conditions per place. [2024-05-12 12:53:48,273 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 83 selfloop transitions, 8 changer transitions 1/110 dead transitions. [2024-05-12 12:53:48,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 752 flow [2024-05-12 12:53:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:53:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:53:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-05-12 12:53:48,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254237288135594 [2024-05-12 12:53:48,275 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 443 flow. Second operand 6 states and 186 transitions. [2024-05-12 12:53:48,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 752 flow [2024-05-12 12:53:48,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 110 transitions, 685 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-05-12 12:53:48,379 INFO L231 Difference]: Finished difference. Result has 94 places, 77 transitions, 396 flow [2024-05-12 12:53:48,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=94, PETRI_TRANSITIONS=77} [2024-05-12 12:53:48,380 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 34 predicate places. [2024-05-12 12:53:48,380 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 77 transitions, 396 flow [2024-05-12 12:53:48,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:53:48,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:48,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:48,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:53:48,381 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:48,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1583306381, now seen corresponding path program 1 times [2024-05-12 12:53:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:48,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271513277] [2024-05-12 12:53:48,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:48,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-12 12:53:48,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:48,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271513277] [2024-05-12 12:53:48,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271513277] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:48,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:48,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:53:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944922537] [2024-05-12 12:53:48,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:48,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:53:48,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:53:48,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:53:48,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-05-12 12:53:48,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 77 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:48,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:48,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-05-12 12:53:48,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:49,892 INFO L124 PetriNetUnfolderBase]: 6973/10540 cut-off events. [2024-05-12 12:53:49,892 INFO L125 PetriNetUnfolderBase]: For 32525/32837 co-relation queries the response was YES. [2024-05-12 12:53:49,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36539 conditions, 10540 events. 6973/10540 cut-off events. For 32525/32837 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 67154 event pairs, 1229 based on Foata normal form. 484/10751 useless extension candidates. Maximal degree in co-relation 36499. Up to 6942 conditions per place. [2024-05-12 12:53:49,947 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 94 selfloop transitions, 13 changer transitions 0/125 dead transitions. [2024-05-12 12:53:49,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 125 transitions, 844 flow [2024-05-12 12:53:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:53:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:53:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2024-05-12 12:53:49,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230024213075061 [2024-05-12 12:53:49,949 INFO L175 Difference]: Start difference. First operand has 94 places, 77 transitions, 396 flow. Second operand 7 states and 216 transitions. [2024-05-12 12:53:49,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 125 transitions, 844 flow [2024-05-12 12:53:50,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 125 transitions, 794 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-05-12 12:53:50,033 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 446 flow [2024-05-12 12:53:50,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2024-05-12 12:53:50,034 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 33 predicate places. [2024-05-12 12:53:50,034 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 446 flow [2024-05-12 12:53:50,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:50,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:50,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:50,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:53:50,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:50,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1055778073, now seen corresponding path program 2 times [2024-05-12 12:53:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361955439] [2024-05-12 12:53:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-12 12:53:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361955439] [2024-05-12 12:53:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361955439] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:53:50,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064225066] [2024-05-12 12:53:50,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 12:53:50,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:53:50,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:53:50,308 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:53:50,330 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:53:50,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 12:53:50,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:53:50,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 5 conjunts are in the unsatisfiable core [2024-05-12 12:53:50,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:53:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-12 12:53:50,530 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-12 12:53:50,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064225066] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:50,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-12 12:53:50,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-05-12 12:53:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889041064] [2024-05-12 12:53:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:50,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:53:50,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-05-12 12:53:50,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 446 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:53:50,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:50,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-05-12 12:53:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:52,155 INFO L124 PetriNetUnfolderBase]: 10373/15456 cut-off events. [2024-05-12 12:53:52,155 INFO L125 PetriNetUnfolderBase]: For 48303/48780 co-relation queries the response was YES. [2024-05-12 12:53:52,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54044 conditions, 15456 events. 10373/15456 cut-off events. For 48303/48780 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 101483 event pairs, 1396 based on Foata normal form. 524/15660 useless extension candidates. Maximal degree in co-relation 54006. Up to 6075 conditions per place. [2024-05-12 12:53:52,281 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 112 selfloop transitions, 23 changer transitions 0/153 dead transitions. [2024-05-12 12:53:52,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 153 transitions, 1054 flow [2024-05-12 12:53:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:53:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:53:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-05-12 12:53:52,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.596045197740113 [2024-05-12 12:53:52,282 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 446 flow. Second operand 6 states and 211 transitions. [2024-05-12 12:53:52,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 153 transitions, 1054 flow [2024-05-12 12:53:52,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 153 transitions, 1039 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 12:53:52,338 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 635 flow [2024-05-12 12:53:52,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=635, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2024-05-12 12:53:52,339 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 39 predicate places. [2024-05-12 12:53:52,339 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 635 flow [2024-05-12 12:53:52,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:53:52,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:52,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:52,351 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:53:52,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-05-12 12:53:52,542 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:52,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1982559496, now seen corresponding path program 1 times [2024-05-12 12:53:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:52,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593382275] [2024-05-12 12:53:52,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-12 12:53:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593382275] [2024-05-12 12:53:52,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593382275] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:53:52,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370878350] [2024-05-12 12:53:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:52,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:53:52,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:53:52,780 INFO L229 MonitoredProcess]: Starting monitored process 4 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:53:52,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-12 12:53:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:52,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 12:53:52,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:53:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-12 12:53:52,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-12 12:53:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370878350] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:52,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-12 12:53:52,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-05-12 12:53:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583180380] [2024-05-12 12:53:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:52,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:53:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:52,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:53:52,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:53:52,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-05-12 12:53:52,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 635 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:53:52,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:52,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-05-12 12:53:52,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:53:54,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1030] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#4_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_115 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#4_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= v_~j~0_114 (+ v_~j~0_115 1)))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 447#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 54#L145true, 21#$Ultimate##0true, Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 8#L118true, Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 4#L52true, Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:53:54,078 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-05-12 12:53:54,078 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-05-12 12:53:54,079 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 12:53:54,079 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 12:53:54,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1030] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#4_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_115 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#4_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= v_~j~0_114 (+ v_~j~0_115 1)))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 447#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 54#L145true, Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 46#L100true, Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 8#L118true, Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 4#L52true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:53:54,315 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-05-12 12:53:54,316 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-05-12 12:53:54,316 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-05-12 12:53:54,316 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-05-12 12:53:54,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1030] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#4_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_115 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#4_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= v_~j~0_114 (+ v_~j~0_115 1)))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 447#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 50#L145-2true, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 21#$Ultimate##0true, Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 8#L118true, Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 4#L52true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:53:54,322 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-05-12 12:53:54,322 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-05-12 12:53:54,322 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-05-12 12:53:54,322 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-05-12 12:53:54,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1030] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#4_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_115 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#4_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= v_~j~0_114 (+ v_~j~0_115 1)))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 447#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 54#L145true, Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 8#L118true, Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 4#L52true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:53:54,584 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-05-12 12:53:54,584 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-05-12 12:53:54,584 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:53:54,584 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-05-12 12:53:54,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1030] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#4_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_115 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#4_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= v_~j~0_114 (+ v_~j~0_115 1)))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 447#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 50#L145-2true, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 46#L100true, Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 8#L118true, Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 4#L52true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:53:54,586 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-05-12 12:53:54,586 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-05-12 12:53:54,586 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:53:54,586 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-05-12 12:53:54,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1030] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#4_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_115 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#4_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= v_~j~0_114 (+ v_~j~0_115 1)))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 447#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 50#L145-2true, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 8#L118true, Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 4#L52true, Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:53:54,925 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 12:53:54,925 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-05-12 12:53:54,926 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-05-12 12:53:54,926 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:53:57,394 INFO L124 PetriNetUnfolderBase]: 24948/38692 cut-off events. [2024-05-12 12:53:57,394 INFO L125 PetriNetUnfolderBase]: For 218011/220592 co-relation queries the response was YES. [2024-05-12 12:53:57,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152963 conditions, 38692 events. 24948/38692 cut-off events. For 218011/220592 co-relation queries the response was YES. Maximal size of possible extension queue 1933. Compared 302048 event pairs, 5042 based on Foata normal form. 2306/39942 useless extension candidates. Maximal degree in co-relation 152921. Up to 11438 conditions per place. [2024-05-12 12:53:57,801 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 164 selfloop transitions, 13 changer transitions 0/200 dead transitions. [2024-05-12 12:53:57,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 200 transitions, 1825 flow [2024-05-12 12:53:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:53:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:53:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-05-12 12:53:57,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6101694915254238 [2024-05-12 12:53:57,806 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 635 flow. Second operand 6 states and 216 transitions. [2024-05-12 12:53:57,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 200 transitions, 1825 flow [2024-05-12 12:53:58,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 200 transitions, 1756 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-05-12 12:53:58,304 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 711 flow [2024-05-12 12:53:58,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2024-05-12 12:53:58,305 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 46 predicate places. [2024-05-12 12:53:58,305 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 711 flow [2024-05-12 12:53:58,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:53:58,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:53:58,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:53:58,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-12 12:53:58,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:53:58,517 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:53:58,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:53:58,518 INFO L85 PathProgramCache]: Analyzing trace with hash -274366196, now seen corresponding path program 2 times [2024-05-12 12:53:58,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:53:58,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234537942] [2024-05-12 12:53:58,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:53:58,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:53:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:53:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-12 12:53:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:53:59,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234537942] [2024-05-12 12:53:59,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234537942] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:53:59,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:53:59,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:53:59,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809434381] [2024-05-12 12:53:59,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:53:59,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:53:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:53:59,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:53:59,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:53:59,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-05-12 12:53:59,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 711 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:53:59,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:53:59,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-05-12 12:53:59,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:00,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1030] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#4_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_115 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#4_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= v_~j~0_114 (+ v_~j~0_115 1)))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][111], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 54#L145true, 21#$Ultimate##0true, Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 8#L118true, Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 4#L52true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 764#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:00,021 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-05-12 12:54:00,021 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 12:54:00,021 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-05-12 12:54:00,021 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 12:54:00,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1030] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#4_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_115 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#4_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= v_~j~0_114 (+ v_~j~0_115 1)))) InVars {~j~0=v_~j~0_115, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|} OutVars{~j~0=v_~j~0_114, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_110, #memory_int#4=|v_#memory_int#4_116|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][111], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 50#L145-2true, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 21#$Ultimate##0true, Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 8#L118true, Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 4#L52true, Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 764#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:00,203 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-05-12 12:54:00,203 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-05-12 12:54:00,203 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-05-12 12:54:00,203 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-05-12 12:54:04,993 INFO L124 PetriNetUnfolderBase]: 28965/44691 cut-off events. [2024-05-12 12:54:04,993 INFO L125 PetriNetUnfolderBase]: For 271118/273956 co-relation queries the response was YES. [2024-05-12 12:54:05,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190473 conditions, 44691 events. 28965/44691 cut-off events. For 271118/273956 co-relation queries the response was YES. Maximal size of possible extension queue 1971. Compared 347278 event pairs, 7840 based on Foata normal form. 2583/46059 useless extension candidates. Maximal degree in co-relation 190427. Up to 28187 conditions per place. [2024-05-12 12:54:05,467 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 148 selfloop transitions, 12 changer transitions 0/183 dead transitions. [2024-05-12 12:54:05,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 183 transitions, 1695 flow [2024-05-12 12:54:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:54:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:54:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-05-12 12:54:05,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5302663438256658 [2024-05-12 12:54:05,469 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 711 flow. Second operand 7 states and 219 transitions. [2024-05-12 12:54:05,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 183 transitions, 1695 flow [2024-05-12 12:54:06,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 183 transitions, 1674 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-05-12 12:54:06,102 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 790 flow [2024-05-12 12:54:06,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=790, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2024-05-12 12:54:06,102 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 53 predicate places. [2024-05-12 12:54:06,102 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 790 flow [2024-05-12 12:54:06,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:06,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:06,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:06,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:54:06,103 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:06,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash -862512660, now seen corresponding path program 1 times [2024-05-12 12:54:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:06,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338133274] [2024-05-12 12:54:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:08,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338133274] [2024-05-12 12:54:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338133274] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034956764] [2024-05-12 12:54:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:08,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:08,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:08,608 INFO L229 MonitoredProcess]: Starting monitored process 5 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:08,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-12 12:54:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:08,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 29 conjunts are in the unsatisfiable core [2024-05-12 12:54:08,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:09,379 INFO L349 Elim1Store]: treesize reduction 16, result has 69.8 percent of original size [2024-05-12 12:54:09,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 50 [2024-05-12 12:54:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-12 12:54:09,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:09,855 INFO L349 Elim1Store]: treesize reduction 19, result has 92.5 percent of original size [2024-05-12 12:54:09,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 250 [2024-05-12 12:54:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-12 12:54:15,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034956764] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:15,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:15,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2024-05-12 12:54:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257430520] [2024-05-12 12:54:15,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:15,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-05-12 12:54:15,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:15,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-05-12 12:54:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2024-05-12 12:54:16,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-05-12 12:54:16,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 790 flow. Second operand has 21 states, 21 states have (on average 21.61904761904762) internal successors, (454), 21 states have internal predecessors, (454), 0 states have call successors, (0), 0 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:16,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:16,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-05-12 12:54:16,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:22,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 373#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), 52#L58true, Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 38#L144-5true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:22,439 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-05-12 12:54:22,440 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:54:22,440 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-05-12 12:54:22,440 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:54:22,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 373#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 54#L145true, Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 139#true, 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), 52#L58true, Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:22,758 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-05-12 12:54:22,758 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-05-12 12:54:22,758 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:54:22,758 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:54:23,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 373#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 139#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), 52#L58true, Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 38#L144-5true, 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,247 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,247 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:23,247 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-05-12 12:54:23,247 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:23,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 110#(= ~total~0 0), 38#L144-5true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), 11#thread1EXITtrue, Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,248 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,249 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:23,249 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:23,249 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-05-12 12:54:23,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 50#L145-2true, 373#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 139#true, 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), 52#L58true, Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,250 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,250 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-05-12 12:54:23,250 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:23,250 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:23,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,478 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-05-12 12:54:23,478 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:23,478 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:54:23,478 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:23,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 373#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 54#L145true, Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 139#true, 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), 52#L58true, Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,523 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-05-12 12:54:23,523 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:23,523 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:23,523 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:54:23,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 54#L145true, Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), 11#thread1EXITtrue, Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,525 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-05-12 12:54:23,525 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:23,525 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:23,525 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:54:23,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 2#L145-3true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,832 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-05-12 12:54:23,832 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:23,832 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:54:23,832 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:23,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 38#L144-5true, 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 11#thread1EXITtrue]) [2024-05-12 12:54:23,875 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-05-12 12:54:23,875 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:23,875 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:54:23,875 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:23,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 50#L145-2true, 373#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 139#true, 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), 52#L58true, Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,876 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-05-12 12:54:23,876 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:23,876 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:54:23,876 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:23,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 50#L145-2true, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), 11#thread1EXITtrue, Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,877 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-05-12 12:54:23,877 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:54:23,877 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:23,877 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:23,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,961 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-05-12 12:54:23,961 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,961 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:54:23,962 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,965 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-05-12 12:54:23,965 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,965 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:54:23,965 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), 54#L145true, Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), 11#thread1EXITtrue, Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,989 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-05-12 12:54:23,989 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,989 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:54:23,989 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, 2#L145-3true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:23,990 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-05-12 12:54:23,990 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:23,990 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:54:23,991 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:24,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 2#L145-3true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,058 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,058 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,058 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:54:24,058 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 40#L146-2true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,059 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,059 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,059 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,059 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:54:24,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,060 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,060 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:54:24,060 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,061 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,062 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,062 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:54:24,062 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,062 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 50#L145-2true, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), 11#thread1EXITtrue, Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,078 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,078 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,078 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:54:24,079 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 45#L79true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,080 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,080 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,080 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-05-12 12:54:24,080 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 2#L145-3true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,129 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,129 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,130 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,130 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:54:24,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 2#L145-3true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,131 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,131 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:54:24,131 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,131 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,132 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,132 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,132 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,132 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:54:24,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 55#L147-1true]) [2024-05-12 12:54:24,133 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,133 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,133 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:54:24,133 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 46#L100true, Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,134 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,134 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,134 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:54:24,134 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, 2#L145-3true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,145 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,145 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-05-12 12:54:24,145 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,145 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,169 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,170 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,170 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:24,170 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,170 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,170 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:24,170 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,171 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 2#L145-3true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 46#L100true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,171 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,171 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:24,172 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,172 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 40#L146-2true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,172 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,172 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,172 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:24,172 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,173 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,173 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:24,173 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,173 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,180 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,180 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,180 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,180 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-05-12 12:54:24,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 40#L146-2true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,197 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,197 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:24,197 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,197 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 46#L100true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,198 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,198 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,198 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,198 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:24,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 17#L97true, 40#L146-2true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,199 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,199 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:24,199 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,200 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 2#L145-3true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,200 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,201 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,201 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:24,201 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 55#L147-1true]) [2024-05-12 12:54:24,202 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,202 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:24,202 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,202 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), 45#L79true, Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,203 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,203 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,203 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,203 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:24,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 40#L146-2true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,209 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,209 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,209 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-05-12 12:54:24,210 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-05-12 12:54:24,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 2#L145-3true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,222 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,222 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,222 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:24,222 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 55#L147-1true]) [2024-05-12 12:54:24,223 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,223 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,223 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,223 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:24,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,224 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,224 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:24,224 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,224 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 46#L100true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 40#L146-2true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,225 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,225 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:24,226 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,226 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 55#L147-1true]) [2024-05-12 12:54:24,227 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,227 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,227 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:24,227 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 14#L147-2true, 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,228 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,228 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,228 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,228 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:24,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L93-->L97: Formula: (let ((.cse0 (select (select |v_#memory_int#4_110| v_~q1~0.base_103) (+ (* 4 v_~q1_front~0_99) v_~q1~0.offset_103)))) (let ((.cse1 (+ .cse0 v_~total~0_98))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ .cse0 v_~total~0_98 2147483648))) 1 0) 0)) (= (+ v_~q1_front~0_99 1) v_~q1_front~0_98) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (not (= 0 (ite (and (< v_~q1_front~0_99 v_~q1_back~0_119) (< v_~q1_front~0_99 v_~n1~0_78) (<= 0 v_~q1_front~0_99)) 1 0))) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| v_~total~0_97) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_99, ~q1_back~0=v_~q1_back~0_119, ~n1~0=v_~n1~0_78, ~q1~0.base=v_~q1~0.base_103, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork3_#t~mem10#1=|v_thread3Thread1of1ForFork3_#t~mem10#1_1|, thread3Thread1of1ForFork3_#t~ret11#1=|v_thread3Thread1of1ForFork3_#t~ret11#1_1|, ~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_98, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_78, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#4=|v_#memory_int#4_110|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_1|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_119, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_1|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~mem10#1, thread3Thread1of1ForFork3_#t~ret11#1, ~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_#t~post12#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~total~0][205], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 139#true, Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 55#L147-1true]) [2024-05-12 12:54:24,234 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,234 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,234 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-05-12 12:54:24,234 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-05-12 12:54:24,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 47#thread2EXITtrue, 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 16#L146-1true, 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,407 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2024-05-12 12:54:24,407 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,407 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,407 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:24,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 57#thread3EXITtrue, 40#L146-2true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,408 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2024-05-12 12:54:24,408 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:24,409 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,409 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 46#L100true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 55#L147-1true]) [2024-05-12 12:54:24,410 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2024-05-12 12:54:24,410 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:24,410 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,410 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 651#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 35#L148-1true, Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,411 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2024-05-12 12:54:24,411 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-05-12 12:54:24,411 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,411 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-05-12 12:54:24,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 40#L146-2true, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,419 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2024-05-12 12:54:24,419 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,419 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,419 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), 57#thread3EXITtrue, Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 55#L147-1true]) [2024-05-12 12:54:24,420 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2024-05-12 12:54:24,420 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-05-12 12:54:24,420 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,420 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2024-05-12 12:54:24,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 17#L97true, 25#L115true, Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 55#L147-1true]) [2024-05-12 12:54:24,424 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2024-05-12 12:54:24,424 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,424 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,424 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 14#L147-2true, 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,425 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2024-05-12 12:54:24,425 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-05-12 12:54:24,426 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,426 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2024-05-12 12:54:24,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1040] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= (+ v_~total~0_88 .cse0) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (= v_~total~0_87 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][223], [Black: 765#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 767#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 139#true, Black: 123#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 448#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 70#(and (= ~j~0 0) (= ~i~0 0)), 107#(and (<= 1 ~i~0) (<= 1 ~j~0)), 602#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 75#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 80#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 84#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 567#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 600#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 93#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 651#(<= (+ ~q1_front~0 1) ~q1_back~0), 760#true, Black: 317#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 425#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 421#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 423#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 110#(= ~total~0 0), Black: 413#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 321#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 25#L115true, Black: 114#(= ~q2_back~0 ~q2_front~0), Black: 419#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 609#(<= ~q1_front~0 ~q1_back~0), 770#true, Black: 753#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 118#(<= ~q1_back~0 ~q1_front~0), Black: 755#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 35#L148-1true, Black: 441#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))]) [2024-05-12 12:54:24,428 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2024-05-12 12:54:24,428 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-05-12 12:54:24,428 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2024-05-12 12:54:24,428 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2024-05-12 12:54:24,429 INFO L124 PetriNetUnfolderBase]: 31134/49305 cut-off events. [2024-05-12 12:54:24,430 INFO L125 PetriNetUnfolderBase]: For 291902/298620 co-relation queries the response was YES. [2024-05-12 12:54:24,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211853 conditions, 49305 events. 31134/49305 cut-off events. For 291902/298620 co-relation queries the response was YES. Maximal size of possible extension queue 2333. Compared 403570 event pairs, 5502 based on Foata normal form. 4598/52197 useless extension candidates. Maximal degree in co-relation 196739. Up to 29045 conditions per place. [2024-05-12 12:54:25,097 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 213 selfloop transitions, 62 changer transitions 1/306 dead transitions. [2024-05-12 12:54:25,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 306 transitions, 2506 flow [2024-05-12 12:54:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-12 12:54:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-05-12 12:54:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 488 transitions. [2024-05-12 12:54:25,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4865403788634098 [2024-05-12 12:54:25,100 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 790 flow. Second operand 17 states and 488 transitions. [2024-05-12 12:54:25,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 306 transitions, 2506 flow [2024-05-12 12:54:26,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 306 transitions, 2473 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 12:54:26,022 INFO L231 Difference]: Finished difference. Result has 132 places, 157 transitions, 1461 flow [2024-05-12 12:54:26,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1461, PETRI_PLACES=132, PETRI_TRANSITIONS=157} [2024-05-12 12:54:26,023 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 72 predicate places. [2024-05-12 12:54:26,023 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 157 transitions, 1461 flow [2024-05-12 12:54:26,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 21.61904761904762) internal successors, (454), 21 states have internal predecessors, (454), 0 states have call successors, (0), 0 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:26,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:26,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:26,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:26,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:26,240 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:26,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1469514134, now seen corresponding path program 2 times [2024-05-12 12:54:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177452560] [2024-05-12 12:54:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:28,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:28,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177452560] [2024-05-12 12:54:28,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177452560] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:28,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822198018] [2024-05-12 12:54:28,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 12:54:28,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:28,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:28,073 INFO L229 MonitoredProcess]: Starting monitored process 6 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:28,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-12 12:54:28,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 12:54:28,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:28,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 51 conjunts are in the unsatisfiable core [2024-05-12 12:54:28,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:29,499 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-05-12 12:54:29,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 30 [2024-05-12 12:54:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:54:29,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:30,111 INFO L349 Elim1Store]: treesize reduction 19, result has 92.5 percent of original size [2024-05-12 12:54:30,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 250 [2024-05-12 12:54:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:54:33,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822198018] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:33,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:33,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2024-05-12 12:54:33,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14009841] [2024-05-12 12:54:33,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:33,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-12 12:54:33,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-12 12:54:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2024-05-12 12:54:34,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-05-12 12:54:34,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 157 transitions, 1461 flow. Second operand has 30 states, 30 states have (on average 20.366666666666667) internal successors, (611), 30 states have internal predecessors, (611), 0 states have call successors, (0), 0 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,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:34,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-05-12 12:54:34,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand