./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/popl20-more-buffer-series.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c ./goblint.2024-06-19_11-23-25.files/protection/popl20-more-buffer-series.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-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 19:12:15,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 19:12:15,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 19:12:15,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 19:12:15,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 19:12:15,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 19:12:15,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 19:12:15,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 19:12:15,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 19:12:15,832 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 19:12:15,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 19:12:15,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 19:12:15,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 19:12:15,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 19:12:15,835 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 19:12:15,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 19:12:15,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 19:12:15,835 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 19:12:15,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 19:12:15,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 19:12:15,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 19:12:15,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 19:12:15,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 19:12:15,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 19:12:15,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 19:12:15,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 19:12:15,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 19:12:15,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 19:12:15,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 19:12:15,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 19:12:15,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 19:12:15,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 19:12:15,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:12:15,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 19:12:15,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 19:12:15,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 19:12:15,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 19:12:15,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 19:12:15,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 19:12:15,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 19:12:15,842 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 19:12:15,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 19:12:15,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 19:12:15,843 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 19:12:16,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 19:12:16,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 19:12:16,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 19:12:16,089 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 19:12:16,089 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 19:12:16,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2024-06-27 19:12:17,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 19:12:17,372 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 19:12:17,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2024-06-27 19:12:17,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb434b07e/5dd1f13a1023482697d721cc823a2688/FLAG51c0f263b [2024-06-27 19:12:17,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb434b07e/5dd1f13a1023482697d721cc823a2688 [2024-06-27 19:12:17,402 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 19:12:17,402 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 19:12:17,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/popl20-more-buffer-series.wvr.yml/witness.yml [2024-06-27 19:12:17,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 19:12:17,494 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 19:12:17,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 19:12:17,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 19:12:17,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 19:12:17,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:12:17" (1/2) ... [2024-06-27 19:12:17,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656996fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:17, skipping insertion in model container [2024-06-27 19:12:17,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:12:17" (1/2) ... [2024-06-27 19:12:17,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@255cf2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:17, skipping insertion in model container [2024-06-27 19:12:17,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:12:17" (2/2) ... [2024-06-27 19:12:17,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656996fd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17, skipping insertion in model container [2024-06-27 19:12:17,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:12:17" (2/2) ... [2024-06-27 19:12:17,504 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 19:12:17,536 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 19:12:17,537 INFO L97 edCorrectnessWitness]: Location invariant before [L147-L147] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-06-27 19:12:17,537 INFO L97 edCorrectnessWitness]: Location invariant before [L148-L148] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-06-27 19:12:17,537 INFO L97 edCorrectnessWitness]: Location invariant before [L146-L146] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-06-27 19:12:17,537 INFO L97 edCorrectnessWitness]: Location invariant before [L149-L149] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-06-27 19:12:17,537 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 19:12:17,538 INFO L106 edCorrectnessWitness]: ghost_update [L145-L145] multithreaded = 1; [2024-06-27 19:12:17,562 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 19:12:17,723 WARN L247 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-series.wvr.c[4403,4416] [2024-06-27 19:12:17,738 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:12:17,747 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-06-27 19:12:17,818 WARN L247 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-series.wvr.c[4403,4416] [2024-06-27 19:12:17,823 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:12:17,869 INFO L206 MainTranslator]: Completed translation [2024-06-27 19:12:17,870 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17 WrapperNode [2024-06-27 19:12:17,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 19:12:17,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 19:12:17,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 19:12:17,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 19:12:17,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:17,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:17,930 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 347 [2024-06-27 19:12:17,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 19:12:17,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 19:12:17,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 19:12:17,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 19:12:17,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:17,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:17,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:17,982 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-27 19:12:17,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:17,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:17,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:18,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:18,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:18,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:18,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 19:12:18,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 19:12:18,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 19:12:18,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 19:12:18,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (1/1) ... [2024-06-27 19:12:18,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:12:18,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:12:18,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 19:12:18,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 19:12:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 19:12:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 19:12:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 19:12:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 19:12:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 19:12:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 19:12:18,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 19:12:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 19:12:18,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 19:12:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 19:12:18,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 19:12:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-27 19:12:18,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-27 19:12:18,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 19:12:18,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 19:12:18,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 19:12:18,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 19:12:18,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 19:12:18,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 19:12:18,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 19:12:18,160 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 19:12:18,245 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 19:12:18,247 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 19:12:18,620 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 19:12:18,621 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 19:12:18,919 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 19:12:18,919 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-06-27 19:12:18,921 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:12:18 BoogieIcfgContainer [2024-06-27 19:12:18,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 19:12:18,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 19:12:18,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 19:12:18,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 19:12:18,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 07:12:17" (1/4) ... [2024-06-27 19:12:18,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c8ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:12:18, skipping insertion in model container [2024-06-27 19:12:18,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:12:17" (2/4) ... [2024-06-27 19:12:18,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c8ce8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:12:18, skipping insertion in model container [2024-06-27 19:12:18,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:17" (3/4) ... [2024-06-27 19:12:18,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c8ce8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:12:18, skipping insertion in model container [2024-06-27 19:12:18,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:12:18" (4/4) ... [2024-06-27 19:12:18,928 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2024-06-27 19:12:18,944 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 19:12:18,945 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 19:12:18,945 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 19:12:19,040 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-27 19:12:19,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 61 transitions, 150 flow [2024-06-27 19:12:19,098 INFO L124 PetriNetUnfolderBase]: 7/57 cut-off events. [2024-06-27 19:12:19,098 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 19:12:19,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 57 events. 7/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-06-27 19:12:19,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 61 transitions, 150 flow [2024-06-27 19:12:19,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 56 transitions, 136 flow [2024-06-27 19:12:19,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 19:12:19,125 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;@121febec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 19:12:19,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 19:12:19,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 19:12:19,131 INFO L124 PetriNetUnfolderBase]: 3/12 cut-off events. [2024-06-27 19:12:19,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:12:19,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:19,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:19,132 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-06-27 19:12:19,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1191932123, now seen corresponding path program 1 times [2024-06-27 19:12:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:19,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859770915] [2024-06-27 19:12:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859770915] [2024-06-27 19:12:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859770915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:19,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:19,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:12:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412916703] [2024-06-27 19:12:19,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:19,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:12:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:19,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:12:19,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:12:19,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-06-27 19:12:19,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:19,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:19,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-06-27 19:12:19,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:20,348 INFO L124 PetriNetUnfolderBase]: 3047/4728 cut-off events. [2024-06-27 19:12:20,348 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2024-06-27 19:12:20,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9071 conditions, 4728 events. 3047/4728 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 31191 event pairs, 743 based on Foata normal form. 81/4386 useless extension candidates. Maximal degree in co-relation 8387. Up to 3092 conditions per place. [2024-06-27 19:12:20,378 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 59 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-06-27 19:12:20,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 331 flow [2024-06-27 19:12:20,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:12:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:12:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-06-27 19:12:20,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7377049180327869 [2024-06-27 19:12:20,390 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 136 flow. Second operand 3 states and 135 transitions. [2024-06-27 19:12:20,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 331 flow [2024-06-27 19:12:20,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 301 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 19:12:20,402 INFO L231 Difference]: Finished difference. Result has 57 places, 58 transitions, 145 flow [2024-06-27 19:12:20,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2024-06-27 19:12:20,406 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2024-06-27 19:12:20,407 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 145 flow [2024-06-27 19:12:20,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:20,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:20,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:20,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 19:12:20,408 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-06-27 19:12:20,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1559592257, now seen corresponding path program 1 times [2024-06-27 19:12:20,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:20,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956669497] [2024-06-27 19:12:20,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:20,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:20,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956669497] [2024-06-27 19:12:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956669497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:20,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:20,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:12:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059118480] [2024-06-27 19:12:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:20,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:12:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:12:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:12:20,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-06-27 19:12:20,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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-06-27 19:12:20,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:20,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-06-27 19:12:20,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:21,065 INFO L124 PetriNetUnfolderBase]: 3328/5178 cut-off events. [2024-06-27 19:12:21,065 INFO L125 PetriNetUnfolderBase]: For 555/555 co-relation queries the response was YES. [2024-06-27 19:12:21,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10845 conditions, 5178 events. 3328/5178 cut-off events. For 555/555 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 35086 event pairs, 728 based on Foata normal form. 120/5022 useless extension candidates. Maximal degree in co-relation 2179. Up to 2414 conditions per place. [2024-06-27 19:12:21,133 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 79 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2024-06-27 19:12:21,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 414 flow [2024-06-27 19:12:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:12:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:12:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2024-06-27 19:12:21,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7336065573770492 [2024-06-27 19:12:21,140 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 145 flow. Second operand 4 states and 179 transitions. [2024-06-27 19:12:21,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 414 flow [2024-06-27 19:12:21,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:21,145 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 160 flow [2024-06-27 19:12:21,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2024-06-27 19:12:21,148 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-06-27 19:12:21,148 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 160 flow [2024-06-27 19:12:21,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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-06-27 19:12:21,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:21,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:21,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 19:12:21,150 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-06-27 19:12:21,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1199341015, now seen corresponding path program 1 times [2024-06-27 19:12:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459860017] [2024-06-27 19:12:21,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:21,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:21,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459860017] [2024-06-27 19:12:21,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459860017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:21,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:21,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:12:21,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065794339] [2024-06-27 19:12:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:21,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:12:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:21,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:12:21,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:12:21,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-06-27 19:12:21,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:21,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:21,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-06-27 19:12:21,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:21,782 INFO L124 PetriNetUnfolderBase]: 3642/5795 cut-off events. [2024-06-27 19:12:21,783 INFO L125 PetriNetUnfolderBase]: For 1977/1977 co-relation queries the response was YES. [2024-06-27 19:12:21,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12643 conditions, 5795 events. 3642/5795 cut-off events. For 1977/1977 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 41142 event pairs, 987 based on Foata normal form. 117/5631 useless extension candidates. Maximal degree in co-relation 4940. Up to 2913 conditions per place. [2024-06-27 19:12:21,815 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 80 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2024-06-27 19:12:21,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 437 flow [2024-06-27 19:12:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:12:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:12:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2024-06-27 19:12:21,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7295081967213115 [2024-06-27 19:12:21,816 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 160 flow. Second operand 4 states and 178 transitions. [2024-06-27 19:12:21,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 437 flow [2024-06-27 19:12:21,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 103 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:12:21,819 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 176 flow [2024-06-27 19:12:21,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2024-06-27 19:12:21,820 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-06-27 19:12:21,820 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 176 flow [2024-06-27 19:12:21,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:21,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:21,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:21,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 19:12:21,821 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-06-27 19:12:21,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:21,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1741825285, now seen corresponding path program 1 times [2024-06-27 19:12:21,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:21,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447649420] [2024-06-27 19:12:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:21,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:21,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447649420] [2024-06-27 19:12:21,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447649420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:21,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:12:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238508577] [2024-06-27 19:12:21,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:21,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:12:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:21,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:12:21,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:12:21,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 61 [2024-06-27 19:12:21,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:21,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:21,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 61 [2024-06-27 19:12:21,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:22,435 INFO L124 PetriNetUnfolderBase]: 4184/6978 cut-off events. [2024-06-27 19:12:22,435 INFO L125 PetriNetUnfolderBase]: For 3307/3437 co-relation queries the response was YES. [2024-06-27 19:12:22,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15205 conditions, 6978 events. 4184/6978 cut-off events. For 3307/3437 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 52459 event pairs, 3418 based on Foata normal form. 232/6735 useless extension candidates. Maximal degree in co-relation 8694. Up to 4792 conditions per place. [2024-06-27 19:12:22,469 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 64 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2024-06-27 19:12:22,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 403 flow [2024-06-27 19:12:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:12:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:12:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2024-06-27 19:12:22,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6655737704918033 [2024-06-27 19:12:22,470 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 176 flow. Second operand 5 states and 203 transitions. [2024-06-27 19:12:22,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 403 flow [2024-06-27 19:12:22,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:12:22,474 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 224 flow [2024-06-27 19:12:22,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2024-06-27 19:12:22,475 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-06-27 19:12:22,475 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 224 flow [2024-06-27 19:12:22,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:22,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:22,475 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] [2024-06-27 19:12:22,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 19:12:22,476 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-06-27 19:12:22,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1885114461, now seen corresponding path program 1 times [2024-06-27 19:12:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402221510] [2024-06-27 19:12:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 19:12:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402221510] [2024-06-27 19:12:22,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402221510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:22,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:22,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:12:22,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190571224] [2024-06-27 19:12:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:22,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:12:22,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:22,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:12:22,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:12:22,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 61 [2024-06-27 19:12:22,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:22,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:22,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 61 [2024-06-27 19:12:22,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:23,146 INFO L124 PetriNetUnfolderBase]: 4976/8512 cut-off events. [2024-06-27 19:12:23,146 INFO L125 PetriNetUnfolderBase]: For 3839/3969 co-relation queries the response was YES. [2024-06-27 19:12:23,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19095 conditions, 8512 events. 4976/8512 cut-off events. For 3839/3969 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 67539 event pairs, 4159 based on Foata normal form. 246/8190 useless extension candidates. Maximal degree in co-relation 16231. Up to 5726 conditions per place. [2024-06-27 19:12:23,266 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 66 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2024-06-27 19:12:23,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 478 flow [2024-06-27 19:12:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:12:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:12:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2024-06-27 19:12:23,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6524590163934426 [2024-06-27 19:12:23,285 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 224 flow. Second operand 5 states and 199 transitions. [2024-06-27 19:12:23,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 478 flow [2024-06-27 19:12:23,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 97 transitions, 474 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:23,292 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 296 flow [2024-06-27 19:12:23,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-06-27 19:12:23,292 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2024-06-27 19:12:23,293 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 296 flow [2024-06-27 19:12:23,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:23,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:23,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:23,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 19:12:23,294 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-06-27 19:12:23,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -180837941, now seen corresponding path program 1 times [2024-06-27 19:12:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:23,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766654093] [2024-06-27 19:12:23,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:23,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 19:12:23,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:23,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766654093] [2024-06-27 19:12:23,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766654093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:23,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:23,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:12:23,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256784178] [2024-06-27 19:12:23,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:23,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:12:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:23,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:12:23,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:12:23,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-06-27 19:12:23,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:23,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:23,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-06-27 19:12:23,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:24,426 INFO L124 PetriNetUnfolderBase]: 5875/9793 cut-off events. [2024-06-27 19:12:24,427 INFO L125 PetriNetUnfolderBase]: For 5449/5449 co-relation queries the response was YES. [2024-06-27 19:12:24,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23507 conditions, 9793 events. 5875/9793 cut-off events. For 5449/5449 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 77346 event pairs, 1641 based on Foata normal form. 117/9464 useless extension candidates. Maximal degree in co-relation 20473. Up to 3317 conditions per place. [2024-06-27 19:12:24,614 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 114 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2024-06-27 19:12:24,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 137 transitions, 719 flow [2024-06-27 19:12:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:12:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:12:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2024-06-27 19:12:24,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7311475409836066 [2024-06-27 19:12:24,616 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 296 flow. Second operand 5 states and 223 transitions. [2024-06-27 19:12:24,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 137 transitions, 719 flow [2024-06-27 19:12:24,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 137 transitions, 705 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:24,623 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 297 flow [2024-06-27 19:12:24,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2024-06-27 19:12:24,624 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2024-06-27 19:12:24,624 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 297 flow [2024-06-27 19:12:24,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:24,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:24,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:24,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 19:12:24,625 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-06-27 19:12:24,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash -180831431, now seen corresponding path program 2 times [2024-06-27 19:12:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:24,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982615489] [2024-06-27 19:12:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 19:12:24,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:24,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982615489] [2024-06-27 19:12:24,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982615489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:24,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:24,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:12:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900633093] [2024-06-27 19:12:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:24,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:12:24,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:12:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:12:24,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-06-27 19:12:24,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:24,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:24,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-06-27 19:12:24,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:25,491 INFO L124 PetriNetUnfolderBase]: 5515/9298 cut-off events. [2024-06-27 19:12:25,491 INFO L125 PetriNetUnfolderBase]: For 6592/6592 co-relation queries the response was YES. [2024-06-27 19:12:25,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22271 conditions, 9298 events. 5515/9298 cut-off events. For 6592/6592 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 73903 event pairs, 1494 based on Foata normal form. 117/9009 useless extension candidates. Maximal degree in co-relation 19191. Up to 2909 conditions per place. [2024-06-27 19:12:25,547 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 111 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2024-06-27 19:12:25,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 134 transitions, 684 flow [2024-06-27 19:12:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:12:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:12:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2024-06-27 19:12:25,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213114754098361 [2024-06-27 19:12:25,548 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 297 flow. Second operand 5 states and 220 transitions. [2024-06-27 19:12:25,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 134 transitions, 684 flow [2024-06-27 19:12:25,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 134 transitions, 676 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 19:12:25,562 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 267 flow [2024-06-27 19:12:25,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-27 19:12:25,563 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2024-06-27 19:12:25,563 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 267 flow [2024-06-27 19:12:25,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:25,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:25,563 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-06-27 19:12:25,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 19:12:25,564 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-06-27 19:12:25,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:25,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1288863779, now seen corresponding path program 1 times [2024-06-27 19:12:25,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888944286] [2024-06-27 19:12:25,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:25,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:25,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:25,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888944286] [2024-06-27 19:12:25,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888944286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:25,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:25,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:12:25,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234286217] [2024-06-27 19:12:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:25,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:12:25,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:25,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:12:25,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:12:25,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 61 [2024-06-27 19:12:25,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:25,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:25,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 61 [2024-06-27 19:12:25,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:26,764 INFO L124 PetriNetUnfolderBase]: 8785/14503 cut-off events. [2024-06-27 19:12:26,765 INFO L125 PetriNetUnfolderBase]: For 9014/9014 co-relation queries the response was YES. [2024-06-27 19:12:26,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33919 conditions, 14503 events. 8785/14503 cut-off events. For 9014/9014 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 111125 event pairs, 2625 based on Foata normal form. 10/13965 useless extension candidates. Maximal degree in co-relation 30035. Up to 7266 conditions per place. [2024-06-27 19:12:26,836 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 65 selfloop transitions, 3 changer transitions 3/90 dead transitions. [2024-06-27 19:12:26,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 497 flow [2024-06-27 19:12:26,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:12:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:12:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2024-06-27 19:12:26,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.726775956284153 [2024-06-27 19:12:26,837 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 267 flow. Second operand 3 states and 133 transitions. [2024-06-27 19:12:26,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 497 flow [2024-06-27 19:12:26,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 485 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 19:12:26,846 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 265 flow [2024-06-27 19:12:26,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-27 19:12:26,847 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2024-06-27 19:12:26,847 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 265 flow [2024-06-27 19:12:26,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:26,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:26,848 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-06-27 19:12:26,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 19:12:26,848 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-06-27 19:12:26,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash 360697824, now seen corresponding path program 1 times [2024-06-27 19:12:26,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:26,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924692720] [2024-06-27 19:12:26,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:26,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 19:12:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:26,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924692720] [2024-06-27 19:12:26,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924692720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:26,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:26,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:12:26,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599722113] [2024-06-27 19:12:26,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:26,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:12:26,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:26,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:12:26,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:12:26,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 61 [2024-06-27 19:12:26,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:26,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:26,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 61 [2024-06-27 19:12:26,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:27,787 INFO L124 PetriNetUnfolderBase]: 7533/11895 cut-off events. [2024-06-27 19:12:27,788 INFO L125 PetriNetUnfolderBase]: For 9276/9276 co-relation queries the response was YES. [2024-06-27 19:12:27,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30802 conditions, 11895 events. 7533/11895 cut-off events. For 9276/9276 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 85657 event pairs, 2395 based on Foata normal form. 160/11629 useless extension candidates. Maximal degree in co-relation 27299. Up to 7499 conditions per place. [2024-06-27 19:12:27,831 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 72 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-06-27 19:12:27,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 93 transitions, 493 flow [2024-06-27 19:12:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:12:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:12:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-06-27 19:12:27,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7540983606557377 [2024-06-27 19:12:27,832 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 265 flow. Second operand 3 states and 138 transitions. [2024-06-27 19:12:27,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 93 transitions, 493 flow [2024-06-27 19:12:27,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 93 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:27,838 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 278 flow [2024-06-27 19:12:27,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2024-06-27 19:12:27,838 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-06-27 19:12:27,838 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 278 flow [2024-06-27 19:12:27,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:27,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:27,839 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-06-27 19:12:27,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 19:12:27,839 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-06-27 19:12:27,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:27,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1528849928, now seen corresponding path program 1 times [2024-06-27 19:12:27,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:27,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148611205] [2024-06-27 19:12:27,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:27,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 19:12:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148611205] [2024-06-27 19:12:27,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148611205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:27,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:12:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160885921] [2024-06-27 19:12:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:27,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:12:27,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:12:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:12:27,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 61 [2024-06-27 19:12:27,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:27,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:27,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 61 [2024-06-27 19:12:27,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:28,698 INFO L124 PetriNetUnfolderBase]: 6843/10848 cut-off events. [2024-06-27 19:12:28,698 INFO L125 PetriNetUnfolderBase]: For 11505/11505 co-relation queries the response was YES. [2024-06-27 19:12:28,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29104 conditions, 10848 events. 6843/10848 cut-off events. For 11505/11505 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 77556 event pairs, 2071 based on Foata normal form. 76/10489 useless extension candidates. Maximal degree in co-relation 26215. Up to 6696 conditions per place. [2024-06-27 19:12:28,745 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 71 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-06-27 19:12:28,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 509 flow [2024-06-27 19:12:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:12:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:12:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-06-27 19:12:28,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7377049180327869 [2024-06-27 19:12:28,746 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 278 flow. Second operand 3 states and 135 transitions. [2024-06-27 19:12:28,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 509 flow [2024-06-27 19:12:28,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 494 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:28,752 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 286 flow [2024-06-27 19:12:28,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2024-06-27 19:12:28,754 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2024-06-27 19:12:28,754 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 286 flow [2024-06-27 19:12:28,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:28,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:28,754 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-06-27 19:12:28,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 19:12:28,755 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-06-27 19:12:28,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash -135909119, now seen corresponding path program 1 times [2024-06-27 19:12:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:28,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875288053] [2024-06-27 19:12:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 19:12:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875288053] [2024-06-27 19:12:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875288053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:29,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:29,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:12:29,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21242374] [2024-06-27 19:12:29,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:29,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:12:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:12:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:12:29,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-06-27 19:12:29,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:29,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:29,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-06-27 19:12:29,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:30,701 INFO L124 PetriNetUnfolderBase]: 12936/20179 cut-off events. [2024-06-27 19:12:30,701 INFO L125 PetriNetUnfolderBase]: For 18079/18079 co-relation queries the response was YES. [2024-06-27 19:12:30,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52516 conditions, 20179 events. 12936/20179 cut-off events. For 18079/18079 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 153560 event pairs, 5114 based on Foata normal form. 0/18626 useless extension candidates. Maximal degree in co-relation 42084. Up to 8981 conditions per place. [2024-06-27 19:12:30,874 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 116 selfloop transitions, 12 changer transitions 1/145 dead transitions. [2024-06-27 19:12:30,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 145 transitions, 815 flow [2024-06-27 19:12:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:12:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:12:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 249 transitions. [2024-06-27 19:12:30,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.680327868852459 [2024-06-27 19:12:30,876 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 286 flow. Second operand 6 states and 249 transitions. [2024-06-27 19:12:30,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 145 transitions, 815 flow [2024-06-27 19:12:30,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 145 transitions, 786 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:30,900 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 328 flow [2024-06-27 19:12:30,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2024-06-27 19:12:30,901 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2024-06-27 19:12:30,901 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 328 flow [2024-06-27 19:12:30,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:30,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:30,901 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-06-27 19:12:30,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 19:12:30,902 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-06-27 19:12:30,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash 899263537, now seen corresponding path program 1 times [2024-06-27 19:12:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515396170] [2024-06-27 19:12:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 19:12:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515396170] [2024-06-27 19:12:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515396170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:31,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:31,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:12:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140894167] [2024-06-27 19:12:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:31,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:12:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:12:31,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:12:31,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-06-27 19:12:31,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:31,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:31,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-06-27 19:12:31,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:32,708 INFO L124 PetriNetUnfolderBase]: 11673/17887 cut-off events. [2024-06-27 19:12:32,708 INFO L125 PetriNetUnfolderBase]: For 14256/14256 co-relation queries the response was YES. [2024-06-27 19:12:32,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45672 conditions, 17887 events. 11673/17887 cut-off events. For 14256/14256 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 130905 event pairs, 4692 based on Foata normal form. 0/16236 useless extension candidates. Maximal degree in co-relation 40749. Up to 8901 conditions per place. [2024-06-27 19:12:32,776 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 68 selfloop transitions, 9 changer transitions 34/127 dead transitions. [2024-06-27 19:12:32,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 127 transitions, 703 flow [2024-06-27 19:12:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:12:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:12:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-06-27 19:12:32,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6475409836065574 [2024-06-27 19:12:32,780 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 328 flow. Second operand 6 states and 237 transitions. [2024-06-27 19:12:32,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 127 transitions, 703 flow [2024-06-27 19:12:32,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 127 transitions, 692 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:32,822 INFO L231 Difference]: Finished difference. Result has 90 places, 69 transitions, 311 flow [2024-06-27 19:12:32,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=311, PETRI_PLACES=90, PETRI_TRANSITIONS=69} [2024-06-27 19:12:32,823 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 28 predicate places. [2024-06-27 19:12:32,823 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 69 transitions, 311 flow [2024-06-27 19:12:32,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:32,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:32,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:32,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 19:12:32,824 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-06-27 19:12:32,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1840500724, now seen corresponding path program 1 times [2024-06-27 19:12:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:32,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380770152] [2024-06-27 19:12:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 19:12:33,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:33,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380770152] [2024-06-27 19:12:33,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380770152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:33,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:33,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:12:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916069149] [2024-06-27 19:12:33,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:33,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:12:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:12:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:12:33,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2024-06-27 19:12:33,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 69 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:33,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:33,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2024-06-27 19:12:33,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:34,275 INFO L124 PetriNetUnfolderBase]: 9913/15118 cut-off events. [2024-06-27 19:12:34,275 INFO L125 PetriNetUnfolderBase]: For 15487/15487 co-relation queries the response was YES. [2024-06-27 19:12:34,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40088 conditions, 15118 events. 9913/15118 cut-off events. For 15487/15487 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 108403 event pairs, 2602 based on Foata normal form. 551/15359 useless extension candidates. Maximal degree in co-relation 35740. Up to 7886 conditions per place. [2024-06-27 19:12:34,340 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 92 selfloop transitions, 13 changer transitions 8/130 dead transitions. [2024-06-27 19:12:34,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 130 transitions, 810 flow [2024-06-27 19:12:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:12:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:12:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 259 transitions. [2024-06-27 19:12:34,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6065573770491803 [2024-06-27 19:12:34,342 INFO L175 Difference]: Start difference. First operand has 90 places, 69 transitions, 311 flow. Second operand 7 states and 259 transitions. [2024-06-27 19:12:34,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 130 transitions, 810 flow [2024-06-27 19:12:34,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 130 transitions, 787 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 19:12:34,369 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 381 flow [2024-06-27 19:12:34,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=381, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2024-06-27 19:12:34,370 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 27 predicate places. [2024-06-27 19:12:34,370 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 381 flow [2024-06-27 19:12:34,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:34,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:34,370 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] [2024-06-27 19:12:34,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 19:12:34,371 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-06-27 19:12:34,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1088594366, now seen corresponding path program 1 times [2024-06-27 19:12:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:34,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761181448] [2024-06-27 19:12:34,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 19:12:34,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:34,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761181448] [2024-06-27 19:12:34,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761181448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:34,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:34,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:12:34,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049337828] [2024-06-27 19:12:34,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:34,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:12:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:34,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:12:34,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:12:34,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2024-06-27 19:12:34,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:34,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:34,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2024-06-27 19:12:34,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:35,579 INFO L124 PetriNetUnfolderBase]: 8369/12480 cut-off events. [2024-06-27 19:12:35,579 INFO L125 PetriNetUnfolderBase]: For 20694/21162 co-relation queries the response was YES. [2024-06-27 19:12:35,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36985 conditions, 12480 events. 8369/12480 cut-off events. For 20694/21162 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 83216 event pairs, 1065 based on Foata normal form. 548/12739 useless extension candidates. Maximal degree in co-relation 33646. Up to 8088 conditions per place. [2024-06-27 19:12:35,635 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 90 selfloop transitions, 6 changer transitions 4/119 dead transitions. [2024-06-27 19:12:35,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 119 transitions, 785 flow [2024-06-27 19:12:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:12:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:12:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2024-06-27 19:12:35,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6065573770491803 [2024-06-27 19:12:35,650 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 381 flow. Second operand 6 states and 222 transitions. [2024-06-27 19:12:35,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 119 transitions, 785 flow [2024-06-27 19:12:35,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 763 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 19:12:35,669 INFO L231 Difference]: Finished difference. Result has 88 places, 71 transitions, 347 flow [2024-06-27 19:12:35,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=88, PETRI_TRANSITIONS=71} [2024-06-27 19:12:35,670 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 26 predicate places. [2024-06-27 19:12:35,670 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 71 transitions, 347 flow [2024-06-27 19:12:35,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:35,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:35,671 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] [2024-06-27 19:12:35,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 19:12:35,671 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-06-27 19:12:35,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash -873810623, now seen corresponding path program 1 times [2024-06-27 19:12:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610823883] [2024-06-27 19:12:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 19:12:35,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:35,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610823883] [2024-06-27 19:12:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610823883] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 19:12:35,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814673078] [2024-06-27 19:12:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:35,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 19:12:35,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:12:35,872 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-06-27 19:12:35,873 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-06-27 19:12:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:35,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 19:12:35,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 19:12:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 19:12:36,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 19:12:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 19:12:36,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814673078] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 19:12:36,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 19:12:36,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2024-06-27 19:12:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934182895] [2024-06-27 19:12:36,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 19:12:36,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 19:12:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:36,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 19:12:36,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-06-27 19:12:36,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-06-27 19:12:36,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 71 transitions, 347 flow. Second operand has 18 states, 18 states have (on average 28.5) internal successors, (513), 18 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:36,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:36,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-06-27 19:12:36,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:38,622 INFO L124 PetriNetUnfolderBase]: 16533/23709 cut-off events. [2024-06-27 19:12:38,623 INFO L125 PetriNetUnfolderBase]: For 42891/44226 co-relation queries the response was YES. [2024-06-27 19:12:38,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73259 conditions, 23709 events. 16533/23709 cut-off events. For 42891/44226 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 160108 event pairs, 1608 based on Foata normal form. 845/23743 useless extension candidates. Maximal degree in co-relation 73222. Up to 6967 conditions per place. [2024-06-27 19:12:38,851 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 185 selfloop transitions, 18 changer transitions 0/221 dead transitions. [2024-06-27 19:12:38,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 221 transitions, 1550 flow [2024-06-27 19:12:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 19:12:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 19:12:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 434 transitions. [2024-06-27 19:12:38,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.592896174863388 [2024-06-27 19:12:38,854 INFO L175 Difference]: Start difference. First operand has 88 places, 71 transitions, 347 flow. Second operand 12 states and 434 transitions. [2024-06-27 19:12:38,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 221 transitions, 1550 flow [2024-06-27 19:12:38,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 221 transitions, 1522 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 19:12:38,914 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 424 flow [2024-06-27 19:12:38,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=424, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-06-27 19:12:38,915 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 31 predicate places. [2024-06-27 19:12:38,915 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 424 flow [2024-06-27 19:12:38,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 28.5) internal successors, (513), 18 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:38,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:38,915 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] [2024-06-27 19:12:38,933 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-06-27 19:12:39,127 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,SelfDestructingSolverStorable14 [2024-06-27 19:12:39,127 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-06-27 19:12:39,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 334841127, now seen corresponding path program 1 times [2024-06-27 19:12:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713659049] [2024-06-27 19:12:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 19:12:39,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713659049] [2024-06-27 19:12:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713659049] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 19:12:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922726125] [2024-06-27 19:12:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:39,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 19:12:39,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:12:39,317 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-06-27 19:12:39,326 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-06-27 19:12:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:39,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 19:12:39,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 19:12:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 19:12:39,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 19:12:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 19:12:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922726125] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 19:12:39,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 19:12:39,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2024-06-27 19:12:39,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845690058] [2024-06-27 19:12:39,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 19:12:39,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 19:12:39,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:39,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 19:12:39,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-06-27 19:12:39,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2024-06-27 19:12:39,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 424 flow. Second operand has 16 states, 16 states have (on average 27.5) internal successors, (440), 16 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:39,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:39,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2024-06-27 19:12:39,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:47,304 INFO L124 PetriNetUnfolderBase]: 48428/69568 cut-off events. [2024-06-27 19:12:47,305 INFO L125 PetriNetUnfolderBase]: For 128526/129591 co-relation queries the response was YES. [2024-06-27 19:12:47,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220663 conditions, 69568 events. 48428/69568 cut-off events. For 128526/129591 co-relation queries the response was YES. Maximal size of possible extension queue 3011. Compared 519087 event pairs, 2959 based on Foata normal form. 2504/71713 useless extension candidates. Maximal degree in co-relation 220626. Up to 9932 conditions per place. [2024-06-27 19:12:47,806 INFO L140 encePairwiseOnDemand]: 46/61 looper letters, 468 selfloop transitions, 200 changer transitions 20/703 dead transitions. [2024-06-27 19:12:47,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 703 transitions, 5036 flow [2024-06-27 19:12:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-06-27 19:12:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-06-27 19:12:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 1319 transitions. [2024-06-27 19:12:47,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5844040762073549 [2024-06-27 19:12:47,810 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 424 flow. Second operand 37 states and 1319 transitions. [2024-06-27 19:12:47,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 703 transitions, 5036 flow [2024-06-27 19:12:48,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 703 transitions, 4896 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-06-27 19:12:48,238 INFO L231 Difference]: Finished difference. Result has 156 places, 273 transitions, 2474 flow [2024-06-27 19:12:48,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=2474, PETRI_PLACES=156, PETRI_TRANSITIONS=273} [2024-06-27 19:12:48,239 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 94 predicate places. [2024-06-27 19:12:48,239 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 273 transitions, 2474 flow [2024-06-27 19:12:48,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 27.5) internal successors, (440), 16 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:48,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:48,239 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] [2024-06-27 19:12:48,253 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-06-27 19:12:48,450 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-06-27 19:12:48,450 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-06-27 19:12:48,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash -224194543, now seen corresponding path program 2 times [2024-06-27 19:12:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:48,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924853260] [2024-06-27 19:12:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 19:12:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924853260] [2024-06-27 19:12:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924853260] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 19:12:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581199296] [2024-06-27 19:12:48,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 19:12:48,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 19:12:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:12:48,594 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-06-27 19:12:48,620 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-06-27 19:12:48,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 19:12:48,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 19:12:48,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 19:12:48,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 19:12:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 19:12:48,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 19:12:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581199296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:48,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 19:12:48,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-06-27 19:12:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127355702] [2024-06-27 19:12:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:48,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:12:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:48,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:12:48,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:12:48,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2024-06-27 19:12:48,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 273 transitions, 2474 flow. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 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-06-27 19:12:48,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:48,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2024-06-27 19:12:48,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:55,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][190], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 15#L149true, 58#thread3EXITtrue, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 9#L83true, Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 20#L60true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 164#true, Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:55,060 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-06-27 19:12:55,060 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-27 19:12:55,060 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:12:55,060 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-27 19:12:56,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][190], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#thread2EXITtrue, 15#L149true, 58#thread3EXITtrue, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 20#L60true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 164#true, Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:56,470 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-06-27 19:12:56,470 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:12:56,470 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 19:12:56,470 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 19:12:57,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][406], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 52#L148-5true, 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 11#L101true, 33#L80true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), 895#(<= ~q2_front~0 ~q2_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), 372#(< 0 (mod |thread3Thread1of1ForFork3_~cond~2#1| 256)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:57,613 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-06-27 19:12:57,613 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-27 19:12:57,613 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-27 19:12:57,613 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-27 19:12:57,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][431], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#thread2EXITtrue, 15#L149true, Black: 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 27#L115true, 31#L57true, 11#L101true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 164#true, Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 481#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 ~q1_back~0) (= ~i~0 0) (<= 1 ~N~0)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0), 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)))]) [2024-06-27 19:12:57,668 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-06-27 19:12:57,669 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:12:57,669 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:12:57,669 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:12:57,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][190], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 15#L149true, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 58#thread3EXITtrue, Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 9#L83true, Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 7#thread1EXITtrue, Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 164#true, Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:57,856 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-06-27 19:12:57,856 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:12:57,856 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 19:12:57,856 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 19:12:58,106 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][190], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#thread2EXITtrue, 15#L149true, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 58#thread3EXITtrue, Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 20#L60true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 164#true, Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:58,107 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-06-27 19:12:58,107 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:12:58,107 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 19:12:58,107 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-27 19:12:58,107 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 19:12:58,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][323], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#thread2EXITtrue, 15#L149true, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 11#L101true, 20#L60true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), 372#(< 0 (mod |thread3Thread1of1ForFork3_~cond~2#1| 256)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:58,108 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-27 19:12:58,108 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-27 19:12:58,108 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:12:58,108 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-27 19:12:58,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][108], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 58#thread3EXITtrue, Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 52#L148-5true, 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 33#L80true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:58,784 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is not cut-off event [2024-06-27 19:12:58,784 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2024-06-27 19:12:58,784 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2024-06-27 19:12:58,784 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2024-06-27 19:12:59,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][108], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 58#thread3EXITtrue, Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 9#L83true, Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 52#L148-5true, 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:59,325 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-06-27 19:12:59,325 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 19:12:59,325 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 19:12:59,325 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 19:12:59,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][406], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 9#L83true, Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 52#L148-5true, 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 11#L101true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), 372#(< 0 (mod |thread3Thread1of1ForFork3_~cond~2#1| 256)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:59,326 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-27 19:12:59,326 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:12:59,326 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:12:59,326 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:12:59,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][406], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 15#L149true, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 11#L101true, 33#L80true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), 895#(<= ~q2_front~0 ~q2_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), 372#(< 0 (mod |thread3Thread1of1ForFork3_~cond~2#1| 256)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:59,331 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-27 19:12:59,332 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-27 19:12:59,332 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-27 19:12:59,332 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-27 19:12:59,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][190], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#thread2EXITtrue, 15#L149true, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 58#thread3EXITtrue, Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 7#thread1EXITtrue, Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:59,660 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-27 19:12:59,660 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:12:59,660 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:12:59,661 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-27 19:12:59,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][190], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 138#(= ~j~0 0), Black: 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 58#thread3EXITtrue, 48#L149-2true, Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 33#L80true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), 105#(and (<= 1 ~i~0) (= ~j~0 0)), 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:12:59,663 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-27 19:12:59,663 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:12:59,663 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-27 19:12:59,663 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:13:00,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][108], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 15#L149true, 58#thread3EXITtrue, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 33#L80true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 7#thread1EXITtrue, Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:00,519 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is not cut-off event [2024-06-27 19:13:00,519 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2024-06-27 19:13:00,519 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2024-06-27 19:13:00,519 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2024-06-27 19:13:00,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][108], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 15#L149true, 58#thread3EXITtrue, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 9#L83true, Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), 895#(<= ~q2_front~0 ~q2_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 164#true, Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:00,978 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-27 19:13:00,979 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:13:00,979 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:13:00,979 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 19:13:00,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][406], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 15#L149true, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 9#L83true, Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 11#L101true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), 895#(<= ~q2_front~0 ~q2_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 164#true, Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), 372#(< 0 (mod |thread3Thread1of1ForFork3_~cond~2#1| 256)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:00,980 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-27 19:13:00,980 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:00,980 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:00,981 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:01,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L52-->L57: Formula: (and (not (= (ite (< v_~q1_back~0_132 2147483647) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int#1_106| v_~q1~0.base_105) (+ v_~q1~0.offset_105 (* v_~q1_back~0_132 4))) (select (select |v_#memory_int#1_106| v_~f~0.base_108) (+ v_~f~0.offset_108 (* v_~i~0_95 4)))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q1_back~0_132) (< v_~q1_back~0_132 v_~n1~0_72)) 1 0) 0)) (= (+ v_~q1_back~0_132 1) v_~q1_back~0_131)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_back~0=v_~q1_back~0_132, ~i~0=v_~i~0_95, ~f~0.base=v_~f~0.base_108, ~n1~0=v_~n1~0_72, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_106|, ~f~0.offset=v_~f~0.offset_108} OutVars{~q1~0.offset=v_~q1~0.offset_105, ~i~0=v_~i~0_95, ~f~0.base=v_~f~0.base_108, ~n1~0=v_~n1~0_72, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_1|, #memory_int#1=|v_#memory_int#1_106|, ~f~0.offset=v_~f~0.offset_108, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_131, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_105, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~mem1#1][350], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 164#true, 47#thread2EXITtrue, 15#L149true, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 31#L57true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), 49#L104true, Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:01,042 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-27 19:13:01,042 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-27 19:13:01,042 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:01,042 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-27 19:13:01,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][190], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 58#thread3EXITtrue, 48#L149-2true, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 9#L83true, Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 164#true, Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:01,281 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-27 19:13:01,281 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:01,281 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-27 19:13:01,282 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:01,295 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][190], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#thread2EXITtrue, 15#L149true, 58#thread3EXITtrue, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 7#thread1EXITtrue, Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 164#true, Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:01,295 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-27 19:13:01,296 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:01,296 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:01,296 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-27 19:13:01,300 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-27 19:13:01,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][323], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#thread2EXITtrue, 15#L149true, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 27#L115true, 889#(<= (+ 1 ~q2_front~0) ~q2_back~0), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 11#L101true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), 106#(and (<= 1 ~i~0) (<= 1 ~j~0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 7#thread1EXITtrue, Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), 372#(< 0 (mod |thread3Thread1of1ForFork3_~cond~2#1| 256)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:01,301 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-06-27 19:13:01,301 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:13:01,301 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-27 19:13:01,301 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-27 19:13:02,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][108], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#thread2EXITtrue, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 58#thread3EXITtrue, Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 52#L148-5true, 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:02,596 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-27 19:13:02,596 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:02,596 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:02,596 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-27 19:13:02,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][406], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 47#thread2EXITtrue, Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 52#L148-5true, 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 11#L101true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), 372#(< 0 (mod |thread3Thread1of1ForFork3_~cond~2#1| 256)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:02,597 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-06-27 19:13:02,597 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:13:02,597 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:13:02,597 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-27 19:13:02,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][406], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 52#L148-5true, 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 11#L101true, 33#L80true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 7#thread1EXITtrue, Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), 372#(< 0 (mod |thread3Thread1of1ForFork3_~cond~2#1| 256)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:02,635 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-06-27 19:13:02,635 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-27 19:13:02,635 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-27 19:13:02,648 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-27 19:13:02,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork3_#res#1.offset_1| 0) (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_5| 256) 0)) InVars {thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_1|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_1|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_#res#1.base][108], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 58#thread3EXITtrue, 48#L149-2true, Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 33#L80true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 115#(= ~total~0 0), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 119#(<= ~q1_back~0 ~q1_front~0), 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:02,709 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-27 19:13:02,709 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-27 19:13:02,709 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-27 19:13:02,709 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-27 19:13:02,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L97-->L101: Formula: (let ((.cse0 (select (select |v_#memory_int#1_112| v_~q1~0.base_111) (+ v_~q1~0.offset_111 (* v_~q1_front~0_125 4))))) (let ((.cse1 (+ v_~total~0_104 .cse0))) (and (<= 0 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= 0 (+ v_~total~0_104 .cse0 2147483648)) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (or (<= .cse0 0) (<= .cse1 2147483647)) 1 0) 0)) (= v_~total~0_103 |v_thread3Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_1| .cse1) (= (+ v_~q1_front~0_125 1) v_~q1_front~0_124) (not (= (ite (and (<= 0 v_~q1_front~0_125) (< v_~q1_front~0_125 v_~n1~0_76) (< v_~q1_front~0_125 v_~q1_back~0_137)) 1 0) 0)) (<= |v_thread3Thread1of1ForFork3_plus_#res#1_1| 2147483647)))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_125, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_76, ~q1~0.base=v_~q1~0.base_111, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_104} 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_111, ~q1_front~0=v_~q1_front~0_124, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_1|, ~n1~0=v_~n1~0_76, thread3Thread1of1ForFork3_#t~post12#1=|v_thread3Thread1of1ForFork3_#t~post12#1_1|, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_1|, #memory_int#1=|v_#memory_int#1_112|, ~total~0=v_~total~0_103, 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_137, ~q1~0.base=v_~q1~0.base_111, 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][406], [Black: 128#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 153#(and (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 48#L149-2true, Black: 150#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 162#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 112#(and (<= 1 ~i~0) (<= 1 ~j~0)), 823#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 12#L119true, 11#L101true, 33#L80true, Black: 72#(and (= ~j~0 0) (= ~i~0 0)), Black: 77#(and (<= 1 ~i~0) (= ~j~0 0)), Black: 82#(and (= ~i~0 0) (<= 1 ~j~0)), Black: 486#(<= ~q1_front~0 ~q1_back~0), Black: 851#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 895#(<= ~q2_front~0 ~q2_back~0), Black: 843#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 839#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 819#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 86#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 803#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 807#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 837#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 813#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 817#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 799#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 845#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 815#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 164#true, Black: 384#(or (= (mod |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0)), Black: 797#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 847#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 95#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 795#(and (<= ~q1_front~0 ~q1_back~0) (<= ~j~0 0) (<= 1 ~N~0)), Black: 835#(and (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 831#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0)), Black: 841#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= 1 ~q2_back~0)), Black: 829#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 805#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0)), 151#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 853#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 849#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 811#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 827#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (< ~j~0 ~N~0))), Black: 809#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 487#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 801#(and (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 825#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 821#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), Black: 115#(= ~total~0 0), Black: 833#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= ~j~0 0) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~q2_back~0)), 372#(< 0 (mod |thread3Thread1of1ForFork3_~cond~2#1| 256)), Black: 119#(<= ~q1_back~0 ~q1_front~0), Black: 123#(= ~q2_back~0 ~q2_front~0)]) [2024-06-27 19:13:02,710 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-06-27 19:13:02,710 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-27 19:13:02,710 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-27 19:13:02,710 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event