./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-bad-buffer-mult-alt2.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 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-bad-buffer-mult-alt2.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-bad-buffer-mult-alt2.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-?-80b1b13-m [2024-01-31 17:01:46,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:01:47,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:01:47,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:01:47,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:01:47,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:01:47,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:01:47,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:01:47,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:01:47,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:01:47,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:01:47,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:01:47,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:01:47,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:01:47,067 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:01:47,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:01:47,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:01:47,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:01:47,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:01:47,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:01:47,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:01:47,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:01:47,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:01:47,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:01:47,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:01:47,071 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:01:47,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:01:47,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:01:47,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:01:47,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:01:47,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:01:47,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:01:47,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:01:47,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:01:47,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:01:47,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:01:47,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:01:47,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:01:47,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:01:47,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:01:47,081 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:01:47,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:01:47,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:01:47,081 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-01-31 17:01:47,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:01:47,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:01:47,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:01:47,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:01:47,365 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:01:47,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-01-31 17:01:48,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:01:48,813 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:01:48,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-01-31 17:01:48,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71566cd92/7e5c2defc220463a9e2d09e71f371681/FLAG7a9c19684 [2024-01-31 17:01:48,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71566cd92/7e5c2defc220463a9e2d09e71f371681 [2024-01-31 17:01:48,846 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:01:48,846 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:01:48,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-bad-buffer-mult-alt2.wvr.yml/witness.yml [2024-01-31 17:01:49,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:01:49,027 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:01:49,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:01:49,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:01:49,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:01:49,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:01:48" (1/2) ... [2024-01-31 17:01:49,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ed05db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:49, skipping insertion in model container [2024-01-31 17:01:49,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:01:48" (1/2) ... [2024-01-31 17:01:49,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1e1d4e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:49, skipping insertion in model container [2024-01-31 17:01:49,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:01:49" (2/2) ... [2024-01-31 17:01:49,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ed05db and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49, skipping insertion in model container [2024-01-31 17:01:49,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:01:49" (2/2) ... [2024-01-31 17:01:49,037 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:01:49,140 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:01:49,142 INFO L98 nessWitnessExtractor]: Location invariant after [L49-L49] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 17:01:49,142 INFO L98 nessWitnessExtractor]: Location invariant after [L67-L67] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 17:01:49,142 INFO L98 nessWitnessExtractor]: Location invariant after [L85-L85] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 17:01:49,142 INFO L98 nessWitnessExtractor]: Location invariant after [L103-L103] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 17:01:49,174 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:01:49,345 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2024-01-31 17:01:49,355 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:01:49,364 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:01:49,379 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 17:01:49,385 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 17:01:49,387 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 17:01:49,389 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 17:01:49,397 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2024-01-31 17:01:49,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:01:49,416 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:01:49,416 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49 WrapperNode [2024-01-31 17:01:49,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:01:49,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:01:49,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:01:49,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:01:49,423 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 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,447 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 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,493 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 331 [2024-01-31 17:01:49,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:01:49,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:01:49,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:01:49,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:01:49,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,569 INFO L175 MemorySlicer]: Split 16 memory accesses to 6 slices as follows [2, 6, 2, 2, 2, 2]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 2, 1, 1, 1, 1]. [2024-01-31 17:01:49,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:01:49,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:01:49,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:01:49,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:01:49,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (1/1) ... [2024-01-31 17:01:49,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:01:49,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:01:49,644 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-01-31 17:01:49,652 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-01-31 17:01:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:01:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:01:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:01:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:01:49,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:01:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:01:49,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:01:49,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-31 17:01:49,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 17:01:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 17:01:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 17:01:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 17:01:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 17:01:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-31 17:01:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 17:01:49,692 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 17:01:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 17:01:49,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 17:01:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 17:01:49,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 17:01:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-31 17:01:49,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-31 17:01:49,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:01:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:01:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:01:49,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:01:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:01:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-31 17:01:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:01:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:01:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-31 17:01:49,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:01:49,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:01:49,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:01:49,698 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:01:49,851 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:01:49,853 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:01:50,275 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:01:50,276 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:01:50,758 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:01:50,758 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-01-31 17:01:50,759 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:01:50 BoogieIcfgContainer [2024-01-31 17:01:50,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:01:50,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:01:50,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:01:50,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:01:50,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:01:48" (1/4) ... [2024-01-31 17:01:50,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3a0cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:01:50, skipping insertion in model container [2024-01-31 17:01:50,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:01:49" (2/4) ... [2024-01-31 17:01:50,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3a0cce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:01:50, skipping insertion in model container [2024-01-31 17:01:50,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:01:49" (3/4) ... [2024-01-31 17:01:50,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3a0cce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:01:50, skipping insertion in model container [2024-01-31 17:01:50,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:01:50" (4/4) ... [2024-01-31 17:01:50,769 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2024-01-31 17:01:50,788 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:01:50,789 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-31 17:01:50,789 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:01:50,862 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-31 17:01:50,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 130 flow [2024-01-31 17:01:50,948 INFO L124 PetriNetUnfolderBase]: 6/47 cut-off events. [2024-01-31 17:01:50,948 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-31 17:01:50,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 47 events. 6/47 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-01-31 17:01:50,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 51 transitions, 130 flow [2024-01-31 17:01:50,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 116 flow [2024-01-31 17:01:50,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:01:50,972 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;@3599d3ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:01:50,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-31 17:01:50,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:01:50,994 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2024-01-31 17:01:50,995 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-31 17:01:50,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:01:50,996 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] [2024-01-31 17:01:50,996 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:01:51,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:01:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1259852029, now seen corresponding path program 1 times [2024-01-31 17:01:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:01:51,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041894044] [2024-01-31 17:01:51,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:01:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:01:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:01:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:01:51,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:01:51,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041894044] [2024-01-31 17:01:51,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041894044] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:01:51,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:01:51,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:01:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372721106] [2024-01-31 17:01:51,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:01:51,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:01:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:01:51,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:01:51,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:01:51,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-01-31 17:01:51,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:51,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:01:51,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-01-31 17:01:51,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:01:52,448 INFO L124 PetriNetUnfolderBase]: 2083/3088 cut-off events. [2024-01-31 17:01:52,448 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2024-01-31 17:01:52,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6138 conditions, 3088 events. 2083/3088 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 17521 event pairs, 251 based on Foata normal form. 144/3190 useless extension candidates. Maximal degree in co-relation 4745. Up to 1594 conditions per place. [2024-01-31 17:01:52,484 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 71 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2024-01-31 17:01:52,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 399 flow [2024-01-31 17:01:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:01:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:01:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-01-31 17:01:52,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6339869281045751 [2024-01-31 17:01:52,500 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 116 flow. Second operand 6 states and 194 transitions. [2024-01-31 17:01:52,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 399 flow [2024-01-31 17:01:52,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 361 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-31 17:01:52,514 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 147 flow [2024-01-31 17:01:52,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-01-31 17:01:52,525 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-01-31 17:01:52,525 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 147 flow [2024-01-31 17:01:52,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:52,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:01:52,526 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-01-31 17:01:52,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:01:52,527 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:01:52,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:01:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1263929748, now seen corresponding path program 1 times [2024-01-31 17:01:52,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:01:52,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262877425] [2024-01-31 17:01:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:01:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:01:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:01:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:01:52,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:01:52,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262877425] [2024-01-31 17:01:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262877425] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:01:52,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:01:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:01:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528887047] [2024-01-31 17:01:52,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:01:52,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:01:52,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:01:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:01:52,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:01:52,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-01-31 17:01:52,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:52,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:01:52,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-01-31 17:01:52,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:01:53,613 INFO L124 PetriNetUnfolderBase]: 3239/5036 cut-off events. [2024-01-31 17:01:53,613 INFO L125 PetriNetUnfolderBase]: For 2544/2544 co-relation queries the response was YES. [2024-01-31 17:01:53,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12203 conditions, 5036 events. 3239/5036 cut-off events. For 2544/2544 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 33616 event pairs, 1093 based on Foata normal form. 72/4989 useless extension candidates. Maximal degree in co-relation 3658. Up to 2030 conditions per place. [2024-01-31 17:01:53,654 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 79 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2024-01-31 17:01:53,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 477 flow [2024-01-31 17:01:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:01:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:01:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-01-31 17:01:53,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6535947712418301 [2024-01-31 17:01:53,658 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 147 flow. Second operand 6 states and 200 transitions. [2024-01-31 17:01:53,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 477 flow [2024-01-31 17:01:53,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:01:53,663 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 231 flow [2024-01-31 17:01:53,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2024-01-31 17:01:53,664 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-01-31 17:01:53,665 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 231 flow [2024-01-31 17:01:53,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:53,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:01:53,665 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-01-31 17:01:53,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:01:53,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:01:53,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:01:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1916060414, now seen corresponding path program 1 times [2024-01-31 17:01:53,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:01:53,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831492210] [2024-01-31 17:01:53,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:01:53,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:01:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:01:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:01:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:01:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831492210] [2024-01-31 17:01:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831492210] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:01:53,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:01:53,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:01:53,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113514379] [2024-01-31 17:01:53,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:01:53,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:01:53,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:01:53,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:01:53,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:01:53,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:01:53,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:53,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:01:53,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:01:53,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:01:54,317 INFO L124 PetriNetUnfolderBase]: 2155/3565 cut-off events. [2024-01-31 17:01:54,318 INFO L125 PetriNetUnfolderBase]: For 6029/6305 co-relation queries the response was YES. [2024-01-31 17:01:54,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10084 conditions, 3565 events. 2155/3565 cut-off events. For 6029/6305 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 24305 event pairs, 371 based on Foata normal form. 210/3650 useless extension candidates. Maximal degree in co-relation 3682. Up to 2747 conditions per place. [2024-01-31 17:01:54,351 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 44 selfloop transitions, 3 changer transitions 4/73 dead transitions. [2024-01-31 17:01:54,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 364 flow [2024-01-31 17:01:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:01:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:01:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-01-31 17:01:54,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7189542483660131 [2024-01-31 17:01:54,353 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 231 flow. Second operand 3 states and 110 transitions. [2024-01-31 17:01:54,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 364 flow [2024-01-31 17:01:54,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 357 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-31 17:01:54,360 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 224 flow [2024-01-31 17:01:54,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-01-31 17:01:54,361 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-01-31 17:01:54,361 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 224 flow [2024-01-31 17:01:54,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:54,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:01:54,362 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] [2024-01-31 17:01:54,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:01:54,363 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:01:54,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:01:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1574095419, now seen corresponding path program 1 times [2024-01-31 17:01:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:01:54,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422450409] [2024-01-31 17:01:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:01:54,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:01:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:01:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:01:54,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:01:54,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422450409] [2024-01-31 17:01:54,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422450409] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:01:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:01:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:01:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057413928] [2024-01-31 17:01:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:01:54,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:01:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:01:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:01:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:01:54,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:01:54,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:54,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:01:54,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:01:54,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:01:55,115 INFO L124 PetriNetUnfolderBase]: 2506/4080 cut-off events. [2024-01-31 17:01:55,116 INFO L125 PetriNetUnfolderBase]: For 8577/8967 co-relation queries the response was YES. [2024-01-31 17:01:55,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11424 conditions, 4080 events. 2506/4080 cut-off events. For 8577/8967 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 28065 event pairs, 1868 based on Foata normal form. 429/4226 useless extension candidates. Maximal degree in co-relation 7228. Up to 3236 conditions per place. [2024-01-31 17:01:55,160 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 34 selfloop transitions, 2 changer transitions 20/78 dead transitions. [2024-01-31 17:01:55,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 390 flow [2024-01-31 17:01:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:01:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:01:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-01-31 17:01:55,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-01-31 17:01:55,163 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 224 flow. Second operand 4 states and 135 transitions. [2024-01-31 17:01:55,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 390 flow [2024-01-31 17:01:55,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:01:55,174 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 234 flow [2024-01-31 17:01:55,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-01-31 17:01:55,176 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-01-31 17:01:55,176 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 234 flow [2024-01-31 17:01:55,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:55,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:01:55,177 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-01-31 17:01:55,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:01:55,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:01:55,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:01:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash 259808718, now seen corresponding path program 1 times [2024-01-31 17:01:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:01:55,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89694028] [2024-01-31 17:01:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:01:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:01:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:01:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:01:56,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:01:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89694028] [2024-01-31 17:01:56,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89694028] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:01:56,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981158065] [2024-01-31 17:01:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:01:56,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:01:56,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:01:56,021 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-01-31 17:01:56,029 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-01-31 17:01:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:01:56,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-31 17:01:56,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:01:56,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-01-31 17:01:56,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-01-31 17:01:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:01:56,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:01:56,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2024-01-31 17:01:56,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-01-31 17:01:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:01:57,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981158065] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:01:57,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:01:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-01-31 17:01:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415426602] [2024-01-31 17:01:57,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:01:57,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-31 17:01:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:01:57,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-31 17:01:57,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-01-31 17:01:57,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:01:57,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 234 flow. Second operand has 18 states, 18 states have (on average 23.88888888888889) internal successors, (430), 18 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:57,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:01:57,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:01:57,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:01:59,336 INFO L124 PetriNetUnfolderBase]: 6514/10470 cut-off events. [2024-01-31 17:01:59,336 INFO L125 PetriNetUnfolderBase]: For 18384/19142 co-relation queries the response was YES. [2024-01-31 17:01:59,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29251 conditions, 10470 events. 6514/10470 cut-off events. For 18384/19142 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 77957 event pairs, 1412 based on Foata normal form. 583/10532 useless extension candidates. Maximal degree in co-relation 29232. Up to 4229 conditions per place. [2024-01-31 17:01:59,434 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 157 selfloop transitions, 37 changer transitions 14/230 dead transitions. [2024-01-31 17:01:59,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 230 transitions, 1263 flow [2024-01-31 17:01:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-31 17:01:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-31 17:01:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 526 transitions. [2024-01-31 17:01:59,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6446078431372549 [2024-01-31 17:01:59,437 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 234 flow. Second operand 16 states and 526 transitions. [2024-01-31 17:01:59,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 230 transitions, 1263 flow [2024-01-31 17:01:59,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 230 transitions, 1243 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-01-31 17:01:59,464 INFO L231 Difference]: Finished difference. Result has 80 places, 96 transitions, 560 flow [2024-01-31 17:01:59,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=560, PETRI_PLACES=80, PETRI_TRANSITIONS=96} [2024-01-31 17:01:59,465 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2024-01-31 17:01:59,466 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 96 transitions, 560 flow [2024-01-31 17:01:59,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 23.88888888888889) internal successors, (430), 18 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:01:59,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:01:59,467 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 17:01:59,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-31 17:01:59,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:01:59,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:01:59,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:01:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1160608728, now seen corresponding path program 1 times [2024-01-31 17:01:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:01:59,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360417574] [2024-01-31 17:01:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:01:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:01:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:02:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:02:00,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:02:00,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360417574] [2024-01-31 17:02:00,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360417574] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:02:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232990930] [2024-01-31 17:02:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:02:00,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:02:00,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:02:00,826 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-01-31 17:02:00,845 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-01-31 17:02:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:02:00,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-31 17:02:00,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:02:01,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-01-31 17:02:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 17:02:01,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:02:01,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:02:01,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2024-01-31 17:02:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-31 17:02:01,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232990930] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:02:01,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:02:01,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 14 [2024-01-31 17:02:01,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681222597] [2024-01-31 17:02:01,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:02:01,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-31 17:02:01,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:02:01,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-31 17:02:01,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-01-31 17:02:01,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:02:01,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 96 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 24.6) internal successors, (369), 15 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:02:01,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:02:01,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:02:01,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:02:03,954 INFO L124 PetriNetUnfolderBase]: 8714/14248 cut-off events. [2024-01-31 17:02:03,954 INFO L125 PetriNetUnfolderBase]: For 32116/33305 co-relation queries the response was YES. [2024-01-31 17:02:04,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43140 conditions, 14248 events. 8714/14248 cut-off events. For 32116/33305 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 111271 event pairs, 819 based on Foata normal form. 767/14471 useless extension candidates. Maximal degree in co-relation 32329. Up to 5331 conditions per place. [2024-01-31 17:02:04,090 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 107 selfloop transitions, 63 changer transitions 9/201 dead transitions. [2024-01-31 17:02:04,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 201 transitions, 1351 flow [2024-01-31 17:02:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-31 17:02:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-31 17:02:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 466 transitions. [2024-01-31 17:02:04,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.571078431372549 [2024-01-31 17:02:04,093 INFO L175 Difference]: Start difference. First operand has 80 places, 96 transitions, 560 flow. Second operand 16 states and 466 transitions. [2024-01-31 17:02:04,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 201 transitions, 1351 flow [2024-01-31 17:02:04,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 201 transitions, 1331 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-01-31 17:02:04,135 INFO L231 Difference]: Finished difference. Result has 96 places, 123 transitions, 926 flow [2024-01-31 17:02:04,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=926, PETRI_PLACES=96, PETRI_TRANSITIONS=123} [2024-01-31 17:02:04,136 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2024-01-31 17:02:04,136 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 123 transitions, 926 flow [2024-01-31 17:02:04,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 24.6) internal successors, (369), 15 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:02:04,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:02:04,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:02:04,156 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-01-31 17:02:04,352 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,SelfDestructingSolverStorable5 [2024-01-31 17:02:04,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:02:04,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:02:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1532036085, now seen corresponding path program 1 times [2024-01-31 17:02:04,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:02:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484534320] [2024-01-31 17:02:04,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:02:04,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:02:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:02:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 17:02:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:02:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484534320] [2024-01-31 17:02:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484534320] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:02:04,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:02:04,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:02:04,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927574130] [2024-01-31 17:02:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:02:04,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:02:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:02:04,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:02:04,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:02:04,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:02:04,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 123 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:02:04,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:02:04,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:02:04,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:02:06,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, 20#L92true, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 16#L56true, Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:06,984 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-31 17:02:06,984 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:02:06,984 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:02:06,984 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:02:07,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [361#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 16#L56true, Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,060 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-31 17:02:07,060 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:02:07,060 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:02:07,060 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 17:02:07,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, 361#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,092 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,092 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:02:07,092 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:02:07,092 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-31 17:02:07,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, 20#L92true, 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,148 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,148 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:02:07,148 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:02:07,148 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-31 17:02:07,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, 20#L92true, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 13#L74true, 11#thread1EXITtrue, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,169 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,169 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:02:07,169 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 17:02:07,170 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:02:07,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, 20#L92true, 37#thread2EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 16#L56true, Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,182 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,182 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:02:07,182 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 17:02:07,182 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:02:07,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [361#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 11#thread1EXITtrue, 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,211 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,211 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,212 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:02:07,212 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-31 17:02:07,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [361#true, 20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 16#L56true, Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,221 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,221 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-31 17:02:07,221 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,221 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:02:07,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, 20#L92true, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 11#thread1EXITtrue, 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,234 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-31 17:02:07,234 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:02:07,234 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:02:07,234 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-31 17:02:07,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, 361#true, 20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,246 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-31 17:02:07,246 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-31 17:02:07,246 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:02:07,246 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:02:07,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, 361#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 11#thread1EXITtrue, 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,271 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-31 17:02:07,271 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 17:02:07,271 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,271 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:02:07,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, 20#L92true, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), 16#L56true, Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,279 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-31 17:02:07,279 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,279 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:02:07,279 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 17:02:07,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [361#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, 5#L144-2true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,289 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-31 17:02:07,289 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,289 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-31 17:02:07,289 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:02:07,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [361#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 37#thread2EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 11#thread1EXITtrue, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,296 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-31 17:02:07,296 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:02:07,296 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-31 17:02:07,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, 20#L92true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 5#L144-2true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,317 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-31 17:02:07,317 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-31 17:02:07,317 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-31 17:02:07,317 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:02:07,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, 361#true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 628#true, 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 369#(<= 1 ~total~0), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 11#thread1EXITtrue, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,318 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-31 17:02:07,318 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-31 17:02:07,318 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-31 17:02:07,318 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:02:07,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, 361#true, 20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 11#thread1EXITtrue, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,328 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-31 17:02:07,328 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 17:02:07,328 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,328 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:02:07,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [361#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 51#L145-1true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,330 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-31 17:02:07,330 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 17:02:07,330 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:02:07,330 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, 20#L92true, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 11#thread1EXITtrue, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,347 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-31 17:02:07,347 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-31 17:02:07,347 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,347 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:02:07,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, 20#L92true, 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 51#L145-1true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 13#L74true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,348 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-31 17:02:07,348 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,348 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:02:07,348 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-31 17:02:07,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, 361#true, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, 5#L144-2true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,357 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-01-31 17:02:07,357 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:02:07,357 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-31 17:02:07,357 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-31 17:02:07,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, 361#true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 37#thread2EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 5#L144-2true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,370 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-01-31 17:02:07,370 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-31 17:02:07,370 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:02:07,370 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, 361#true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 51#L145-1true, 4#L110true, Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,376 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-01-31 17:02:07,376 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,376 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:02:07,376 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-31 17:02:07,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [361#true, 20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 51#L145-1true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,385 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-01-31 17:02:07,385 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-31 17:02:07,385 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-31 17:02:07,385 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-31 17:02:07,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, 361#true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 39#L145-2true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,392 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-01-31 17:02:07,392 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,392 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-31 17:02:07,392 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:02:07,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 361#true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 39#L145-2true, 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,399 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-01-31 17:02:07,399 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-31 17:02:07,399 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-31 17:02:07,400 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-31 17:02:07,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, 361#true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 100#(<= 1 ~total~0), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 369#(<= 1 ~total~0), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, 19#L146-1true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,404 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-31 17:02:07,404 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-31 17:02:07,404 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-31 17:02:07,404 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-31 17:02:07,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [361#true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 96#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 100#(<= 1 ~total~0), Black: 356#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (not (= ~q1_front~0 0)))), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 628#true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 369#(<= 1 ~total~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 373#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, 19#L146-1true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-31 17:02:07,408 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-31 17:02:07,408 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-31 17:02:07,408 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 17:02:07,408 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-31 17:02:07,418 INFO L124 PetriNetUnfolderBase]: 13126/21124 cut-off events. [2024-01-31 17:02:07,418 INFO L125 PetriNetUnfolderBase]: For 84081/86399 co-relation queries the response was YES. [2024-01-31 17:02:07,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68140 conditions, 21124 events. 13126/21124 cut-off events. For 84081/86399 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 166236 event pairs, 3377 based on Foata normal form. 2340/22625 useless extension candidates. Maximal degree in co-relation 58838. Up to 10910 conditions per place. [2024-01-31 17:02:07,623 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 145 selfloop transitions, 10 changer transitions 0/177 dead transitions. [2024-01-31 17:02:07,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 177 transitions, 1743 flow [2024-01-31 17:02:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:02:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:02:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-01-31 17:02:07,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2024-01-31 17:02:07,625 INFO L175 Difference]: Start difference. First operand has 96 places, 123 transitions, 926 flow. Second operand 3 states and 113 transitions. [2024-01-31 17:02:07,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 177 transitions, 1743 flow [2024-01-31 17:02:07,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 177 transitions, 1703 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-01-31 17:02:07,686 INFO L231 Difference]: Finished difference. Result has 95 places, 124 transitions, 954 flow [2024-01-31 17:02:07,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=95, PETRI_TRANSITIONS=124} [2024-01-31 17:02:07,687 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2024-01-31 17:02:07,687 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 124 transitions, 954 flow [2024-01-31 17:02:07,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:02:07,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:02:07,688 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 17:02:07,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:02:07,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:02:07,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:02:07,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1513655636, now seen corresponding path program 2 times [2024-01-31 17:02:07,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:02:07,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204408273] [2024-01-31 17:02:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:02:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:02:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:02:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 17:02:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:02:07,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204408273] [2024-01-31 17:02:07,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204408273] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:02:07,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495648039] [2024-01-31 17:02:07,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 17:02:07,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:02:07,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:02:07,960 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-01-31 17:02:07,980 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-01-31 17:02:08,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 17:02:08,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:02:08,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-31 17:02:08,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:02:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 17:02:08,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:02:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 17:02:08,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495648039] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:02:08,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:02:08,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2024-01-31 17:02:08,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211297628] [2024-01-31 17:02:08,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:02:08,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 17:02:08,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:02:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 17:02:08,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:02:08,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:02:08,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 124 transitions, 954 flow. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:02:08,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:02:08,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:02:08,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:02:12,333 INFO L124 PetriNetUnfolderBase]: 21382/34664 cut-off events. [2024-01-31 17:02:12,333 INFO L125 PetriNetUnfolderBase]: For 120714/122914 co-relation queries the response was YES. [2024-01-31 17:02:12,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116379 conditions, 34664 events. 21382/34664 cut-off events. For 120714/122914 co-relation queries the response was YES. Maximal size of possible extension queue 1809. Compared 300373 event pairs, 3743 based on Foata normal form. 1810/35090 useless extension candidates. Maximal degree in co-relation 109659. Up to 15032 conditions per place. [2024-01-31 17:02:12,664 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 138 selfloop transitions, 44 changer transitions 0/204 dead transitions. [2024-01-31 17:02:12,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 204 transitions, 1868 flow [2024-01-31 17:02:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:02:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:02:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-01-31 17:02:12,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7794117647058824 [2024-01-31 17:02:12,665 INFO L175 Difference]: Start difference. First operand has 95 places, 124 transitions, 954 flow. Second operand 4 states and 159 transitions. [2024-01-31 17:02:12,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 204 transitions, 1868 flow [2024-01-31 17:02:12,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 204 transitions, 1856 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:02:12,882 INFO L231 Difference]: Finished difference. Result has 99 places, 147 transitions, 1452 flow [2024-01-31 17:02:12,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1452, PETRI_PLACES=99, PETRI_TRANSITIONS=147} [2024-01-31 17:02:12,882 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-01-31 17:02:12,883 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 147 transitions, 1452 flow [2024-01-31 17:02:12,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:02:12,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:02:12,883 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] [2024-01-31 17:02:12,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-31 17:02:13,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:02:13,085 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:02:13,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:02:13,085 INFO L85 PathProgramCache]: Analyzing trace with hash -451423908, now seen corresponding path program 1 times [2024-01-31 17:02:13,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:02:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755368884] [2024-01-31 17:02:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:02:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:02:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:02:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-31 17:02:13,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:02:13,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755368884] [2024-01-31 17:02:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755368884] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:02:13,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:02:13,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:02:13,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771302194] [2024-01-31 17:02:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:02:13,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:02:13,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:02:13,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:02:13,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:02:13,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:02:13,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 147 transitions, 1452 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:02:13,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:02:13,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:02:13,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:02:18,177 INFO L124 PetriNetUnfolderBase]: 25058/40902 cut-off events. [2024-01-31 17:02:18,178 INFO L125 PetriNetUnfolderBase]: For 220199/223595 co-relation queries the response was YES. [2024-01-31 17:02:18,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149422 conditions, 40902 events. 25058/40902 cut-off events. For 220199/223595 co-relation queries the response was YES. Maximal size of possible extension queue 2134. Compared 368547 event pairs, 16503 based on Foata normal form. 3780/42283 useless extension candidates. Maximal degree in co-relation 138853. Up to 23124 conditions per place. [2024-01-31 17:02:18,511 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 150 selfloop transitions, 11 changer transitions 15/198 dead transitions. [2024-01-31 17:02:18,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 198 transitions, 2360 flow [2024-01-31 17:02:18,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:02:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:02:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-01-31 17:02:18,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-01-31 17:02:18,512 INFO L175 Difference]: Start difference. First operand has 99 places, 147 transitions, 1452 flow. Second operand 4 states and 138 transitions. [2024-01-31 17:02:18,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 198 transitions, 2360 flow [2024-01-31 17:02:18,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 198 transitions, 2345 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-31 17:02:18,664 INFO L231 Difference]: Finished difference. Result has 102 places, 141 transitions, 1411 flow [2024-01-31 17:02:18,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1411, PETRI_PLACES=102, PETRI_TRANSITIONS=141} [2024-01-31 17:02:18,665 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2024-01-31 17:02:18,665 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 141 transitions, 1411 flow [2024-01-31 17:02:18,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:02:18,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:02:18,666 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] [2024-01-31 17:02:18,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:02:18,666 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:02:18,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:02:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 576845887, now seen corresponding path program 1 times [2024-01-31 17:02:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:02:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193339680] [2024-01-31 17:02:18,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:02:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:02:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:02:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-31 17:02:19,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:02:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193339680] [2024-01-31 17:02:19,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193339680] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:02:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36069104] [2024-01-31 17:02:19,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:02:19,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:02:19,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:02:19,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 17:02:19,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-31 17:02:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:02:19,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 17 conjunts are in the unsatisfiable core [2024-01-31 17:02:19,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:02:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 17:02:19,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:02:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 17:02:20,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36069104] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:02:20,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:02:20,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 25 [2024-01-31 17:02:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310780475] [2024-01-31 17:02:20,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:02:20,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-01-31 17:02:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:02:20,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-01-31 17:02:20,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2024-01-31 17:02:20,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2024-01-31 17:02:20,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 141 transitions, 1411 flow. Second operand has 26 states, 26 states have (on average 12.576923076923077) internal successors, (327), 26 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:02:20,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:02:20,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2024-01-31 17:02:20,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand