/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 14:17:42,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 14:17:42,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 14:17:42,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 14:17:42,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 14:17:42,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 14:17:42,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 14:17:42,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 14:17:42,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 14:17:42,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 14:17:42,505 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 14:17:42,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 14:17:42,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 14:17:42,507 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 14:17:42,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 14:17:42,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 14:17:42,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 14:17:42,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 14:17:42,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 14:17:42,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 14:17:42,508 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 14:17:42,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 14:17:42,509 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 14:17:42,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 14:17:42,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 14:17:42,509 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 14:17:42,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 14:17:42,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 14:17:42,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 14:17:42,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 14:17:42,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 14:17:42,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 14:17:42,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 14:17:42,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 14:17:42,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 14:17:42,511 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 14:17:42,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 14:17:42,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 14:17:42,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 14:17:42,787 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 14:17:42,788 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 14:17:42,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2023-08-27 14:17:43,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 14:17:44,030 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 14:17:44,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2023-08-27 14:17:44,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9522d274/64b424f6e4044f209e67c10181931fbc/FLAG52ccf747e [2023-08-27 14:17:44,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9522d274/64b424f6e4044f209e67c10181931fbc [2023-08-27 14:17:44,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 14:17:44,067 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 14:17:44,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 14:17:44,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 14:17:44,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 14:17:44,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e512956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44, skipping insertion in model container [2023-08-27 14:17:44,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,088 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 14:17:44,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 14:17:44,253 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 14:17:44,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 14:17:44,292 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 14:17:44,292 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 14:17:44,296 INFO L206 MainTranslator]: Completed translation [2023-08-27 14:17:44,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44 WrapperNode [2023-08-27 14:17:44,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 14:17:44,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 14:17:44,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 14:17:44,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 14:17:44,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,354 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 250 [2023-08-27 14:17:44,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 14:17:44,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 14:17:44,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 14:17:44,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 14:17:44,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 14:17:44,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 14:17:44,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 14:17:44,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 14:17:44,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (1/1) ... [2023-08-27 14:17:44,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 14:17:44,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:17:44,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 14:17:44,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 14:17:44,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 14:17:44,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 14:17:44,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 14:17:44,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 14:17:44,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-27 14:17:44,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-27 14:17:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-27 14:17:44,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-27 14:17:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-27 14:17:44,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-27 14:17:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 14:17:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 14:17:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 14:17:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-27 14:17:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 14:17:44,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 14:17:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 14:17:44,472 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 14:17:44,573 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 14:17:44,577 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 14:17:44,926 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 14:17:45,283 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 14:17:45,283 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-27 14:17:45,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:17:45 BoogieIcfgContainer [2023-08-27 14:17:45,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 14:17:45,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 14:17:45,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 14:17:45,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 14:17:45,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 02:17:44" (1/3) ... [2023-08-27 14:17:45,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bf95e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:17:45, skipping insertion in model container [2023-08-27 14:17:45,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:17:44" (2/3) ... [2023-08-27 14:17:45,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bf95e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:17:45, skipping insertion in model container [2023-08-27 14:17:45,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:17:45" (3/3) ... [2023-08-27 14:17:45,290 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2023-08-27 14:17:45,301 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 14:17:45,301 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-08-27 14:17:45,302 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 14:17:45,415 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-27 14:17:45,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 183 transitions, 390 flow [2023-08-27 14:17:45,523 INFO L124 PetriNetUnfolderBase]: 12/180 cut-off events. [2023-08-27 14:17:45,523 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 14:17:45,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 180 events. 12/180 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 251 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2023-08-27 14:17:45,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 183 transitions, 390 flow [2023-08-27 14:17:45,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 169 transitions, 356 flow [2023-08-27 14:17:45,535 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 14:17:45,544 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 169 transitions, 356 flow [2023-08-27 14:17:45,547 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 169 transitions, 356 flow [2023-08-27 14:17:45,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 169 transitions, 356 flow [2023-08-27 14:17:45,588 INFO L124 PetriNetUnfolderBase]: 12/169 cut-off events. [2023-08-27 14:17:45,588 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 14:17:45,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 12/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 246 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2023-08-27 14:17:45,591 INFO L119 LiptonReduction]: Number of co-enabled transitions 4158 [2023-08-27 14:17:57,602 INFO L134 LiptonReduction]: Checked pairs total: 5480 [2023-08-27 14:17:57,603 INFO L136 LiptonReduction]: Total number of compositions: 175 [2023-08-27 14:17:57,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 14:17:57,624 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=LoopsAndPotentialCycles, 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;@5d06d556, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 14:17:57,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2023-08-27 14:17:57,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 14:17:57,628 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 14:17:57,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 14:17:57,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:17:57,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 14:17:57,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:17:57,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:17:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 33763, now seen corresponding path program 1 times [2023-08-27 14:17:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:17:57,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501316813] [2023-08-27 14:17:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:17:57,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:17:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:17:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:17:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:17:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501316813] [2023-08-27 14:17:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501316813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:17:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:17:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 14:17:57,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779791275] [2023-08-27 14:17:57,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:17:57,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:17:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:17:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:17:57,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:17:57,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 358 [2023-08-27 14:17:57,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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) [2023-08-27 14:17:57,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:17:57,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 358 [2023-08-27 14:17:57,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:17:59,012 INFO L124 PetriNetUnfolderBase]: 7394/9219 cut-off events. [2023-08-27 14:17:59,013 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-08-27 14:17:59,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18634 conditions, 9219 events. 7394/9219 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 41964 event pairs, 3542 based on Foata normal form. 0/2101 useless extension candidates. Maximal degree in co-relation 16940. Up to 9137 conditions per place. [2023-08-27 14:17:59,056 INFO L140 encePairwiseOnDemand]: 347/358 looper letters, 40 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-27 14:17:59,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 196 flow [2023-08-27 14:17:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:17:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:17:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-08-27 14:17:59,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43575418994413406 [2023-08-27 14:17:59,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-08-27 14:17:59,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-08-27 14:17:59,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:17:59,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-08-27 14:17:59,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) [2023-08-27 14:17:59,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:17:59,081 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:17:59,082 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 118 flow. Second operand 3 states and 468 transitions. [2023-08-27 14:17:59,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 196 flow [2023-08-27 14:17:59,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-27 14:17:59,178 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 115 flow [2023-08-27 14:17:59,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2023-08-27 14:17:59,182 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -9 predicate places. [2023-08-27 14:17:59,182 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 115 flow [2023-08-27 14:17:59,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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) [2023-08-27 14:17:59,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:17:59,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 14:17:59,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 14:17:59,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:17:59,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:17:59,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1048114, now seen corresponding path program 1 times [2023-08-27 14:17:59,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:17:59,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794544179] [2023-08-27 14:17:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:17:59,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:17:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:17:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:17:59,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:17:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794544179] [2023-08-27 14:17:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794544179] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:17:59,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247973660] [2023-08-27 14:17:59,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:17:59,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:17:59,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:17:59,301 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) [2023-08-27 14:17:59,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-27 14:17:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:17:59,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 14:17:59,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:17:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:17:59,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:17:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:17:59,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247973660] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:17:59,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:17:59,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-08-27 14:17:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925666834] [2023-08-27 14:17:59,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:17:59,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 14:17:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:17:59,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 14:17:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 14:17:59,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 358 [2023-08-27 14:17:59,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 140.14285714285714) internal successors, (981), 7 states have internal predecessors, (981), 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) [2023-08-27 14:17:59,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:17:59,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 358 [2023-08-27 14:17:59,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:00,433 INFO L124 PetriNetUnfolderBase]: 7400/9228 cut-off events. [2023-08-27 14:18:00,434 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-27 14:18:00,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18487 conditions, 9228 events. 7400/9228 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 42309 event pairs, 3542 based on Foata normal form. 0/2104 useless extension candidates. Maximal degree in co-relation 18433. Up to 9139 conditions per place. [2023-08-27 14:18:00,473 INFO L140 encePairwiseOnDemand]: 353/358 looper letters, 39 selfloop transitions, 13 changer transitions 0/55 dead transitions. [2023-08-27 14:18:00,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 255 flow [2023-08-27 14:18:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 14:18:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 14:18:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1028 transitions. [2023-08-27 14:18:00,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41021548284118114 [2023-08-27 14:18:00,479 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1028 transitions. [2023-08-27 14:18:00,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1028 transitions. [2023-08-27 14:18:00,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:00,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1028 transitions. [2023-08-27 14:18:00,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.85714285714286) internal successors, (1028), 7 states have internal predecessors, (1028), 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) [2023-08-27 14:18:00,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:18:00,485 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:18:00,485 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 115 flow. Second operand 7 states and 1028 transitions. [2023-08-27 14:18:00,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 255 flow [2023-08-27 14:18:00,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 250 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 14:18:00,486 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 194 flow [2023-08-27 14:18:00,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2023-08-27 14:18:00,487 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2023-08-27 14:18:00,487 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 194 flow [2023-08-27 14:18:00,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 140.14285714285714) internal successors, (981), 7 states have internal predecessors, (981), 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) [2023-08-27 14:18:00,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:00,488 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1] [2023-08-27 14:18:00,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-27 14:18:00,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:00,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:00,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash 32492996, now seen corresponding path program 1 times [2023-08-27 14:18:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:00,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890557954] [2023-08-27 14:18:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:00,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:00,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890557954] [2023-08-27 14:18:00,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890557954] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:00,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294971032] [2023-08-27 14:18:00,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:00,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:00,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:00,744 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) [2023-08-27 14:18:00,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-27 14:18:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:00,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-27 14:18:00,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:00,877 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 14:18:00,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294971032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:18:00,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 14:18:00,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-27 14:18:00,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36660270] [2023-08-27 14:18:00,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:18:00,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 14:18:00,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:00,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 14:18:00,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-27 14:18:00,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 358 [2023-08-27 14:18:00,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 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) [2023-08-27 14:18:00,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:00,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 358 [2023-08-27 14:18:00,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:01,870 INFO L124 PetriNetUnfolderBase]: 7397/9224 cut-off events. [2023-08-27 14:18:01,870 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-27 14:18:01,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18495 conditions, 9224 events. 7397/9224 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 42330 event pairs, 3542 based on Foata normal form. 0/2108 useless extension candidates. Maximal degree in co-relation 18459. Up to 9136 conditions per place. [2023-08-27 14:18:01,902 INFO L140 encePairwiseOnDemand]: 354/358 looper letters, 40 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-08-27 14:18:01,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 263 flow [2023-08-27 14:18:01,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 14:18:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 14:18:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 741 transitions. [2023-08-27 14:18:01,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41396648044692735 [2023-08-27 14:18:01,904 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 741 transitions. [2023-08-27 14:18:01,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 741 transitions. [2023-08-27 14:18:01,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:01,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 741 transitions. [2023-08-27 14:18:01,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.2) internal successors, (741), 5 states have internal predecessors, (741), 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) [2023-08-27 14:18:01,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 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) [2023-08-27 14:18:01,908 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 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) [2023-08-27 14:18:01,908 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 194 flow. Second operand 5 states and 741 transitions. [2023-08-27 14:18:01,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 263 flow [2023-08-27 14:18:01,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 242 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-27 14:18:01,910 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 162 flow [2023-08-27 14:18:01,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-27 14:18:01,910 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2023-08-27 14:18:01,910 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 162 flow [2023-08-27 14:18:01,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 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) [2023-08-27 14:18:01,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:01,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 14:18:01,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-27 14:18:02,116 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,SelfDestructingSolverStorable2 [2023-08-27 14:18:02,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:02,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1007205946, now seen corresponding path program 1 times [2023-08-27 14:18:02,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:02,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425282826] [2023-08-27 14:18:02,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:02,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425282826] [2023-08-27 14:18:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425282826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:18:02,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:18:02,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 14:18:02,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50022173] [2023-08-27 14:18:02,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:18:02,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 14:18:02,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 14:18:02,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 14:18:02,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 358 [2023-08-27 14:18:02,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 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) [2023-08-27 14:18:02,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:02,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 358 [2023-08-27 14:18:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:03,248 INFO L124 PetriNetUnfolderBase]: 8156/10638 cut-off events. [2023-08-27 14:18:03,248 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-27 14:18:03,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21327 conditions, 10638 events. 8156/10638 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 56792 event pairs, 4312 based on Foata normal form. 0/3124 useless extension candidates. Maximal degree in co-relation 21293. Up to 7777 conditions per place. [2023-08-27 14:18:03,285 INFO L140 encePairwiseOnDemand]: 345/358 looper letters, 93 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2023-08-27 14:18:03,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 100 transitions, 464 flow [2023-08-27 14:18:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 14:18:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 14:18:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2023-08-27 14:18:03,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2023-08-27 14:18:03,287 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2023-08-27 14:18:03,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2023-08-27 14:18:03,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:03,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2023-08-27 14:18:03,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 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) [2023-08-27 14:18:03,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 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) [2023-08-27 14:18:03,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 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) [2023-08-27 14:18:03,292 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 162 flow. Second operand 5 states and 716 transitions. [2023-08-27 14:18:03,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 100 transitions, 464 flow [2023-08-27 14:18:03,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 452 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 14:18:03,293 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 191 flow [2023-08-27 14:18:03,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-27 14:18:03,294 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2023-08-27 14:18:03,294 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 191 flow [2023-08-27 14:18:03,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 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) [2023-08-27 14:18:03,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:03,295 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-27 14:18:03,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 14:18:03,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:03,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1161043875, now seen corresponding path program 2 times [2023-08-27 14:18:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035579609] [2023-08-27 14:18:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:03,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:03,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035579609] [2023-08-27 14:18:03,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035579609] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:03,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984073768] [2023-08-27 14:18:03,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 14:18:03,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:03,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:03,348 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) [2023-08-27 14:18:03,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-27 14:18:03,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-27 14:18:03,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 14:18:03,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 14:18:03,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-27 14:18:03,505 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 14:18:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984073768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:18:03,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 14:18:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2023-08-27 14:18:03,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181194798] [2023-08-27 14:18:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:18:03,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:18:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:03,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:18:03,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-27 14:18:03,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 358 [2023-08-27 14:18:03,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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) [2023-08-27 14:18:03,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:03,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 358 [2023-08-27 14:18:03,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:04,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 117#$Ultimate##0true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), 40#L90-1true, Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 92#L47-6true]) [2023-08-27 14:18:04,111 INFO L294 olderBase$Statistics]: this new event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,111 INFO L297 olderBase$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-27 14:18:04,111 INFO L297 olderBase$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-27 14:18:04,111 INFO L297 olderBase$Statistics]: existing Event has 12 ancestors and is cut-off event [2023-08-27 14:18:04,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, 137#L89-4true, Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 68#L57-6true, 92#L47-6true]) [2023-08-27 14:18:04,312 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,312 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,312 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,312 INFO L297 olderBase$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-08-27 14:18:04,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), 10#thread2EXITtrue, 40#L90-1true, Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 92#L47-6true]) [2023-08-27 14:18:04,551 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:18:04,551 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,551 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,551 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), 40#L90-1true, Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 68#L57-6true, 92#L47-6true]) [2023-08-27 14:18:04,562 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:18:04,562 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,562 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,562 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, 3#thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), 40#L90-1true, Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 92#L47-6true]) [2023-08-27 14:18:04,570 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:18:04,570 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,570 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,570 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, Black: 231#(<= ~N~0 0), 43#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), 40#L90-1true, Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 92#L47-6true]) [2023-08-27 14:18:04,577 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:18:04,577 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,577 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,577 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), 40#L90-1true, Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), 169#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 92#L47-6true]) [2023-08-27 14:18:04,583 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:18:04,583 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,584 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,584 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 132#thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), 40#L90-1true, Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 92#L47-6true]) [2023-08-27 14:18:04,590 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:18:04,590 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,590 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,590 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), 40#L90-1true, Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), 25#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 92#L47-6true]) [2023-08-27 14:18:04,597 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:18:04,597 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,597 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,597 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][45], [120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 189#true, Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), 40#L90-1true, Black: 192#(<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1), Black: 207#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483646), Black: 203#(< |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2147483647), 101#thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 186#(= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0), 228#true, 92#L47-6true]) [2023-08-27 14:18:04,604 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:18:04,604 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,604 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:18:04,604 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:18:04,719 INFO L124 PetriNetUnfolderBase]: 8852/11170 cut-off events. [2023-08-27 14:18:04,720 INFO L125 PetriNetUnfolderBase]: For 1568/1749 co-relation queries the response was YES. [2023-08-27 14:18:04,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26040 conditions, 11170 events. 8852/11170 cut-off events. For 1568/1749 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 54298 event pairs, 4373 based on Foata normal form. 182/3272 useless extension candidates. Maximal degree in co-relation 26012. Up to 11062 conditions per place. [2023-08-27 14:18:04,765 INFO L140 encePairwiseOnDemand]: 356/358 looper letters, 47 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-08-27 14:18:04,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 52 transitions, 277 flow [2023-08-27 14:18:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:18:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:18:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-08-27 14:18:04,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42830540037243947 [2023-08-27 14:18:04,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-08-27 14:18:04,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-08-27 14:18:04,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:04,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-08-27 14:18:04,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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) [2023-08-27 14:18:04,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:04,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:04,769 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 191 flow. Second operand 3 states and 460 transitions. [2023-08-27 14:18:04,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 52 transitions, 277 flow [2023-08-27 14:18:04,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 256 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 14:18:04,772 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 162 flow [2023-08-27 14:18:04,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2023-08-27 14:18:04,772 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2023-08-27 14:18:04,772 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 162 flow [2023-08-27 14:18:04,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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) [2023-08-27 14:18:04,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:04,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 14:18:04,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-27 14:18:04,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:04,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:04,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1160965518, now seen corresponding path program 1 times [2023-08-27 14:18:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:04,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452801551] [2023-08-27 14:18:04,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:04,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:18:05,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:05,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452801551] [2023-08-27 14:18:05,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452801551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:18:05,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:18:05,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 14:18:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387854235] [2023-08-27 14:18:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:18:05,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:18:05,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:05,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:18:05,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:18:05,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 358 [2023-08-27 14:18:05,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:18:05,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:05,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 358 [2023-08-27 14:18:05,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:06,379 INFO L124 PetriNetUnfolderBase]: 11306/14371 cut-off events. [2023-08-27 14:18:06,379 INFO L125 PetriNetUnfolderBase]: For 1518/1699 co-relation queries the response was YES. [2023-08-27 14:18:06,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32727 conditions, 14371 events. 11306/14371 cut-off events. For 1518/1699 co-relation queries the response was YES. Maximal size of possible extension queue 1460. Compared 73382 event pairs, 2556 based on Foata normal form. 181/4342 useless extension candidates. Maximal degree in co-relation 32717. Up to 8468 conditions per place. [2023-08-27 14:18:06,421 INFO L140 encePairwiseOnDemand]: 352/358 looper letters, 77 selfloop transitions, 4 changer transitions 0/85 dead transitions. [2023-08-27 14:18:06,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 411 flow [2023-08-27 14:18:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:18:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:18:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-08-27 14:18:06,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47392923649906893 [2023-08-27 14:18:06,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-08-27 14:18:06,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-08-27 14:18:06,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:06,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-08-27 14:18:06,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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) [2023-08-27 14:18:06,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:06,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:06,425 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 162 flow. Second operand 3 states and 509 transitions. [2023-08-27 14:18:06,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 411 flow [2023-08-27 14:18:06,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 14:18:06,428 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 195 flow [2023-08-27 14:18:06,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2023-08-27 14:18:06,428 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2023-08-27 14:18:06,428 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 195 flow [2023-08-27 14:18:06,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 14:18:06,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:06,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 14:18:06,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 14:18:06,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:06,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1160965516, now seen corresponding path program 1 times [2023-08-27 14:18:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245993645] [2023-08-27 14:18:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:06,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245993645] [2023-08-27 14:18:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245993645] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687997746] [2023-08-27 14:18:06,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:06,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:06,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:06,569 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) [2023-08-27 14:18:06,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-27 14:18:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:06,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 14:18:06,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:06,719 INFO L351 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 11 treesize of output 7 [2023-08-27 14:18:06,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:06,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:18:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:06,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:18:06,838 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:06,838 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-08-27 14:18:06,845 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:06,846 INFO L351 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 33 treesize of output 29 [2023-08-27 14:18:06,851 INFO L351 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 5 treesize of output 3 [2023-08-27 14:18:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:06,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687997746] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:18:06,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:18:06,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-27 14:18:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035984233] [2023-08-27 14:18:06,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:18:06,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-27 14:18:06,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:06,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-27 14:18:06,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=97, Unknown=4, NotChecked=0, Total=132 [2023-08-27 14:18:06,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 358 [2023-08-27 14:18:06,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 195 flow. Second operand has 12 states, 12 states have (on average 118.25) internal successors, (1419), 12 states have internal predecessors, (1419), 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) [2023-08-27 14:18:06,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:06,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 358 [2023-08-27 14:18:06,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:09,111 INFO L124 PetriNetUnfolderBase]: 15035/19511 cut-off events. [2023-08-27 14:18:09,111 INFO L125 PetriNetUnfolderBase]: For 3764/4020 co-relation queries the response was YES. [2023-08-27 14:18:09,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45629 conditions, 19511 events. 15035/19511 cut-off events. For 3764/4020 co-relation queries the response was YES. Maximal size of possible extension queue 2316. Compared 110705 event pairs, 5159 based on Foata normal form. 0/6249 useless extension candidates. Maximal degree in co-relation 45617. Up to 13798 conditions per place. [2023-08-27 14:18:09,165 INFO L140 encePairwiseOnDemand]: 344/358 looper letters, 63 selfloop transitions, 26 changer transitions 0/91 dead transitions. [2023-08-27 14:18:09,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 489 flow [2023-08-27 14:18:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:18:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:18:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1017 transitions. [2023-08-27 14:18:09,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3550977653631285 [2023-08-27 14:18:09,167 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1017 transitions. [2023-08-27 14:18:09,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1017 transitions. [2023-08-27 14:18:09,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:09,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1017 transitions. [2023-08-27 14:18:09,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 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) [2023-08-27 14:18:09,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:09,172 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:09,172 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 195 flow. Second operand 8 states and 1017 transitions. [2023-08-27 14:18:09,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 489 flow [2023-08-27 14:18:09,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 14:18:09,177 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 336 flow [2023-08-27 14:18:09,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=336, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2023-08-27 14:18:09,178 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2023-08-27 14:18:09,178 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 336 flow [2023-08-27 14:18:09,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 118.25) internal successors, (1419), 12 states have internal predecessors, (1419), 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) [2023-08-27 14:18:09,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:09,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 14:18:09,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-27 14:18:09,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:09,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:09,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1160965515, now seen corresponding path program 1 times [2023-08-27 14:18:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:09,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107665154] [2023-08-27 14:18:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:09,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107665154] [2023-08-27 14:18:09,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107665154] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:09,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914120210] [2023-08-27 14:18:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:09,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:09,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:09,617 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:18:09,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-27 14:18:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:09,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 14:18:09,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:09,782 INFO L351 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 11 treesize of output 7 [2023-08-27 14:18:09,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:09,804 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:18:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:09,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:18:09,855 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:09,855 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-08-27 14:18:09,860 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:09,860 INFO L351 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 39 treesize of output 35 [2023-08-27 14:18:09,864 INFO L351 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 7 treesize of output 5 [2023-08-27 14:18:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:09,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914120210] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:18:09,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:18:09,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-27 14:18:09,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501131229] [2023-08-27 14:18:09,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:18:09,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-27 14:18:09,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:09,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-27 14:18:09,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2023-08-27 14:18:09,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 358 [2023-08-27 14:18:09,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 336 flow. Second operand has 12 states, 12 states have (on average 118.25) internal successors, (1419), 12 states have internal predecessors, (1419), 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) [2023-08-27 14:18:09,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:09,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 358 [2023-08-27 14:18:09,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:12,052 INFO L124 PetriNetUnfolderBase]: 15872/20689 cut-off events. [2023-08-27 14:18:12,053 INFO L125 PetriNetUnfolderBase]: For 10748/11004 co-relation queries the response was YES. [2023-08-27 14:18:12,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50273 conditions, 20689 events. 15872/20689 cut-off events. For 10748/11004 co-relation queries the response was YES. Maximal size of possible extension queue 2564. Compared 120279 event pairs, 5554 based on Foata normal form. 1/7300 useless extension candidates. Maximal degree in co-relation 50257. Up to 14958 conditions per place. [2023-08-27 14:18:12,132 INFO L140 encePairwiseOnDemand]: 344/358 looper letters, 63 selfloop transitions, 29 changer transitions 0/94 dead transitions. [2023-08-27 14:18:12,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 597 flow [2023-08-27 14:18:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:18:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:18:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1014 transitions. [2023-08-27 14:18:12,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3540502793296089 [2023-08-27 14:18:12,136 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1014 transitions. [2023-08-27 14:18:12,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1014 transitions. [2023-08-27 14:18:12,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:12,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1014 transitions. [2023-08-27 14:18:12,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.75) internal successors, (1014), 8 states have internal predecessors, (1014), 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) [2023-08-27 14:18:12,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:12,144 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:12,144 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 336 flow. Second operand 8 states and 1014 transitions. [2023-08-27 14:18:12,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 597 flow [2023-08-27 14:18:12,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 94 transitions, 581 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-27 14:18:12,152 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 409 flow [2023-08-27 14:18:12,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=409, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2023-08-27 14:18:12,152 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2023-08-27 14:18:12,153 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 409 flow [2023-08-27 14:18:12,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 118.25) internal successors, (1419), 12 states have internal predecessors, (1419), 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) [2023-08-27 14:18:12,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:12,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:12,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-27 14:18:12,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:12,358 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:12,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1563849374, now seen corresponding path program 1 times [2023-08-27 14:18:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231230622] [2023-08-27 14:18:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:12,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:12,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231230622] [2023-08-27 14:18:12,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231230622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:18:12,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:18:12,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 14:18:12,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516059128] [2023-08-27 14:18:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:18:12,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:18:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:12,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:18:12,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:18:12,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 358 [2023-08-27 14:18:12,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-27 14:18:12,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:12,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 358 [2023-08-27 14:18:12,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:15,235 INFO L124 PetriNetUnfolderBase]: 18757/24922 cut-off events. [2023-08-27 14:18:15,235 INFO L125 PetriNetUnfolderBase]: For 26222/27445 co-relation queries the response was YES. [2023-08-27 14:18:15,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63797 conditions, 24922 events. 18757/24922 cut-off events. For 26222/27445 co-relation queries the response was YES. Maximal size of possible extension queue 3059. Compared 149301 event pairs, 2705 based on Foata normal form. 1163/10822 useless extension candidates. Maximal degree in co-relation 63779. Up to 18294 conditions per place. [2023-08-27 14:18:15,321 INFO L140 encePairwiseOnDemand]: 347/358 looper letters, 96 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2023-08-27 14:18:15,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 110 transitions, 813 flow [2023-08-27 14:18:15,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:18:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:18:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-08-27 14:18:15,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720670391061452 [2023-08-27 14:18:15,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-08-27 14:18:15,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-08-27 14:18:15,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:15,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-08-27 14:18:15,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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) [2023-08-27 14:18:15,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:15,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:15,337 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 409 flow. Second operand 3 states and 507 transitions. [2023-08-27 14:18:15,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 110 transitions, 813 flow [2023-08-27 14:18:15,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 110 transitions, 801 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 14:18:15,350 INFO L231 Difference]: Finished difference. Result has 72 places, 80 transitions, 473 flow [2023-08-27 14:18:15,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=72, PETRI_TRANSITIONS=80} [2023-08-27 14:18:15,351 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2023-08-27 14:18:15,351 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 80 transitions, 473 flow [2023-08-27 14:18:15,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-27 14:18:15,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:15,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:15,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 14:18:15,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:15,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1563849473, now seen corresponding path program 1 times [2023-08-27 14:18:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:15,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601759537] [2023-08-27 14:18:15,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:15,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601759537] [2023-08-27 14:18:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601759537] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:18:15,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:18:15,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 14:18:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859462727] [2023-08-27 14:18:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:18:15,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:18:15,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:15,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:18:15,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:18:15,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 358 [2023-08-27 14:18:15,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 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) [2023-08-27 14:18:15,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:15,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 358 [2023-08-27 14:18:15,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:18,314 INFO L124 PetriNetUnfolderBase]: 21149/29929 cut-off events. [2023-08-27 14:18:18,314 INFO L125 PetriNetUnfolderBase]: For 48069/49761 co-relation queries the response was YES. [2023-08-27 14:18:18,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94139 conditions, 29929 events. 21149/29929 cut-off events. For 48069/49761 co-relation queries the response was YES. Maximal size of possible extension queue 3729. Compared 217456 event pairs, 8013 based on Foata normal form. 1653/20527 useless extension candidates. Maximal degree in co-relation 94118. Up to 19421 conditions per place. [2023-08-27 14:18:18,430 INFO L140 encePairwiseOnDemand]: 353/358 looper letters, 112 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2023-08-27 14:18:18,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 120 transitions, 945 flow [2023-08-27 14:18:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:18:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:18:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-08-27 14:18:18,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581005586592179 [2023-08-27 14:18:18,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-08-27 14:18:18,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-08-27 14:18:18,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:18,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-08-27 14:18:18,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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) [2023-08-27 14:18:18,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:18,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:18,441 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 473 flow. Second operand 3 states and 492 transitions. [2023-08-27 14:18:18,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 120 transitions, 945 flow [2023-08-27 14:18:18,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 120 transitions, 915 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:18:18,545 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 491 flow [2023-08-27 14:18:18,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=491, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2023-08-27 14:18:18,546 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2023-08-27 14:18:18,547 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 491 flow [2023-08-27 14:18:18,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 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) [2023-08-27 14:18:18,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:18,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:18,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 14:18:18,547 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:18,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:18,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1563849373, now seen corresponding path program 1 times [2023-08-27 14:18:18,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:18,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923918051] [2023-08-27 14:18:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:18,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:18,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923918051] [2023-08-27 14:18:18,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923918051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:18:18,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:18:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 14:18:18,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150371130] [2023-08-27 14:18:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:18:18,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:18:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:18:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:18:18,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 358 [2023-08-27 14:18:18,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 491 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-27 14:18:18,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:18,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 358 [2023-08-27 14:18:18,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:21,925 INFO L124 PetriNetUnfolderBase]: 20346/29283 cut-off events. [2023-08-27 14:18:21,926 INFO L125 PetriNetUnfolderBase]: For 42181/45150 co-relation queries the response was YES. [2023-08-27 14:18:21,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93662 conditions, 29283 events. 20346/29283 cut-off events. For 42181/45150 co-relation queries the response was YES. Maximal size of possible extension queue 4029. Compared 218131 event pairs, 3865 based on Foata normal form. 3151/21150 useless extension candidates. Maximal degree in co-relation 93641. Up to 22219 conditions per place. [2023-08-27 14:18:22,088 INFO L140 encePairwiseOnDemand]: 347/358 looper letters, 108 selfloop transitions, 14 changer transitions 0/127 dead transitions. [2023-08-27 14:18:22,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 127 transitions, 988 flow [2023-08-27 14:18:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:18:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:18:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-08-27 14:18:22,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720670391061452 [2023-08-27 14:18:22,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-08-27 14:18:22,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-08-27 14:18:22,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:22,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-08-27 14:18:22,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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) [2023-08-27 14:18:22,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:22,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:18:22,104 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 491 flow. Second operand 3 states and 507 transitions. [2023-08-27 14:18:22,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 127 transitions, 988 flow [2023-08-27 14:18:22,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 127 transitions, 981 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 14:18:22,134 INFO L231 Difference]: Finished difference. Result has 76 places, 96 transitions, 647 flow [2023-08-27 14:18:22,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=647, PETRI_PLACES=76, PETRI_TRANSITIONS=96} [2023-08-27 14:18:22,134 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2023-08-27 14:18:22,134 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 96 transitions, 647 flow [2023-08-27 14:18:22,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-27 14:18:22,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:22,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:22,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 14:18:22,135 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:22,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1563849371, now seen corresponding path program 1 times [2023-08-27 14:18:22,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:22,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190853465] [2023-08-27 14:18:22,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:22,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:22,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190853465] [2023-08-27 14:18:22,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190853465] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:18:22,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:18:22,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 14:18:22,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818550860] [2023-08-27 14:18:22,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:18:22,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 14:18:22,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:22,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 14:18:22,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 14:18:22,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 358 [2023-08-27 14:18:22,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 96 transitions, 647 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 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) [2023-08-27 14:18:22,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:22,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 358 [2023-08-27 14:18:22,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:24,866 INFO L124 PetriNetUnfolderBase]: 18195/27139 cut-off events. [2023-08-27 14:18:24,867 INFO L125 PetriNetUnfolderBase]: For 57865/58272 co-relation queries the response was YES. [2023-08-27 14:18:24,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98010 conditions, 27139 events. 18195/27139 cut-off events. For 57865/58272 co-relation queries the response was YES. Maximal size of possible extension queue 2966. Compared 200025 event pairs, 12722 based on Foata normal form. 631/20060 useless extension candidates. Maximal degree in co-relation 97986. Up to 26426 conditions per place. [2023-08-27 14:18:25,219 INFO L140 encePairwiseOnDemand]: 348/358 looper letters, 127 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2023-08-27 14:18:25,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 1073 flow [2023-08-27 14:18:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 14:18:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 14:18:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-08-27 14:18:25,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3770949720670391 [2023-08-27 14:18:25,221 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-08-27 14:18:25,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-08-27 14:18:25,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:25,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-08-27 14:18:25,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 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) [2023-08-27 14:18:25,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 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) [2023-08-27 14:18:25,224 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 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) [2023-08-27 14:18:25,224 INFO L175 Difference]: Start difference. First operand has 76 places, 96 transitions, 647 flow. Second operand 5 states and 675 transitions. [2023-08-27 14:18:25,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 1073 flow [2023-08-27 14:18:25,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 135 transitions, 1033 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:18:25,276 INFO L231 Difference]: Finished difference. Result has 80 places, 98 transitions, 666 flow [2023-08-27 14:18:25,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=666, PETRI_PLACES=80, PETRI_TRANSITIONS=98} [2023-08-27 14:18:25,277 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2023-08-27 14:18:25,277 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 98 transitions, 666 flow [2023-08-27 14:18:25,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 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) [2023-08-27 14:18:25,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:25,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:25,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 14:18:25,277 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:25,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1003511790, now seen corresponding path program 1 times [2023-08-27 14:18:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409968517] [2023-08-27 14:18:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:18:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409968517] [2023-08-27 14:18:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409968517] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310167553] [2023-08-27 14:18:25,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:25,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:25,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:25,325 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:18:25,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-27 14:18:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:25,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 14:18:25,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:18:25,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 14:18:25,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310167553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:18:25,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 14:18:25,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-27 14:18:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597390188] [2023-08-27 14:18:25,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:18:25,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 14:18:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 14:18:25,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 14:18:25,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 358 [2023-08-27 14:18:25,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 98 transitions, 666 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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) [2023-08-27 14:18:25,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:25,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 358 [2023-08-27 14:18:25,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:28,142 INFO L124 PetriNetUnfolderBase]: 17232/25006 cut-off events. [2023-08-27 14:18:28,142 INFO L125 PetriNetUnfolderBase]: For 44342/45913 co-relation queries the response was YES. [2023-08-27 14:18:28,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92164 conditions, 25006 events. 17232/25006 cut-off events. For 44342/45913 co-relation queries the response was YES. Maximal size of possible extension queue 3162. Compared 187114 event pairs, 4617 based on Foata normal form. 1569/17733 useless extension candidates. Maximal degree in co-relation 92138. Up to 12896 conditions per place. [2023-08-27 14:18:28,248 INFO L140 encePairwiseOnDemand]: 353/358 looper letters, 178 selfloop transitions, 10 changer transitions 0/191 dead transitions. [2023-08-27 14:18:28,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 191 transitions, 1638 flow [2023-08-27 14:18:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 14:18:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 14:18:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 652 transitions. [2023-08-27 14:18:28,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4553072625698324 [2023-08-27 14:18:28,250 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 652 transitions. [2023-08-27 14:18:28,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 652 transitions. [2023-08-27 14:18:28,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:28,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 652 transitions. [2023-08-27 14:18:28,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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) [2023-08-27 14:18:28,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 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) [2023-08-27 14:18:28,266 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 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) [2023-08-27 14:18:28,266 INFO L175 Difference]: Start difference. First operand has 80 places, 98 transitions, 666 flow. Second operand 4 states and 652 transitions. [2023-08-27 14:18:28,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 191 transitions, 1638 flow [2023-08-27 14:18:28,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 191 transitions, 1633 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:18:28,338 INFO L231 Difference]: Finished difference. Result has 80 places, 96 transitions, 652 flow [2023-08-27 14:18:28,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=652, PETRI_PLACES=80, PETRI_TRANSITIONS=96} [2023-08-27 14:18:28,339 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2023-08-27 14:18:28,339 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 96 transitions, 652 flow [2023-08-27 14:18:28,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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) [2023-08-27 14:18:28,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:28,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:28,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-27 14:18:28,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:28,545 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:28,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash -997117094, now seen corresponding path program 1 times [2023-08-27 14:18:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130121298] [2023-08-27 14:18:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:18:28,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:28,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130121298] [2023-08-27 14:18:28,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130121298] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:28,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395475889] [2023-08-27 14:18:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:28,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:28,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:28,597 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:18:28,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-27 14:18:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:28,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-27 14:18:28,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:28,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:18:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395475889] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:18:28,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:18:28,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 12 [2023-08-27 14:18:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548646445] [2023-08-27 14:18:28,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:18:28,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 14:18:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:28,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 14:18:28,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-08-27 14:18:28,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 358 [2023-08-27 14:18:28,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 96 transitions, 652 flow. Second operand has 13 states, 13 states have (on average 124.6923076923077) internal successors, (1621), 13 states have internal predecessors, (1621), 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) [2023-08-27 14:18:28,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:28,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 358 [2023-08-27 14:18:28,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:33,616 INFO L124 PetriNetUnfolderBase]: 30511/44502 cut-off events. [2023-08-27 14:18:33,616 INFO L125 PetriNetUnfolderBase]: For 104117/106590 co-relation queries the response was YES. [2023-08-27 14:18:33,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164481 conditions, 44502 events. 30511/44502 cut-off events. For 104117/106590 co-relation queries the response was YES. Maximal size of possible extension queue 4678. Compared 350602 event pairs, 11706 based on Foata normal form. 5062/33696 useless extension candidates. Maximal degree in co-relation 164456. Up to 15837 conditions per place. [2023-08-27 14:18:33,869 INFO L140 encePairwiseOnDemand]: 346/358 looper letters, 322 selfloop transitions, 22 changer transitions 0/347 dead transitions. [2023-08-27 14:18:33,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 347 transitions, 2956 flow [2023-08-27 14:18:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 14:18:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 14:18:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1287 transitions. [2023-08-27 14:18:33,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994413407821229 [2023-08-27 14:18:33,881 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1287 transitions. [2023-08-27 14:18:33,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1287 transitions. [2023-08-27 14:18:33,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:33,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1287 transitions. [2023-08-27 14:18:33,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.0) internal successors, (1287), 9 states have internal predecessors, (1287), 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) [2023-08-27 14:18:33,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 358.0) internal successors, (3580), 10 states have internal predecessors, (3580), 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) [2023-08-27 14:18:33,887 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 358.0) internal successors, (3580), 10 states have internal predecessors, (3580), 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) [2023-08-27 14:18:33,887 INFO L175 Difference]: Start difference. First operand has 80 places, 96 transitions, 652 flow. Second operand 9 states and 1287 transitions. [2023-08-27 14:18:33,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 347 transitions, 2956 flow [2023-08-27 14:18:33,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 347 transitions, 2938 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 14:18:33,959 INFO L231 Difference]: Finished difference. Result has 90 places, 104 transitions, 820 flow [2023-08-27 14:18:33,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=820, PETRI_PLACES=90, PETRI_TRANSITIONS=104} [2023-08-27 14:18:33,960 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 34 predicate places. [2023-08-27 14:18:33,960 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 104 transitions, 820 flow [2023-08-27 14:18:33,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 124.6923076923077) internal successors, (1621), 13 states have internal predecessors, (1621), 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) [2023-08-27 14:18:33,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:33,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:33,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-27 14:18:34,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:34,165 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:34,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1630402790, now seen corresponding path program 1 times [2023-08-27 14:18:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991703209] [2023-08-27 14:18:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:34,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991703209] [2023-08-27 14:18:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991703209] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695704427] [2023-08-27 14:18:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:34,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:34,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:34,350 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:18:34,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-27 14:18:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:34,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-27 14:18:34,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:34,506 INFO L351 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 11 treesize of output 7 [2023-08-27 14:18:34,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:34,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:18:34,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:34,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:18:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:34,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:18:34,568 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_448 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2023-08-27 14:18:34,598 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:34,598 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-08-27 14:18:34,608 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:34,608 INFO L351 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 63 treesize of output 59 [2023-08-27 14:18:34,611 INFO L351 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 48 treesize of output 44 [2023-08-27 14:18:34,615 INFO L351 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 22 treesize of output 20 [2023-08-27 14:18:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695704427] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:18:34,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:18:34,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-27 14:18:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91160349] [2023-08-27 14:18:34,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:18:34,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 14:18:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:34,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 14:18:34,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2023-08-27 14:18:34,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 358 [2023-08-27 14:18:34,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 104 transitions, 820 flow. Second operand has 15 states, 15 states have (on average 115.26666666666667) internal successors, (1729), 15 states have internal predecessors, (1729), 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) [2023-08-27 14:18:34,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:34,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 358 [2023-08-27 14:18:34,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:39,877 INFO L124 PetriNetUnfolderBase]: 28776/42110 cut-off events. [2023-08-27 14:18:39,877 INFO L125 PetriNetUnfolderBase]: For 164524/166873 co-relation queries the response was YES. [2023-08-27 14:18:40,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169634 conditions, 42110 events. 28776/42110 cut-off events. For 164524/166873 co-relation queries the response was YES. Maximal size of possible extension queue 4816. Compared 332585 event pairs, 6517 based on Foata normal form. 2375/30063 useless extension candidates. Maximal degree in co-relation 169605. Up to 29924 conditions per place. [2023-08-27 14:18:40,166 INFO L140 encePairwiseOnDemand]: 346/358 looper letters, 160 selfloop transitions, 38 changer transitions 0/201 dead transitions. [2023-08-27 14:18:40,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 201 transitions, 1949 flow [2023-08-27 14:18:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:18:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:18:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1017 transitions. [2023-08-27 14:18:40,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3550977653631285 [2023-08-27 14:18:40,169 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1017 transitions. [2023-08-27 14:18:40,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1017 transitions. [2023-08-27 14:18:40,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:40,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1017 transitions. [2023-08-27 14:18:40,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 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) [2023-08-27 14:18:40,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:40,173 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:40,173 INFO L175 Difference]: Start difference. First operand has 90 places, 104 transitions, 820 flow. Second operand 8 states and 1017 transitions. [2023-08-27 14:18:40,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 201 transitions, 1949 flow [2023-08-27 14:18:40,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 201 transitions, 1915 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-27 14:18:40,318 INFO L231 Difference]: Finished difference. Result has 96 places, 119 transitions, 1077 flow [2023-08-27 14:18:40,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1077, PETRI_PLACES=96, PETRI_TRANSITIONS=119} [2023-08-27 14:18:40,318 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 40 predicate places. [2023-08-27 14:18:40,318 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 119 transitions, 1077 flow [2023-08-27 14:18:40,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 115.26666666666667) internal successors, (1729), 15 states have internal predecessors, (1729), 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) [2023-08-27 14:18:40,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:40,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:40,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-27 14:18:40,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-27 14:18:40,524 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:40,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:40,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1630402789, now seen corresponding path program 1 times [2023-08-27 14:18:40,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:40,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563192196] [2023-08-27 14:18:40,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:40,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563192196] [2023-08-27 14:18:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563192196] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:40,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223311253] [2023-08-27 14:18:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:40,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:40,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:40,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:18:40,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-27 14:18:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:40,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-27 14:18:40,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:40,889 INFO L351 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 11 treesize of output 7 [2023-08-27 14:18:40,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:40,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:18:40,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:40,933 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:18:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:40,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:18:40,963 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_492) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2023-08-27 14:18:40,990 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:40,991 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-08-27 14:18:40,997 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:40,997 INFO L351 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 143 treesize of output 135 [2023-08-27 14:18:41,001 INFO L351 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 24 treesize of output 20 [2023-08-27 14:18:41,007 INFO L351 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 27 treesize of output 25 [2023-08-27 14:18:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:41,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223311253] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:18:41,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:18:41,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-27 14:18:41,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724605698] [2023-08-27 14:18:41,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:18:41,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 14:18:41,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:41,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 14:18:41,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2023-08-27 14:18:41,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 358 [2023-08-27 14:18:41,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 119 transitions, 1077 flow. Second operand has 15 states, 15 states have (on average 115.26666666666667) internal successors, (1729), 15 states have internal predecessors, (1729), 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) [2023-08-27 14:18:41,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:41,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 358 [2023-08-27 14:18:41,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:46,255 INFO L124 PetriNetUnfolderBase]: 27873/40515 cut-off events. [2023-08-27 14:18:46,256 INFO L125 PetriNetUnfolderBase]: For 181331/183592 co-relation queries the response was YES. [2023-08-27 14:18:46,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170006 conditions, 40515 events. 27873/40515 cut-off events. For 181331/183592 co-relation queries the response was YES. Maximal size of possible extension queue 4266. Compared 312451 event pairs, 6558 based on Foata normal form. 2287/29026 useless extension candidates. Maximal degree in co-relation 169974. Up to 28409 conditions per place. [2023-08-27 14:18:46,496 INFO L140 encePairwiseOnDemand]: 346/358 looper letters, 159 selfloop transitions, 39 changer transitions 0/201 dead transitions. [2023-08-27 14:18:46,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 201 transitions, 2047 flow [2023-08-27 14:18:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:18:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:18:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1016 transitions. [2023-08-27 14:18:46,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3547486033519553 [2023-08-27 14:18:46,507 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1016 transitions. [2023-08-27 14:18:46,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1016 transitions. [2023-08-27 14:18:46,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:46,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1016 transitions. [2023-08-27 14:18:46,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 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) [2023-08-27 14:18:46,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:46,527 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:46,527 INFO L175 Difference]: Start difference. First operand has 96 places, 119 transitions, 1077 flow. Second operand 8 states and 1016 transitions. [2023-08-27 14:18:46,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 201 transitions, 2047 flow [2023-08-27 14:18:46,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 201 transitions, 2007 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-27 14:18:46,675 INFO L231 Difference]: Finished difference. Result has 101 places, 120 transitions, 1124 flow [2023-08-27 14:18:46,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1124, PETRI_PLACES=101, PETRI_TRANSITIONS=120} [2023-08-27 14:18:46,675 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 45 predicate places. [2023-08-27 14:18:46,675 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 120 transitions, 1124 flow [2023-08-27 14:18:46,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 115.26666666666667) internal successors, (1729), 15 states have internal predecessors, (1729), 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) [2023-08-27 14:18:46,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:46,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:46,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-27 14:18:46,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-27 14:18:46,881 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:46,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:46,881 INFO L85 PathProgramCache]: Analyzing trace with hash -997060180, now seen corresponding path program 1 times [2023-08-27 14:18:46,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:46,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741124375] [2023-08-27 14:18:46,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:46,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:47,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741124375] [2023-08-27 14:18:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741124375] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170482949] [2023-08-27 14:18:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:47,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:47,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:47,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:18:47,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-27 14:18:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:47,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-27 14:18:47,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:47,228 INFO L351 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 11 treesize of output 7 [2023-08-27 14:18:47,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:47,247 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:18:47,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:47,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:18:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:47,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:18:47,337 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:47,337 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-08-27 14:18:47,342 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:47,342 INFO L351 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 63 treesize of output 59 [2023-08-27 14:18:47,345 INFO L351 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 24 treesize of output 22 [2023-08-27 14:18:47,348 INFO L351 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 46 treesize of output 42 [2023-08-27 14:18:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170482949] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:18:47,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:18:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-27 14:18:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673620406] [2023-08-27 14:18:47,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:18:47,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 14:18:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:47,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 14:18:47,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=156, Unknown=9, NotChecked=0, Total=210 [2023-08-27 14:18:47,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 358 [2023-08-27 14:18:47,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 120 transitions, 1124 flow. Second operand has 15 states, 15 states have (on average 115.4) internal successors, (1731), 15 states have internal predecessors, (1731), 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) [2023-08-27 14:18:47,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:47,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 358 [2023-08-27 14:18:47,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:18:54,469 INFO L124 PetriNetUnfolderBase]: 36008/54028 cut-off events. [2023-08-27 14:18:54,469 INFO L125 PetriNetUnfolderBase]: For 278201/278598 co-relation queries the response was YES. [2023-08-27 14:18:54,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228587 conditions, 54028 events. 36008/54028 cut-off events. For 278201/278598 co-relation queries the response was YES. Maximal size of possible extension queue 5768. Compared 451431 event pairs, 10484 based on Foata normal form. 396/36075 useless extension candidates. Maximal degree in co-relation 228554. Up to 30002 conditions per place. [2023-08-27 14:18:54,991 INFO L140 encePairwiseOnDemand]: 345/358 looper letters, 162 selfloop transitions, 50 changer transitions 0/220 dead transitions. [2023-08-27 14:18:54,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 220 transitions, 2536 flow [2023-08-27 14:18:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:18:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:18:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1012 transitions. [2023-08-27 14:18:54,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35335195530726254 [2023-08-27 14:18:54,993 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1012 transitions. [2023-08-27 14:18:54,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1012 transitions. [2023-08-27 14:18:54,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:18:54,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1012 transitions. [2023-08-27 14:18:54,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 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) [2023-08-27 14:18:54,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:54,997 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:18:54,997 INFO L175 Difference]: Start difference. First operand has 101 places, 120 transitions, 1124 flow. Second operand 8 states and 1012 transitions. [2023-08-27 14:18:54,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 220 transitions, 2536 flow [2023-08-27 14:18:55,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 220 transitions, 2481 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-27 14:18:55,315 INFO L231 Difference]: Finished difference. Result has 107 places, 145 transitions, 1440 flow [2023-08-27 14:18:55,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1440, PETRI_PLACES=107, PETRI_TRANSITIONS=145} [2023-08-27 14:18:55,316 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 51 predicate places. [2023-08-27 14:18:55,316 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 145 transitions, 1440 flow [2023-08-27 14:18:55,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 115.4) internal successors, (1731), 15 states have internal predecessors, (1731), 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) [2023-08-27 14:18:55,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:18:55,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:18:55,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-27 14:18:55,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-27 14:18:55,521 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:18:55,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:18:55,522 INFO L85 PathProgramCache]: Analyzing trace with hash -997060181, now seen corresponding path program 1 times [2023-08-27 14:18:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:18:55,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617661969] [2023-08-27 14:18:55,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:18:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:55,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:18:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617661969] [2023-08-27 14:18:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617661969] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:18:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886700330] [2023-08-27 14:18:55,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:18:55,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:18:55,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:18:55,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:18:55,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-27 14:18:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:18:55,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-27 14:18:55,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:18:55,833 INFO L351 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 11 treesize of output 7 [2023-08-27 14:18:55,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:55,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:18:55,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:18:55,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:18:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:18:55,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:18:55,896 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2023-08-27 14:18:55,902 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2023-08-27 14:18:55,907 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:55,908 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-08-27 14:18:55,912 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:18:55,913 INFO L351 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 143 treesize of output 135 [2023-08-27 14:18:55,915 INFO L351 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 27 treesize of output 25 [2023-08-27 14:18:55,929 INFO L351 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 24 treesize of output 20 [2023-08-27 14:18:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 14:18:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886700330] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:18:55,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:18:55,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-27 14:18:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994222386] [2023-08-27 14:18:55,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:18:55,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 14:18:55,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:18:55,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 14:18:55,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2023-08-27 14:18:55,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 358 [2023-08-27 14:18:55,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 145 transitions, 1440 flow. Second operand has 15 states, 15 states have (on average 115.4) internal successors, (1731), 15 states have internal predecessors, (1731), 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) [2023-08-27 14:18:55,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:18:55,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 358 [2023-08-27 14:18:55,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:02,671 INFO L124 PetriNetUnfolderBase]: 35897/53664 cut-off events. [2023-08-27 14:19:02,671 INFO L125 PetriNetUnfolderBase]: For 296943/297332 co-relation queries the response was YES. [2023-08-27 14:19:02,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236812 conditions, 53664 events. 35897/53664 cut-off events. For 296943/297332 co-relation queries the response was YES. Maximal size of possible extension queue 6139. Compared 446745 event pairs, 10114 based on Foata normal form. 414/38185 useless extension candidates. Maximal degree in co-relation 236776. Up to 29680 conditions per place. [2023-08-27 14:19:03,060 INFO L140 encePairwiseOnDemand]: 345/358 looper letters, 161 selfloop transitions, 66 changer transitions 0/235 dead transitions. [2023-08-27 14:19:03,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 235 transitions, 2830 flow [2023-08-27 14:19:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 14:19:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 14:19:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1011 transitions. [2023-08-27 14:19:03,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3530027932960894 [2023-08-27 14:19:03,062 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1011 transitions. [2023-08-27 14:19:03,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1011 transitions. [2023-08-27 14:19:03,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:03,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1011 transitions. [2023-08-27 14:19:03,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 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) [2023-08-27 14:19:03,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:19:03,066 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 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) [2023-08-27 14:19:03,066 INFO L175 Difference]: Start difference. First operand has 107 places, 145 transitions, 1440 flow. Second operand 8 states and 1011 transitions. [2023-08-27 14:19:03,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 235 transitions, 2830 flow [2023-08-27 14:19:03,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 235 transitions, 2814 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-27 14:19:03,574 INFO L231 Difference]: Finished difference. Result has 112 places, 161 transitions, 1738 flow [2023-08-27 14:19:03,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1738, PETRI_PLACES=112, PETRI_TRANSITIONS=161} [2023-08-27 14:19:03,575 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 56 predicate places. [2023-08-27 14:19:03,575 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 161 transitions, 1738 flow [2023-08-27 14:19:03,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 115.4) internal successors, (1731), 15 states have internal predecessors, (1731), 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) [2023-08-27 14:19:03,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:03,575 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:03,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-27 14:19:03,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-27 14:19:03,781 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:19:03,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash -930713036, now seen corresponding path program 1 times [2023-08-27 14:19:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:03,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759011733] [2023-08-27 14:19:03,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:03,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:03,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759011733] [2023-08-27 14:19:03,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759011733] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:19:03,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606358388] [2023-08-27 14:19:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:03,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:03,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:19:03,950 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:19:03,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-27 14:19:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:04,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 14:19:04,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:19:04,131 INFO L351 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 11 treesize of output 7 [2023-08-27 14:19:04,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:04,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:19:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:04,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:19:04,211 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2023-08-27 14:19:04,216 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:04,217 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-27 14:19:04,222 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:04,222 INFO L351 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 43 treesize of output 37 [2023-08-27 14:19:04,225 INFO L351 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 9 treesize of output 5 [2023-08-27 14:19:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 14:19:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606358388] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:19:04,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:19:04,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-27 14:19:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584344036] [2023-08-27 14:19:04,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:19:04,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 14:19:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:04,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 14:19:04,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2023-08-27 14:19:04,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 358 [2023-08-27 14:19:04,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 161 transitions, 1738 flow. Second operand has 18 states, 18 states have (on average 118.22222222222223) internal successors, (2128), 18 states have internal predecessors, (2128), 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) [2023-08-27 14:19:04,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:04,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 358 [2023-08-27 14:19:04,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:11,616 INFO L124 PetriNetUnfolderBase]: 36324/54080 cut-off events. [2023-08-27 14:19:11,617 INFO L125 PetriNetUnfolderBase]: For 317581/318342 co-relation queries the response was YES. [2023-08-27 14:19:11,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244778 conditions, 54080 events. 36324/54080 cut-off events. For 317581/318342 co-relation queries the response was YES. Maximal size of possible extension queue 6285. Compared 447301 event pairs, 12371 based on Foata normal form. 760/38673 useless extension candidates. Maximal degree in co-relation 244741. Up to 38502 conditions per place. [2023-08-27 14:19:12,013 INFO L140 encePairwiseOnDemand]: 345/358 looper letters, 178 selfloop transitions, 44 changer transitions 0/226 dead transitions. [2023-08-27 14:19:12,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 226 transitions, 2756 flow [2023-08-27 14:19:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 14:19:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 14:19:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1372 transitions. [2023-08-27 14:19:12,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484002031488065 [2023-08-27 14:19:12,015 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1372 transitions. [2023-08-27 14:19:12,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1372 transitions. [2023-08-27 14:19:12,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:12,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1372 transitions. [2023-08-27 14:19:12,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.72727272727273) internal successors, (1372), 11 states have internal predecessors, (1372), 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) [2023-08-27 14:19:12,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:19:12,020 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:19:12,020 INFO L175 Difference]: Start difference. First operand has 112 places, 161 transitions, 1738 flow. Second operand 11 states and 1372 transitions. [2023-08-27 14:19:12,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 226 transitions, 2756 flow [2023-08-27 14:19:12,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 226 transitions, 2731 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-27 14:19:12,455 INFO L231 Difference]: Finished difference. Result has 122 places, 172 transitions, 1951 flow [2023-08-27 14:19:12,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1951, PETRI_PLACES=122, PETRI_TRANSITIONS=172} [2023-08-27 14:19:12,456 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 66 predicate places. [2023-08-27 14:19:12,456 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 172 transitions, 1951 flow [2023-08-27 14:19:12,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 118.22222222222223) internal successors, (2128), 18 states have internal predecessors, (2128), 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) [2023-08-27 14:19:12,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:12,456 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:12,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-27 14:19:12,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:12,661 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:19:12,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:12,661 INFO L85 PathProgramCache]: Analyzing trace with hash -930713032, now seen corresponding path program 1 times [2023-08-27 14:19:12,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:12,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438483238] [2023-08-27 14:19:12,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:12,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 14:19:12,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:12,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438483238] [2023-08-27 14:19:12,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438483238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:19:12,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:19:12,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 14:19:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848682270] [2023-08-27 14:19:12,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:19:12,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:19:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:12,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:19:12,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:19:12,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 358 [2023-08-27 14:19:12,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 172 transitions, 1951 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-27 14:19:12,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:12,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 358 [2023-08-27 14:19:12,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:19,123 INFO L124 PetriNetUnfolderBase]: 31562/47221 cut-off events. [2023-08-27 14:19:19,123 INFO L125 PetriNetUnfolderBase]: For 330341/331154 co-relation queries the response was YES. [2023-08-27 14:19:19,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215515 conditions, 47221 events. 31562/47221 cut-off events. For 330341/331154 co-relation queries the response was YES. Maximal size of possible extension queue 5473. Compared 387861 event pairs, 17902 based on Foata normal form. 812/34595 useless extension candidates. Maximal degree in co-relation 215474. Up to 46971 conditions per place. [2023-08-27 14:19:19,578 INFO L140 encePairwiseOnDemand]: 356/358 looper letters, 156 selfloop transitions, 1 changer transitions 0/168 dead transitions. [2023-08-27 14:19:19,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 168 transitions, 2183 flow [2023-08-27 14:19:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:19:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:19:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-08-27 14:19:19,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4404096834264432 [2023-08-27 14:19:19,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-08-27 14:19:19,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-08-27 14:19:19,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:19,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-08-27 14:19:19,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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) [2023-08-27 14:19:19,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:19:19,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:19:19,581 INFO L175 Difference]: Start difference. First operand has 122 places, 172 transitions, 1951 flow. Second operand 3 states and 473 transitions. [2023-08-27 14:19:19,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 168 transitions, 2183 flow [2023-08-27 14:19:20,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 2157 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 14:19:20,170 INFO L231 Difference]: Finished difference. Result has 119 places, 168 transitions, 1845 flow [2023-08-27 14:19:20,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1845, PETRI_PLACES=119, PETRI_TRANSITIONS=168} [2023-08-27 14:19:20,170 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2023-08-27 14:19:20,170 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 168 transitions, 1845 flow [2023-08-27 14:19:20,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-27 14:19:20,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:20,171 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:20,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 14:19:20,171 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:19:20,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash -930713035, now seen corresponding path program 1 times [2023-08-27 14:19:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017604366] [2023-08-27 14:19:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017604366] [2023-08-27 14:19:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017604366] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:19:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022495308] [2023-08-27 14:19:20,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:20,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:19:20,353 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:19:20,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-27 14:19:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:20,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-27 14:19:20,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:19:20,521 INFO L351 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 13 treesize of output 9 [2023-08-27 14:19:20,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:20,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:19:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:20,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:19:20,637 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:20,637 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-08-27 14:19:20,642 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:20,643 INFO L351 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 37 treesize of output 31 [2023-08-27 14:19:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022495308] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:19:20,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:19:20,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-27 14:19:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854032385] [2023-08-27 14:19:20,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:19:20,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 14:19:20,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:20,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 14:19:20,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=316, Unknown=6, NotChecked=0, Total=380 [2023-08-27 14:19:20,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 358 [2023-08-27 14:19:20,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 168 transitions, 1845 flow. Second operand has 20 states, 20 states have (on average 118.2) internal successors, (2364), 20 states have internal predecessors, (2364), 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) [2023-08-27 14:19:20,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:20,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 358 [2023-08-27 14:19:20,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:27,411 INFO L124 PetriNetUnfolderBase]: 32559/48268 cut-off events. [2023-08-27 14:19:27,411 INFO L125 PetriNetUnfolderBase]: For 339602/340353 co-relation queries the response was YES. [2023-08-27 14:19:27,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217640 conditions, 48268 events. 32559/48268 cut-off events. For 339602/340353 co-relation queries the response was YES. Maximal size of possible extension queue 5220. Compared 389780 event pairs, 11666 based on Foata normal form. 746/35536 useless extension candidates. Maximal degree in co-relation 217598. Up to 36177 conditions per place. [2023-08-27 14:19:27,794 INFO L140 encePairwiseOnDemand]: 346/358 looper letters, 176 selfloop transitions, 40 changer transitions 0/220 dead transitions. [2023-08-27 14:19:27,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 220 transitions, 2716 flow [2023-08-27 14:19:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 14:19:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 14:19:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1368 transitions. [2023-08-27 14:19:27,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34738445911630267 [2023-08-27 14:19:27,796 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1368 transitions. [2023-08-27 14:19:27,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1368 transitions. [2023-08-27 14:19:27,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:27,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1368 transitions. [2023-08-27 14:19:27,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.36363636363636) internal successors, (1368), 11 states have internal predecessors, (1368), 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) [2023-08-27 14:19:27,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:19:27,800 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:19:27,800 INFO L175 Difference]: Start difference. First operand has 119 places, 168 transitions, 1845 flow. Second operand 11 states and 1368 transitions. [2023-08-27 14:19:27,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 220 transitions, 2716 flow [2023-08-27 14:19:28,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 220 transitions, 2713 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 14:19:28,183 INFO L231 Difference]: Finished difference. Result has 128 places, 166 transitions, 1898 flow [2023-08-27 14:19:28,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1898, PETRI_PLACES=128, PETRI_TRANSITIONS=166} [2023-08-27 14:19:28,184 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 72 predicate places. [2023-08-27 14:19:28,184 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 166 transitions, 1898 flow [2023-08-27 14:19:28,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 118.2) internal successors, (2364), 20 states have internal predecessors, (2364), 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) [2023-08-27 14:19:28,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:28,185 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:28,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-27 14:19:28,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-27 14:19:28,390 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:19:28,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash -930713033, now seen corresponding path program 1 times [2023-08-27 14:19:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:28,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34735114] [2023-08-27 14:19:28,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:28,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 14:19:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34735114] [2023-08-27 14:19:28,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34735114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:19:28,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:19:28,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 14:19:28,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765922492] [2023-08-27 14:19:28,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:19:28,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:19:28,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:28,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:19:28,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:19:28,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 358 [2023-08-27 14:19:28,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 166 transitions, 1898 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-27 14:19:28,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:28,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 358 [2023-08-27 14:19:28,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:30,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 68#L57-6true, 92#L47-6true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:30,385 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,385 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:30,385 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,385 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:30,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 10#thread2EXITtrue, 40#L90-1true, Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:30,392 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,392 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,392 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,392 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 671#true, 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 25#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:30,420 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,420 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,420 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:30,420 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:30,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 43#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:30,427 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,428 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:30,428 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:30,428 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), 137#L89-4true, 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 132#thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:30,446 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,446 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:30,446 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,446 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:30,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), 137#L89-4true, 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), 169#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:30,450 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,450 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:30,450 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:30,450 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:19:31,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, 25#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:31,319 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,319 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,319 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,319 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 43#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:31,327 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,327 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,327 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,327 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][133], [189#true, Black: 387#(<= ~M~0 0), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), 3#thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:31,338 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,338 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,338 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,338 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][134], [189#true, Black: 387#(<= ~M~0 0), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 101#thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:31,342 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,342 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,342 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,342 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 132#thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:31,348 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,348 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,348 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,348 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 387#(<= ~M~0 0), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 485#true, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 799#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), 169#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 816#true, Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:19:31,351 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,351 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:19:31,351 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:31,351 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:19:33,959 INFO L124 PetriNetUnfolderBase]: 28614/42197 cut-off events. [2023-08-27 14:19:33,960 INFO L125 PetriNetUnfolderBase]: For 362711/363549 co-relation queries the response was YES. [2023-08-27 14:19:34,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192240 conditions, 42197 events. 28614/42197 cut-off events. For 362711/363549 co-relation queries the response was YES. Maximal size of possible extension queue 4227. Compared 330131 event pairs, 15537 based on Foata normal form. 1840/32220 useless extension candidates. Maximal degree in co-relation 192197. Up to 41972 conditions per place. [2023-08-27 14:19:34,351 INFO L140 encePairwiseOnDemand]: 356/358 looper letters, 148 selfloop transitions, 1 changer transitions 0/160 dead transitions. [2023-08-27 14:19:34,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 160 transitions, 2089 flow [2023-08-27 14:19:34,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:19:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:19:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-27 14:19:34,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43947858472998136 [2023-08-27 14:19:34,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-27 14:19:34,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-27 14:19:34,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:34,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-27 14:19:34,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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) [2023-08-27 14:19:34,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:19:34,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:19:34,356 INFO L175 Difference]: Start difference. First operand has 128 places, 166 transitions, 1898 flow. Second operand 3 states and 472 transitions. [2023-08-27 14:19:34,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 160 transitions, 2089 flow [2023-08-27 14:19:34,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 160 transitions, 2001 flow, removed 6 selfloop flow, removed 11 redundant places. [2023-08-27 14:19:34,738 INFO L231 Difference]: Finished difference. Result has 118 places, 160 transitions, 1705 flow [2023-08-27 14:19:34,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1705, PETRI_PLACES=118, PETRI_TRANSITIONS=160} [2023-08-27 14:19:34,739 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 62 predicate places. [2023-08-27 14:19:34,739 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 160 transitions, 1705 flow [2023-08-27 14:19:34,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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) [2023-08-27 14:19:34,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:34,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:34,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 14:19:34,746 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:19:34,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash -846013240, now seen corresponding path program 1 times [2023-08-27 14:19:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:34,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632972114] [2023-08-27 14:19:34,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632972114] [2023-08-27 14:19:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632972114] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:19:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029486354] [2023-08-27 14:19:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:34,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:34,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:19:34,985 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:19:34,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-27 14:19:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:35,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 14:19:35,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:19:35,159 INFO L351 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 11 treesize of output 7 [2023-08-27 14:19:35,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:35,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:19:35,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:35,208 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:19:35,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:35,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:19:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:35,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:19:35,267 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_755) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) 4294967296)) is different from false [2023-08-27 14:19:35,309 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_753) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_754) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2023-08-27 14:19:35,316 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:35,316 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-08-27 14:19:35,324 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:35,324 INFO L351 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 977 treesize of output 945 [2023-08-27 14:19:35,338 INFO L351 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 50 treesize of output 42 [2023-08-27 14:19:35,343 INFO L351 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 53 treesize of output 51 [2023-08-27 14:19:35,345 INFO L351 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 51 treesize of output 47 [2023-08-27 14:19:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 14:19:35,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029486354] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:19:35,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:19:35,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-27 14:19:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288963730] [2023-08-27 14:19:35,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:19:35,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 14:19:35,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:35,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 14:19:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=215, Unknown=4, NotChecked=62, Total=342 [2023-08-27 14:19:35,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 358 [2023-08-27 14:19:35,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 160 transitions, 1705 flow. Second operand has 19 states, 19 states have (on average 112.36842105263158) internal successors, (2135), 19 states have internal predecessors, (2135), 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) [2023-08-27 14:19:35,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:35,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 358 [2023-08-27 14:19:35,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:40,996 INFO L124 PetriNetUnfolderBase]: 26580/39318 cut-off events. [2023-08-27 14:19:40,996 INFO L125 PetriNetUnfolderBase]: For 258783/259532 co-relation queries the response was YES. [2023-08-27 14:19:41,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173432 conditions, 39318 events. 26580/39318 cut-off events. For 258783/259532 co-relation queries the response was YES. Maximal size of possible extension queue 4005. Compared 304205 event pairs, 10836 based on Foata normal form. 1680/30103 useless extension candidates. Maximal degree in co-relation 173390. Up to 23509 conditions per place. [2023-08-27 14:19:41,365 INFO L140 encePairwiseOnDemand]: 349/358 looper letters, 247 selfloop transitions, 31 changer transitions 0/282 dead transitions. [2023-08-27 14:19:41,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 282 transitions, 3222 flow [2023-08-27 14:19:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 14:19:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 14:19:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-08-27 14:19:41,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35275339185953714 [2023-08-27 14:19:41,367 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-08-27 14:19:41,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-08-27 14:19:41,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:41,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-08-27 14:19:41,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 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) [2023-08-27 14:19:41,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:19:41,369 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:19:41,369 INFO L175 Difference]: Start difference. First operand has 118 places, 160 transitions, 1705 flow. Second operand 7 states and 884 transitions. [2023-08-27 14:19:41,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 282 transitions, 3222 flow [2023-08-27 14:19:41,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 282 transitions, 3221 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 14:19:41,772 INFO L231 Difference]: Finished difference. Result has 125 places, 161 transitions, 1827 flow [2023-08-27 14:19:41,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1704, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1827, PETRI_PLACES=125, PETRI_TRANSITIONS=161} [2023-08-27 14:19:41,773 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 69 predicate places. [2023-08-27 14:19:41,773 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 161 transitions, 1827 flow [2023-08-27 14:19:41,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 112.36842105263158) internal successors, (2135), 19 states have internal predecessors, (2135), 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) [2023-08-27 14:19:41,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:41,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:41,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-27 14:19:41,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:41,978 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:19:41,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash -373281225, now seen corresponding path program 1 times [2023-08-27 14:19:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:41,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343189209] [2023-08-27 14:19:41,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:42,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343189209] [2023-08-27 14:19:42,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343189209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:19:42,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:19:42,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 14:19:42,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751344924] [2023-08-27 14:19:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:19:42,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 14:19:42,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:42,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 14:19:42,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 14:19:42,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 358 [2023-08-27 14:19:42,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 161 transitions, 1827 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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) [2023-08-27 14:19:42,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:42,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 358 [2023-08-27 14:19:42,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:46,726 INFO L124 PetriNetUnfolderBase]: 23052/35905 cut-off events. [2023-08-27 14:19:46,726 INFO L125 PetriNetUnfolderBase]: For 261287/261584 co-relation queries the response was YES. [2023-08-27 14:19:46,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168216 conditions, 35905 events. 23052/35905 cut-off events. For 261287/261584 co-relation queries the response was YES. Maximal size of possible extension queue 2833. Compared 279502 event pairs, 14725 based on Foata normal form. 310/27863 useless extension candidates. Maximal degree in co-relation 168171. Up to 35703 conditions per place. [2023-08-27 14:19:47,086 INFO L140 encePairwiseOnDemand]: 349/358 looper letters, 165 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2023-08-27 14:19:47,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 180 transitions, 2227 flow [2023-08-27 14:19:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 14:19:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 14:19:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-27 14:19:47,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3692737430167598 [2023-08-27 14:19:47,088 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-27 14:19:47,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-27 14:19:47,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:47,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-27 14:19:47,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 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) [2023-08-27 14:19:47,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 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) [2023-08-27 14:19:47,090 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 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) [2023-08-27 14:19:47,090 INFO L175 Difference]: Start difference. First operand has 125 places, 161 transitions, 1827 flow. Second operand 5 states and 661 transitions. [2023-08-27 14:19:47,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 180 transitions, 2227 flow [2023-08-27 14:19:47,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 180 transitions, 2215 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 14:19:47,468 INFO L231 Difference]: Finished difference. Result has 128 places, 163 transitions, 1846 flow [2023-08-27 14:19:47,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1846, PETRI_PLACES=128, PETRI_TRANSITIONS=163} [2023-08-27 14:19:47,468 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 72 predicate places. [2023-08-27 14:19:47,468 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 163 transitions, 1846 flow [2023-08-27 14:19:47,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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) [2023-08-27 14:19:47,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:47,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:47,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-27 14:19:47,469 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:19:47,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:47,469 INFO L85 PathProgramCache]: Analyzing trace with hash -846013241, now seen corresponding path program 1 times [2023-08-27 14:19:47,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:47,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997699512] [2023-08-27 14:19:47,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:47,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:47,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997699512] [2023-08-27 14:19:47,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997699512] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:19:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46217973] [2023-08-27 14:19:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:47,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:19:47,633 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:19:47,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-27 14:19:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:47,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 14:19:47,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:19:47,802 INFO L351 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 11 treesize of output 7 [2023-08-27 14:19:47,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:47,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:19:47,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:47,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:19:47,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:47,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:19:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:47,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:19:48,127 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:48,127 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-08-27 14:19:48,134 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:48,134 INFO L351 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 279 treesize of output 271 [2023-08-27 14:19:48,143 INFO L351 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 61 treesize of output 59 [2023-08-27 14:19:48,163 INFO L351 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 122 treesize of output 114 [2023-08-27 14:19:48,174 INFO L351 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 58 treesize of output 54 [2023-08-27 14:19:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:48,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46217973] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:19:48,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:19:48,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-27 14:19:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83292881] [2023-08-27 14:19:48,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:19:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 14:19:48,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:48,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 14:19:48,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=268, Unknown=9, NotChecked=0, Total=342 [2023-08-27 14:19:48,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 358 [2023-08-27 14:19:48,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 163 transitions, 1846 flow. Second operand has 19 states, 19 states have (on average 112.36842105263158) internal successors, (2135), 19 states have internal predecessors, (2135), 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) [2023-08-27 14:19:48,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:48,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 358 [2023-08-27 14:19:48,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:19:53,358 INFO L124 PetriNetUnfolderBase]: 24021/35653 cut-off events. [2023-08-27 14:19:53,359 INFO L125 PetriNetUnfolderBase]: For 265432/265645 co-relation queries the response was YES. [2023-08-27 14:19:53,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172817 conditions, 35653 events. 24021/35653 cut-off events. For 265432/265645 co-relation queries the response was YES. Maximal size of possible extension queue 3834. Compared 275150 event pairs, 9408 based on Foata normal form. 1144/26817 useless extension candidates. Maximal degree in co-relation 172770. Up to 23509 conditions per place. [2023-08-27 14:19:53,751 INFO L140 encePairwiseOnDemand]: 349/358 looper letters, 238 selfloop transitions, 31 changer transitions 0/274 dead transitions. [2023-08-27 14:19:53,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 274 transitions, 3299 flow [2023-08-27 14:19:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 14:19:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 14:19:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2023-08-27 14:19:53,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34996009577015164 [2023-08-27 14:19:53,752 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2023-08-27 14:19:53,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2023-08-27 14:19:53,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:19:53,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2023-08-27 14:19:53,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 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) [2023-08-27 14:19:53,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:19:53,755 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:19:53,755 INFO L175 Difference]: Start difference. First operand has 128 places, 163 transitions, 1846 flow. Second operand 7 states and 877 transitions. [2023-08-27 14:19:53,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 274 transitions, 3299 flow [2023-08-27 14:19:54,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 274 transitions, 3262 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-27 14:19:54,180 INFO L231 Difference]: Finished difference. Result has 131 places, 162 transitions, 1858 flow [2023-08-27 14:19:54,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1858, PETRI_PLACES=131, PETRI_TRANSITIONS=162} [2023-08-27 14:19:54,180 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 75 predicate places. [2023-08-27 14:19:54,180 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 162 transitions, 1858 flow [2023-08-27 14:19:54,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 112.36842105263158) internal successors, (2135), 19 states have internal predecessors, (2135), 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) [2023-08-27 14:19:54,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:19:54,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:19:54,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-27 14:19:54,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:54,386 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:19:54,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:19:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash -844090295, now seen corresponding path program 1 times [2023-08-27 14:19:54,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:19:54,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648987786] [2023-08-27 14:19:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:19:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:19:54,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648987786] [2023-08-27 14:19:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648987786] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:19:54,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824693258] [2023-08-27 14:19:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:19:54,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:19:54,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:19:54,726 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:19:54,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-27 14:19:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:19:54,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 14:19:54,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:19:54,901 INFO L351 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 11 treesize of output 7 [2023-08-27 14:19:54,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:54,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:19:54,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:54,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:19:54,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:19:54,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:19:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:54,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:19:55,088 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:55,088 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-08-27 14:19:55,093 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:19:55,094 INFO L351 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 141 treesize of output 137 [2023-08-27 14:19:55,098 INFO L351 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 62 treesize of output 60 [2023-08-27 14:19:55,101 INFO L351 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 122 treesize of output 114 [2023-08-27 14:19:55,104 INFO L351 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 114 treesize of output 110 [2023-08-27 14:19:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:19:55,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824693258] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:19:55,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:19:55,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-27 14:19:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448092605] [2023-08-27 14:19:55,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:19:55,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 14:19:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:19:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 14:19:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=271, Unknown=6, NotChecked=0, Total=342 [2023-08-27 14:19:55,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 358 [2023-08-27 14:19:55,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 162 transitions, 1858 flow. Second operand has 19 states, 19 states have (on average 112.36842105263158) internal successors, (2135), 19 states have internal predecessors, (2135), 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) [2023-08-27 14:19:55,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:19:55,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 358 [2023-08-27 14:19:55,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:00,050 INFO L124 PetriNetUnfolderBase]: 22377/33428 cut-off events. [2023-08-27 14:20:00,050 INFO L125 PetriNetUnfolderBase]: For 239770/239889 co-relation queries the response was YES. [2023-08-27 14:20:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161370 conditions, 33428 events. 22377/33428 cut-off events. For 239770/239889 co-relation queries the response was YES. Maximal size of possible extension queue 3681. Compared 260431 event pairs, 7052 based on Foata normal form. 684/24416 useless extension candidates. Maximal degree in co-relation 161324. Up to 16081 conditions per place. [2023-08-27 14:20:00,410 INFO L140 encePairwiseOnDemand]: 346/358 looper letters, 209 selfloop transitions, 32 changer transitions 0/250 dead transitions. [2023-08-27 14:20:00,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 250 transitions, 3238 flow [2023-08-27 14:20:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 14:20:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 14:20:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-08-27 14:20:00,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3487629688747007 [2023-08-27 14:20:00,411 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-08-27 14:20:00,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-08-27 14:20:00,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:00,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-08-27 14:20:00,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 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) [2023-08-27 14:20:00,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:20:00,414 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:20:00,414 INFO L175 Difference]: Start difference. First operand has 131 places, 162 transitions, 1858 flow. Second operand 7 states and 874 transitions. [2023-08-27 14:20:00,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 250 transitions, 3238 flow [2023-08-27 14:20:00,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 250 transitions, 3154 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-27 14:20:00,742 INFO L231 Difference]: Finished difference. Result has 134 places, 167 transitions, 1980 flow [2023-08-27 14:20:00,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1980, PETRI_PLACES=134, PETRI_TRANSITIONS=167} [2023-08-27 14:20:00,743 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 78 predicate places. [2023-08-27 14:20:00,743 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 167 transitions, 1980 flow [2023-08-27 14:20:00,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 112.36842105263158) internal successors, (2135), 19 states have internal predecessors, (2135), 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) [2023-08-27 14:20:00,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:00,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:00,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-27 14:20:00,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-27 14:20:00,948 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:00,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash -844090294, now seen corresponding path program 1 times [2023-08-27 14:20:00,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:00,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118508913] [2023-08-27 14:20:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118508913] [2023-08-27 14:20:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118508913] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398951151] [2023-08-27 14:20:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:01,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:01,113 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:01,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-27 14:20:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:01,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 14:20:01,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:01,288 INFO L351 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 11 treesize of output 7 [2023-08-27 14:20:01,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:01,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:20:01,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:01,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:20:01,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:01,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:20:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:01,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:20:01,391 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_922) c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))) 4294967296)) is different from false [2023-08-27 14:20:01,451 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:01,451 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-08-27 14:20:01,457 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:01,457 INFO L351 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 489 treesize of output 473 [2023-08-27 14:20:01,462 INFO L351 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 53 treesize of output 51 [2023-08-27 14:20:01,465 INFO L351 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 106 treesize of output 98 [2023-08-27 14:20:01,469 INFO L351 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 50 treesize of output 46 [2023-08-27 14:20:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398951151] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:20:01,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:20:01,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-27 14:20:01,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660166138] [2023-08-27 14:20:01,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:20:01,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 14:20:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 14:20:01,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=242, Unknown=5, NotChecked=32, Total=342 [2023-08-27 14:20:01,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 358 [2023-08-27 14:20:01,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 167 transitions, 1980 flow. Second operand has 19 states, 19 states have (on average 112.36842105263158) internal successors, (2135), 19 states have internal predecessors, (2135), 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) [2023-08-27 14:20:01,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:01,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 358 [2023-08-27 14:20:01,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:06,158 INFO L124 PetriNetUnfolderBase]: 21123/31605 cut-off events. [2023-08-27 14:20:06,159 INFO L125 PetriNetUnfolderBase]: For 231977/232096 co-relation queries the response was YES. [2023-08-27 14:20:06,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159709 conditions, 31605 events. 21123/31605 cut-off events. For 231977/232096 co-relation queries the response was YES. Maximal size of possible extension queue 3550. Compared 245182 event pairs, 5891 based on Foata normal form. 684/22961 useless extension candidates. Maximal degree in co-relation 159662. Up to 16081 conditions per place. [2023-08-27 14:20:06,449 INFO L140 encePairwiseOnDemand]: 346/358 looper letters, 208 selfloop transitions, 32 changer transitions 0/249 dead transitions. [2023-08-27 14:20:06,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 249 transitions, 3256 flow [2023-08-27 14:20:06,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 14:20:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 14:20:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2023-08-27 14:20:06,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34836392657621706 [2023-08-27 14:20:06,451 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2023-08-27 14:20:06,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2023-08-27 14:20:06,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:06,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2023-08-27 14:20:06,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 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) [2023-08-27 14:20:06,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:20:06,588 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:20:06,589 INFO L175 Difference]: Start difference. First operand has 134 places, 167 transitions, 1980 flow. Second operand 7 states and 873 transitions. [2023-08-27 14:20:06,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 249 transitions, 3256 flow [2023-08-27 14:20:06,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 249 transitions, 3228 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-27 14:20:06,954 INFO L231 Difference]: Finished difference. Result has 135 places, 166 transitions, 2006 flow [2023-08-27 14:20:06,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2006, PETRI_PLACES=135, PETRI_TRANSITIONS=166} [2023-08-27 14:20:06,954 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 79 predicate places. [2023-08-27 14:20:06,955 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 166 transitions, 2006 flow [2023-08-27 14:20:06,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 112.36842105263158) internal successors, (2135), 19 states have internal predecessors, (2135), 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) [2023-08-27 14:20:06,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:06,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:06,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-27 14:20:07,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-27 14:20:07,160 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:07,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:07,160 INFO L85 PathProgramCache]: Analyzing trace with hash -844090385, now seen corresponding path program 1 times [2023-08-27 14:20:07,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:07,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884617956] [2023-08-27 14:20:07,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:07,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:20:07,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:07,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884617956] [2023-08-27 14:20:07,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884617956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:20:07,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:20:07,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 14:20:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086113864] [2023-08-27 14:20:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:20:07,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:20:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:20:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:20:07,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 358 [2023-08-27 14:20:07,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 166 transitions, 2006 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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) [2023-08-27 14:20:07,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:07,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 358 [2023-08-27 14:20:07,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:08,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 10#thread2EXITtrue, Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,105 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,105 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,105 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,105 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 68#L57-6true, 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,112 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,112 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,112 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,112 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 43#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 737#true, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,137 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,137 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,137 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,137 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 132#thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,139 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,139 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,139 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,140 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), 169#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,142 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,143 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,143 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,143 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 671#true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 1214#(<= 0 (+ ~res2~0 2147483648)), 25#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,149 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,149 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,149 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:08,149 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 43#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,702 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,702 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,702 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,702 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), 132#thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,705 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,705 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,705 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,705 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), 169#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,708 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,708 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,708 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,708 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][126], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 101#thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,710 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,710 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,710 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,710 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][118], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 1131#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 25#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:08,714 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,714 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:08,714 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:08,714 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:10,455 INFO L124 PetriNetUnfolderBase]: 16280/23677 cut-off events. [2023-08-27 14:20:10,455 INFO L125 PetriNetUnfolderBase]: For 206567/209080 co-relation queries the response was YES. [2023-08-27 14:20:10,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125274 conditions, 23677 events. 16280/23677 cut-off events. For 206567/209080 co-relation queries the response was YES. Maximal size of possible extension queue 2602. Compared 169711 event pairs, 7285 based on Foata normal form. 2492/19929 useless extension candidates. Maximal degree in co-relation 125228. Up to 23491 conditions per place. [2023-08-27 14:20:10,621 INFO L140 encePairwiseOnDemand]: 355/358 looper letters, 139 selfloop transitions, 1 changer transitions 0/152 dead transitions. [2023-08-27 14:20:10,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 152 transitions, 2115 flow [2023-08-27 14:20:10,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:20:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:20:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-08-27 14:20:10,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43854748603351956 [2023-08-27 14:20:10,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-08-27 14:20:10,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-08-27 14:20:10,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:10,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-08-27 14:20:10,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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) [2023-08-27 14:20:10,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:20:10,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:20:10,624 INFO L175 Difference]: Start difference. First operand has 135 places, 166 transitions, 2006 flow. Second operand 3 states and 471 transitions. [2023-08-27 14:20:10,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 152 transitions, 2115 flow [2023-08-27 14:20:10,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 152 transitions, 2061 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-27 14:20:10,886 INFO L231 Difference]: Finished difference. Result has 130 places, 152 transitions, 1783 flow [2023-08-27 14:20:10,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1783, PETRI_PLACES=130, PETRI_TRANSITIONS=152} [2023-08-27 14:20:10,886 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 74 predicate places. [2023-08-27 14:20:10,886 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 152 transitions, 1783 flow [2023-08-27 14:20:10,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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) [2023-08-27 14:20:10,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:10,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:10,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-27 14:20:10,887 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:10,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash -844090284, now seen corresponding path program 1 times [2023-08-27 14:20:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963871516] [2023-08-27 14:20:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:20:10,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963871516] [2023-08-27 14:20:10,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963871516] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796670498] [2023-08-27 14:20:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:10,922 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:10,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-27 14:20:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:11,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 14:20:11,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:20:11,085 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 14:20:11,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796670498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:20:11,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 14:20:11,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-27 14:20:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071246096] [2023-08-27 14:20:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:20:11,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 14:20:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 14:20:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 14:20:11,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 358 [2023-08-27 14:20:11,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 152 transitions, 1783 flow. Second operand has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 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) [2023-08-27 14:20:11,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:11,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 358 [2023-08-27 14:20:11,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:11,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][161], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 671#true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 605#true, 68#L57-6true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:11,749 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-27 14:20:11,749 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:20:11,749 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:11,749 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-27 14:20:12,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][161], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 68#L57-6true, 605#true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:12,046 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,046 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,046 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,046 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][161], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 605#true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 43#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:12,058 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,058 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,058 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,058 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][161], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), 169#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:12,061 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,061 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,061 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,061 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][161], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 671#true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1214#(<= 0 (+ ~res2~0 2147483648)), 25#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:12,063 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,064 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,064 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,064 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][189], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 101#thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:12,066 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,066 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,066 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:12,066 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][161], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 605#true, Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 43#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:12,423 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:12,423 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:12,423 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,423 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][161], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), 169#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:12,425 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:12,425 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,425 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:12,425 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][161], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, 25#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:12,428 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:12,428 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,428 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:12,428 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][189], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 101#thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:12,430 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:12,430 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:12,430 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:12,430 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:13,767 INFO L124 PetriNetUnfolderBase]: 14289/20931 cut-off events. [2023-08-27 14:20:13,767 INFO L125 PetriNetUnfolderBase]: For 150949/151416 co-relation queries the response was YES. [2023-08-27 14:20:13,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101266 conditions, 20931 events. 14289/20931 cut-off events. For 150949/151416 co-relation queries the response was YES. Maximal size of possible extension queue 2107. Compared 146444 event pairs, 2698 based on Foata normal form. 461/16583 useless extension candidates. Maximal degree in co-relation 101221. Up to 13377 conditions per place. [2023-08-27 14:20:13,911 INFO L140 encePairwiseOnDemand]: 354/358 looper letters, 207 selfloop transitions, 11 changer transitions 0/227 dead transitions. [2023-08-27 14:20:13,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 227 transitions, 3024 flow [2023-08-27 14:20:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 14:20:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 14:20:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2023-08-27 14:20:13,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4441340782122905 [2023-08-27 14:20:13,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2023-08-27 14:20:13,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2023-08-27 14:20:13,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:13,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2023-08-27 14:20:13,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 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) [2023-08-27 14:20:13,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 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) [2023-08-27 14:20:13,914 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 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) [2023-08-27 14:20:13,914 INFO L175 Difference]: Start difference. First operand has 130 places, 152 transitions, 1783 flow. Second operand 4 states and 636 transitions. [2023-08-27 14:20:13,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 227 transitions, 3024 flow [2023-08-27 14:20:14,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 227 transitions, 3023 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 14:20:14,084 INFO L231 Difference]: Finished difference. Result has 131 places, 149 transitions, 1756 flow [2023-08-27 14:20:14,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1756, PETRI_PLACES=131, PETRI_TRANSITIONS=149} [2023-08-27 14:20:14,085 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 75 predicate places. [2023-08-27 14:20:14,085 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 149 transitions, 1756 flow [2023-08-27 14:20:14,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 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) [2023-08-27 14:20:14,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:14,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:14,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-08-27 14:20:14,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-27 14:20:14,290 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:14,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash -844090384, now seen corresponding path program 1 times [2023-08-27 14:20:14,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:14,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520165953] [2023-08-27 14:20:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:20:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520165953] [2023-08-27 14:20:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520165953] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:20:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:20:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 14:20:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542950191] [2023-08-27 14:20:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:20:14,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 14:20:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 14:20:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 14:20:14,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 358 [2023-08-27 14:20:14,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 149 transitions, 1756 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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) [2023-08-27 14:20:14,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:14,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 358 [2023-08-27 14:20:14,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:15,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][107], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 1248#(<= ~res2~0 2147483647), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 68#L57-6true, 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:15,056 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,056 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:15,056 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,056 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:15,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][107], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 1248#(<= ~res2~0 2147483647), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1216#true, 10#thread2EXITtrue, 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 814#(<= ~res1~0 2147483647), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:15,060 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,060 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,060 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,060 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][107], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 1248#(<= ~res2~0 2147483647), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 43#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:15,080 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,080 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:15,080 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:15,080 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][107], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), 137#L89-4true, 1248#(<= ~res2~0 2147483647), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), 169#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:15,082 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,082 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:15,082 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:15,082 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][107], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 137#L89-4true, 671#true, 1248#(<= ~res2~0 2147483647), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1214#(<= 0 (+ ~res2~0 2147483648)), 25#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:15,084 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,084 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:15,084 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-27 14:20:15,084 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][107], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 1248#(<= ~res2~0 2147483647), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 1205#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 265#true, 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 605#true, Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 43#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:15,324 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:15,324 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,324 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:15,324 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][107], [189#true, Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), 1248#(<= ~res2~0 2147483647), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 737#true, Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 1133#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), Black: 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), Black: 369#(<= ~res2~0 0), 705#(< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 9223372039002259456)), 169#thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:15,326 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:15,326 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,326 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,326 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:15,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L67-6-->thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= |v_thread3Thread1of1ForFork2_plus_#res#1_35| v_~res2~0_149) (< 2147483646 |v_thread3Thread1of1ForFork2_#t~post7#1_35|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35| 2147483648)) (= |v_thread3Thread1of1ForFork2_#t~post7#1_35| |v_thread3Thread1of1ForFork2_~i~2#1_65|) (let ((.cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|)) (.cse0 (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_35| v_~res2~0_150)) (.cse2 (= |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_#in~a#1_35|)) (.cse3 (= (select (select |v_#memory_int_221| v_~A~0.base_174) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_65| 4) v_~A~0.offset_174)) |v_thread3_#t~mem8#1_58|)) (.cse5 (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_35| |v_thread3_#t~mem8#1_58|)) (.cse6 (= |v_thread3Thread1of1ForFork2_plus_~b#1_35| |v_thread3Thread1of1ForFork2_plus_#in~b#1_35|)) (.cse1 (< 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_121| (ite |v_thread3_plus_#t~short25#1_344| 1 0)) (= |v_thread3_assume_abort_if_not_~cond#1_134| |v_thread3_assume_abort_if_not_#in~cond#1_121|) .cse0 (= (ite |v_thread3_plus_#t~short26#1_179| 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|) .cse1 .cse2 (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27| 0)) .cse3 (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 4294967295) .cse4 .cse5 .cse6 (not |v_thread3_plus_#t~short26#1_180|) |v_thread3_plus_#t~short25#1_344|) (and .cse4 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27| (ite |v_thread3_plus_#t~short26#1_178| 1 0)) (let ((.cse7 (= |v_thread3_assume_abort_if_not_~cond#1_133| |v_thread3_assume_abort_if_not_#in~cond#1_122|)) (.cse8 (or (and .cse1 (not |v_thread3_plus_#t~short26#1_178|)) (and |v_thread3_plus_#t~short26#1_178| (<= |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0))))) (or (and (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3_plus_#t~short26#1_178| .cse0 (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_343| 1 0)) .cse2 .cse3 .cse7 .cse8 .cse5 .cse6 |v_thread3_plus_#t~short25#1_343|) (and .cse0 (< |v_thread3Thread1of1ForFork2_plus_~b#1_35| 0) .cse2 .cse3 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork2_plus_~b#1_35|)) (= |v_thread3_assume_abort_if_not_#in~cond#1_122| (ite |v_thread3_plus_#t~short25#1_345| 1 0)) (not (= |v_thread3_assume_abort_if_not_~cond#1_133| 0)) .cse7 .cse8 .cse5 .cse6 (not |v_thread3_plus_#t~short25#1_342|))))))) (< |v_thread3Thread1of1ForFork2_~i~2#1_65| v_~N~0_65) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_35| 2147483647) (= (+ |v_thread3Thread1of1ForFork2_plus_~a#1_35| |v_thread3Thread1of1ForFork2_plus_~b#1_35|) |v_thread3Thread1of1ForFork2_plus_#res#1_35|)) InVars {~A~0.base=v_~A~0.base_174, ~A~0.offset=v_~A~0.offset_174, #memory_int=|v_#memory_int_221|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~res2~0=v_~res2~0_150} OutVars{~A~0.base=v_~A~0.base_174, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_27|, thread3Thread1of1ForFork2_plus_#t~short25#1=|v_thread3Thread1of1ForFork2_plus_#t~short25#1_35|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_35|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_27|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_35|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_plus_#t~short26#1=|v_thread3Thread1of1ForFork2_plus_#t~short26#1_35|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_65|, ~A~0.offset=v_~A~0.offset_174, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_35|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_35|, #memory_int=|v_#memory_int_221|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_35|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_11|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_35|, ~res2~0=v_~res2~0_149, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_35|} AuxVars[|v_thread3_plus_#t~short26#1_180|, |v_thread3_plus_#t~short25#1_345|, |v_thread3_plus_#t~short25#1_344|, |v_thread3_plus_#t~short25#1_343|, |v_thread3_plus_#t~short25#1_342|, |v_thread3_#t~mem8#1_58|, |v_thread3_assume_abort_if_not_#in~cond#1_122|, |v_thread3_assume_abort_if_not_#in~cond#1_121|, |v_thread3_assume_abort_if_not_~cond#1_133|, |v_thread3_plus_#t~short26#1_179|, |v_thread3_assume_abort_if_not_~cond#1_134|, |v_thread3_plus_#t~short26#1_178|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_#t~short25#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_#t~short26#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1][107], [189#true, 639#(< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296), Black: 388#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), 671#true, 1248#(<= ~res2~0 2147483647), 970#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 897#(<= 0 (+ ~res1~0 2147483648)), 265#true, 1210#(and (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 4294967296) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 317#true, 546#true, Black: 980#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), 421#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 983#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0)), Black: 663#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 665#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 92#L47-6true, 120#thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 537#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 475#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 1)), Black: 540#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 478#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~N~0 1) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 422#(<= |thread1Thread1of1ForFork0_~i~0#1| 1), 485#true, Black: 434#(<= ~N~0 1), Black: 801#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 231#(<= ~N~0 0), Black: 803#(and (= ~A~0.offset 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 4) 2147483648)) (<= 0 (+ (select (select |#memory_int| ~A~0.base) 4) 2147483648)) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 232#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 737#true, 246#(<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483647), Black: 343#(< 0 (+ 9223372039002259456 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), 40#L90-1true, 1214#(<= 0 (+ ~res2~0 2147483648)), 25#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 369#(<= ~res2~0 0), Black: 375#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 308#(and (= ~A~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483647) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), Black: 291#(< (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)) 4294967296), 1129#(and (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0) 2147483648))), 814#(<= ~res1~0 2147483647), 1219#(<= 1 |thread2Thread1of1ForFork1_~i~1#1|), Black: 380#(<= 0 ~res2~0)]) [2023-08-27 14:20:15,328 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-27 14:20:15,328 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-27 14:20:15,328 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:15,328 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-27 14:20:16,184 INFO L124 PetriNetUnfolderBase]: 8983/13128 cut-off events. [2023-08-27 14:20:16,184 INFO L125 PetriNetUnfolderBase]: For 114628/114924 co-relation queries the response was YES. [2023-08-27 14:20:16,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63969 conditions, 13128 events. 8983/13128 cut-off events. For 114628/114924 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 87733 event pairs, 3907 based on Foata normal form. 894/10979 useless extension candidates. Maximal degree in co-relation 63924. Up to 12975 conditions per place. [2023-08-27 14:20:16,256 INFO L140 encePairwiseOnDemand]: 355/358 looper letters, 123 selfloop transitions, 1 changer transitions 0/136 dead transitions. [2023-08-27 14:20:16,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 136 transitions, 1852 flow [2023-08-27 14:20:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 14:20:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 14:20:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-08-27 14:20:16,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43575418994413406 [2023-08-27 14:20:16,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-08-27 14:20:16,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-08-27 14:20:16,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:16,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-08-27 14:20:16,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) [2023-08-27 14:20:16,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:20:16,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 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) [2023-08-27 14:20:16,259 INFO L175 Difference]: Start difference. First operand has 131 places, 149 transitions, 1756 flow. Second operand 3 states and 468 transitions. [2023-08-27 14:20:16,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 136 transitions, 1852 flow [2023-08-27 14:20:16,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 1799 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-27 14:20:16,342 INFO L231 Difference]: Finished difference. Result has 126 places, 136 transitions, 1553 flow [2023-08-27 14:20:16,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1553, PETRI_PLACES=126, PETRI_TRANSITIONS=136} [2023-08-27 14:20:16,342 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places. [2023-08-27 14:20:16,342 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 136 transitions, 1553 flow [2023-08-27 14:20:16,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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) [2023-08-27 14:20:16,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:16,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:16,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-27 14:20:16,342 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:16,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash -844090387, now seen corresponding path program 1 times [2023-08-27 14:20:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397928655] [2023-08-27 14:20:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:16,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:16,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397928655] [2023-08-27 14:20:16,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397928655] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:16,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639631156] [2023-08-27 14:20:16,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:16,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:16,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:16,415 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:16,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-27 14:20:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:16,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-27 14:20:16,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:16,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:20:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639631156] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:20:16,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:20:16,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-27 14:20:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998394695] [2023-08-27 14:20:16,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:20:16,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 14:20:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:16,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 14:20:16,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-08-27 14:20:16,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 358 [2023-08-27 14:20:16,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 136 transitions, 1553 flow. Second operand has 15 states, 15 states have (on average 119.53333333333333) internal successors, (1793), 15 states have internal predecessors, (1793), 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) [2023-08-27 14:20:16,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:16,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 358 [2023-08-27 14:20:16,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:18,412 INFO L124 PetriNetUnfolderBase]: 8507/12947 cut-off events. [2023-08-27 14:20:18,413 INFO L125 PetriNetUnfolderBase]: For 85063/85115 co-relation queries the response was YES. [2023-08-27 14:20:18,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58560 conditions, 12947 events. 8507/12947 cut-off events. For 85063/85115 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 82663 event pairs, 4261 based on Foata normal form. 422/11451 useless extension candidates. Maximal degree in co-relation 58517. Up to 10888 conditions per place. [2023-08-27 14:20:18,481 INFO L140 encePairwiseOnDemand]: 349/358 looper letters, 182 selfloop transitions, 15 changer transitions 0/204 dead transitions. [2023-08-27 14:20:18,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 204 transitions, 2393 flow [2023-08-27 14:20:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 14:20:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 14:20:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 917 transitions. [2023-08-27 14:20:18,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3659217877094972 [2023-08-27 14:20:18,483 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 917 transitions. [2023-08-27 14:20:18,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 917 transitions. [2023-08-27 14:20:18,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:18,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 917 transitions. [2023-08-27 14:20:18,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 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) [2023-08-27 14:20:18,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:20:18,485 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 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) [2023-08-27 14:20:18,485 INFO L175 Difference]: Start difference. First operand has 126 places, 136 transitions, 1553 flow. Second operand 7 states and 917 transitions. [2023-08-27 14:20:18,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 204 transitions, 2393 flow [2023-08-27 14:20:18,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 204 transitions, 2392 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 14:20:18,583 INFO L231 Difference]: Finished difference. Result has 134 places, 144 transitions, 1705 flow [2023-08-27 14:20:18,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1705, PETRI_PLACES=134, PETRI_TRANSITIONS=144} [2023-08-27 14:20:18,583 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 78 predicate places. [2023-08-27 14:20:18,584 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 144 transitions, 1705 flow [2023-08-27 14:20:18,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 119.53333333333333) internal successors, (1793), 15 states have internal predecessors, (1793), 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) [2023-08-27 14:20:18,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:18,584 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:18,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-08-27 14:20:18,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:18,788 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:18,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1219065368, now seen corresponding path program 1 times [2023-08-27 14:20:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:18,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250854071] [2023-08-27 14:20:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:18,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:18,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250854071] [2023-08-27 14:20:18,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250854071] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:18,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229304225] [2023-08-27 14:20:18,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:18,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:18,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:18,991 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:18,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-27 14:20:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:19,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-27 14:20:19,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:19,209 INFO L351 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 11 treesize of output 7 [2023-08-27 14:20:19,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:19,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:20:19,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:19,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:20:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:19,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:20:19,346 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1090) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2023-08-27 14:20:19,352 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:19,353 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-27 14:20:19,358 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:19,358 INFO L351 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 81 treesize of output 75 [2023-08-27 14:20:19,361 INFO L351 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 62 treesize of output 54 [2023-08-27 14:20:19,364 INFO L351 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 28 treesize of output 24 [2023-08-27 14:20:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 14:20:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229304225] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:20:19,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:20:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-27 14:20:19,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272767769] [2023-08-27 14:20:19,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:20:19,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-27 14:20:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-27 14:20:19,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=4, NotChecked=36, Total=420 [2023-08-27 14:20:19,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 358 [2023-08-27 14:20:19,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 144 transitions, 1705 flow. Second operand has 21 states, 21 states have (on average 115.23809523809524) internal successors, (2420), 21 states have internal predecessors, (2420), 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) [2023-08-27 14:20:19,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:19,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 358 [2023-08-27 14:20:19,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:21,519 INFO L124 PetriNetUnfolderBase]: 8715/12841 cut-off events. [2023-08-27 14:20:21,519 INFO L125 PetriNetUnfolderBase]: For 91920/91980 co-relation queries the response was YES. [2023-08-27 14:20:21,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60859 conditions, 12841 events. 8715/12841 cut-off events. For 91920/91980 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 86774 event pairs, 2681 based on Foata normal form. 66/9922 useless extension candidates. Maximal degree in co-relation 60812. Up to 10592 conditions per place. [2023-08-27 14:20:21,602 INFO L140 encePairwiseOnDemand]: 348/358 looper letters, 137 selfloop transitions, 74 changer transitions 0/218 dead transitions. [2023-08-27 14:20:21,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 218 transitions, 2861 flow [2023-08-27 14:20:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 14:20:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 14:20:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1356 transitions. [2023-08-27 14:20:21,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34433722701879127 [2023-08-27 14:20:21,605 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1356 transitions. [2023-08-27 14:20:21,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1356 transitions. [2023-08-27 14:20:21,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:21,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1356 transitions. [2023-08-27 14:20:21,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 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) [2023-08-27 14:20:21,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:20:21,608 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:20:21,608 INFO L175 Difference]: Start difference. First operand has 134 places, 144 transitions, 1705 flow. Second operand 11 states and 1356 transitions. [2023-08-27 14:20:21,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 218 transitions, 2861 flow [2023-08-27 14:20:21,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 218 transitions, 2851 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 14:20:21,714 INFO L231 Difference]: Finished difference. Result has 144 places, 161 transitions, 2132 flow [2023-08-27 14:20:21,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2132, PETRI_PLACES=144, PETRI_TRANSITIONS=161} [2023-08-27 14:20:21,715 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 88 predicate places. [2023-08-27 14:20:21,715 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 161 transitions, 2132 flow [2023-08-27 14:20:21,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 115.23809523809524) internal successors, (2420), 21 states have internal predecessors, (2420), 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) [2023-08-27 14:20:21,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:21,715 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:21,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-27 14:20:21,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-08-27 14:20:21,922 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:21,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1219065369, now seen corresponding path program 1 times [2023-08-27 14:20:21,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:21,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910362643] [2023-08-27 14:20:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:22,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:22,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910362643] [2023-08-27 14:20:22,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910362643] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:22,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658627935] [2023-08-27 14:20:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:22,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:22,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:22,113 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:22,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-27 14:20:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:22,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-27 14:20:22,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:22,314 INFO L351 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 11 treesize of output 7 [2023-08-27 14:20:22,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:22,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:20:22,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:22,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:20:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:22,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:20:22,434 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2023-08-27 14:20:22,455 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:22,455 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-08-27 14:20:22,460 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:22,461 INFO L351 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 71 treesize of output 65 [2023-08-27 14:20:22,463 INFO L351 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 28 treesize of output 24 [2023-08-27 14:20:22,465 INFO L351 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 50 treesize of output 42 [2023-08-27 14:20:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 14:20:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658627935] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:20:22,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:20:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-27 14:20:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808927632] [2023-08-27 14:20:22,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:20:22,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-27 14:20:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:22,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-27 14:20:22,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=318, Unknown=3, NotChecked=36, Total=420 [2023-08-27 14:20:22,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 358 [2023-08-27 14:20:22,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 161 transitions, 2132 flow. Second operand has 21 states, 21 states have (on average 115.23809523809524) internal successors, (2420), 21 states have internal predecessors, (2420), 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) [2023-08-27 14:20:22,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:22,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 358 [2023-08-27 14:20:22,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:24,523 INFO L124 PetriNetUnfolderBase]: 8450/12391 cut-off events. [2023-08-27 14:20:24,524 INFO L125 PetriNetUnfolderBase]: For 97683/97753 co-relation queries the response was YES. [2023-08-27 14:20:24,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59963 conditions, 12391 events. 8450/12391 cut-off events. For 97683/97753 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 82385 event pairs, 2579 based on Foata normal form. 68/9616 useless extension candidates. Maximal degree in co-relation 59913. Up to 10171 conditions per place. [2023-08-27 14:20:24,604 INFO L140 encePairwiseOnDemand]: 348/358 looper letters, 136 selfloop transitions, 69 changer transitions 0/212 dead transitions. [2023-08-27 14:20:24,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 212 transitions, 2950 flow [2023-08-27 14:20:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 14:20:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 14:20:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1355 transitions. [2023-08-27 14:20:24,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3440832910106653 [2023-08-27 14:20:24,606 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1355 transitions. [2023-08-27 14:20:24,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1355 transitions. [2023-08-27 14:20:24,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:24,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1355 transitions. [2023-08-27 14:20:24,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.18181818181819) internal successors, (1355), 11 states have internal predecessors, (1355), 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) [2023-08-27 14:20:24,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:20:24,609 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:20:24,609 INFO L175 Difference]: Start difference. First operand has 144 places, 161 transitions, 2132 flow. Second operand 11 states and 1355 transitions. [2023-08-27 14:20:24,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 212 transitions, 2950 flow [2023-08-27 14:20:24,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 212 transitions, 2874 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-27 14:20:24,719 INFO L231 Difference]: Finished difference. Result has 149 places, 155 transitions, 2084 flow [2023-08-27 14:20:24,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2084, PETRI_PLACES=149, PETRI_TRANSITIONS=155} [2023-08-27 14:20:24,719 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 93 predicate places. [2023-08-27 14:20:24,719 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 155 transitions, 2084 flow [2023-08-27 14:20:24,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 115.23809523809524) internal successors, (2420), 21 states have internal predecessors, (2420), 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) [2023-08-27 14:20:24,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:24,720 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-27 14:20:24,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-27 14:20:24,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-27 14:20:24,925 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:24,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1212670875, now seen corresponding path program 2 times [2023-08-27 14:20:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:24,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367908999] [2023-08-27 14:20:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:24,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367908999] [2023-08-27 14:20:24,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367908999] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335716249] [2023-08-27 14:20:24,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 14:20:24,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:24,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:24,995 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:24,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-27 14:20:25,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 14:20:25,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 14:20:25,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-27 14:20:25,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:25,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:20:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335716249] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:20:25,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:20:25,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-08-27 14:20:25,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085321399] [2023-08-27 14:20:25,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:20:25,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 14:20:25,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:25,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 14:20:25,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-08-27 14:20:25,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 358 [2023-08-27 14:20:25,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 155 transitions, 2084 flow. Second operand has 19 states, 19 states have (on average 124.21052631578948) internal successors, (2360), 19 states have internal predecessors, (2360), 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) [2023-08-27 14:20:25,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:25,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 358 [2023-08-27 14:20:25,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:27,915 INFO L124 PetriNetUnfolderBase]: 13257/19106 cut-off events. [2023-08-27 14:20:27,915 INFO L125 PetriNetUnfolderBase]: For 154580/155314 co-relation queries the response was YES. [2023-08-27 14:20:27,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91281 conditions, 19106 events. 13257/19106 cut-off events. For 154580/155314 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 129088 event pairs, 4573 based on Foata normal form. 1691/16619 useless extension candidates. Maximal degree in co-relation 91231. Up to 10449 conditions per place. [2023-08-27 14:20:28,062 INFO L140 encePairwiseOnDemand]: 348/358 looper letters, 273 selfloop transitions, 35 changer transitions 0/315 dead transitions. [2023-08-27 14:20:28,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 315 transitions, 4320 flow [2023-08-27 14:20:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 14:20:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 14:20:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1228 transitions. [2023-08-27 14:20:28,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38112973308504033 [2023-08-27 14:20:28,064 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1228 transitions. [2023-08-27 14:20:28,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1228 transitions. [2023-08-27 14:20:28,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:28,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1228 transitions. [2023-08-27 14:20:28,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 136.44444444444446) internal successors, (1228), 9 states have internal predecessors, (1228), 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) [2023-08-27 14:20:28,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 358.0) internal successors, (3580), 10 states have internal predecessors, (3580), 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) [2023-08-27 14:20:28,067 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 358.0) internal successors, (3580), 10 states have internal predecessors, (3580), 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) [2023-08-27 14:20:28,067 INFO L175 Difference]: Start difference. First operand has 149 places, 155 transitions, 2084 flow. Second operand 9 states and 1228 transitions. [2023-08-27 14:20:28,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 315 transitions, 4320 flow [2023-08-27 14:20:28,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 315 transitions, 4157 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-08-27 14:20:28,358 INFO L231 Difference]: Finished difference. Result has 153 places, 171 transitions, 2412 flow [2023-08-27 14:20:28,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=1964, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2412, PETRI_PLACES=153, PETRI_TRANSITIONS=171} [2023-08-27 14:20:28,359 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 97 predicate places. [2023-08-27 14:20:28,359 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 171 transitions, 2412 flow [2023-08-27 14:20:28,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 124.21052631578948) internal successors, (2360), 19 states have internal predecessors, (2360), 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) [2023-08-27 14:20:28,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:28,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:28,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-27 14:20:28,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:28,565 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:28,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash -391099040, now seen corresponding path program 1 times [2023-08-27 14:20:28,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:28,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406672355] [2023-08-27 14:20:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:28,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 14:20:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406672355] [2023-08-27 14:20:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406672355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 14:20:28,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 14:20:28,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 14:20:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827191489] [2023-08-27 14:20:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 14:20:28,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 14:20:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:28,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 14:20:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 14:20:28,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 358 [2023-08-27 14:20:28,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 171 transitions, 2412 flow. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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) [2023-08-27 14:20:28,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:28,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 358 [2023-08-27 14:20:28,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:30,512 INFO L124 PetriNetUnfolderBase]: 10468/15768 cut-off events. [2023-08-27 14:20:30,513 INFO L125 PetriNetUnfolderBase]: For 164412/165977 co-relation queries the response was YES. [2023-08-27 14:20:30,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85267 conditions, 15768 events. 10468/15768 cut-off events. For 164412/165977 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 107530 event pairs, 1739 based on Foata normal form. 1530/15454 useless extension candidates. Maximal degree in co-relation 85213. Up to 10166 conditions per place. [2023-08-27 14:20:30,640 INFO L140 encePairwiseOnDemand]: 354/358 looper letters, 185 selfloop transitions, 5 changer transitions 0/205 dead transitions. [2023-08-27 14:20:30,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 205 transitions, 3217 flow [2023-08-27 14:20:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 14:20:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 14:20:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2023-08-27 14:20:30,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4127094972067039 [2023-08-27 14:20:30,641 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2023-08-27 14:20:30,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2023-08-27 14:20:30,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:30,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2023-08-27 14:20:30,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 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) [2023-08-27 14:20:30,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 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) [2023-08-27 14:20:30,642 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 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) [2023-08-27 14:20:30,642 INFO L175 Difference]: Start difference. First operand has 153 places, 171 transitions, 2412 flow. Second operand 4 states and 591 transitions. [2023-08-27 14:20:30,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 205 transitions, 3217 flow [2023-08-27 14:20:30,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 205 transitions, 3170 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-27 14:20:30,883 INFO L231 Difference]: Finished difference. Result has 150 places, 169 transitions, 2374 flow [2023-08-27 14:20:30,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=2364, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2374, PETRI_PLACES=150, PETRI_TRANSITIONS=169} [2023-08-27 14:20:30,883 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 94 predicate places. [2023-08-27 14:20:30,883 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 169 transitions, 2374 flow [2023-08-27 14:20:30,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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) [2023-08-27 14:20:30,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:30,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:30,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-27 14:20:30,884 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:30,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash -391099128, now seen corresponding path program 1 times [2023-08-27 14:20:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665708423] [2023-08-27 14:20:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:31,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:31,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665708423] [2023-08-27 14:20:31,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665708423] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:31,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334886827] [2023-08-27 14:20:31,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:31,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:31,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:31,258 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:31,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-27 14:20:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:31,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 14:20:31,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:31,440 INFO L351 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 18 treesize of output 16 [2023-08-27 14:20:31,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-27 14:20:31,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:20:31,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:20:31,581 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:20:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:31,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:20:31,822 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:31,822 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-08-27 14:20:31,830 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:31,830 INFO L351 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 1233 treesize of output 1169 [2023-08-27 14:20:31,838 INFO L351 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 65 treesize of output 59 [2023-08-27 14:20:31,844 INFO L351 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 59 treesize of output 47 [2023-08-27 14:20:31,849 INFO L351 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 70 treesize of output 46 [2023-08-27 14:20:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:31,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334886827] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:20:31,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:20:31,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-27 14:20:31,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110044739] [2023-08-27 14:20:31,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:20:31,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 14:20:31,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 14:20:31,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=307, Unknown=4, NotChecked=0, Total=380 [2023-08-27 14:20:31,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 358 [2023-08-27 14:20:31,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 169 transitions, 2374 flow. Second operand has 20 states, 20 states have (on average 98.5) internal successors, (1970), 20 states have internal predecessors, (1970), 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) [2023-08-27 14:20:31,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:31,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 358 [2023-08-27 14:20:31,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:36,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:20:39,055 INFO L124 PetriNetUnfolderBase]: 10267/15628 cut-off events. [2023-08-27 14:20:39,055 INFO L125 PetriNetUnfolderBase]: For 149057/149563 co-relation queries the response was YES. [2023-08-27 14:20:39,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82172 conditions, 15628 events. 10267/15628 cut-off events. For 149057/149563 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 103407 event pairs, 3282 based on Foata normal form. 505/15407 useless extension candidates. Maximal degree in co-relation 82119. Up to 5971 conditions per place. [2023-08-27 14:20:39,167 INFO L140 encePairwiseOnDemand]: 347/358 looper letters, 260 selfloop transitions, 39 changer transitions 0/314 dead transitions. [2023-08-27 14:20:39,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 314 transitions, 4186 flow [2023-08-27 14:20:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-27 14:20:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-27 14:20:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1713 transitions. [2023-08-27 14:20:39,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2990572625698324 [2023-08-27 14:20:39,170 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1713 transitions. [2023-08-27 14:20:39,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1713 transitions. [2023-08-27 14:20:39,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:39,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1713 transitions. [2023-08-27 14:20:39,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 107.0625) internal successors, (1713), 16 states have internal predecessors, (1713), 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) [2023-08-27 14:20:39,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 358.0) internal successors, (6086), 17 states have internal predecessors, (6086), 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) [2023-08-27 14:20:39,174 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 358.0) internal successors, (6086), 17 states have internal predecessors, (6086), 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) [2023-08-27 14:20:39,174 INFO L175 Difference]: Start difference. First operand has 150 places, 169 transitions, 2374 flow. Second operand 16 states and 1713 transitions. [2023-08-27 14:20:39,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 314 transitions, 4186 flow [2023-08-27 14:20:39,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 314 transitions, 4156 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-27 14:20:39,379 INFO L231 Difference]: Finished difference. Result has 167 places, 195 transitions, 2817 flow [2023-08-27 14:20:39,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2817, PETRI_PLACES=167, PETRI_TRANSITIONS=195} [2023-08-27 14:20:39,379 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 111 predicate places. [2023-08-27 14:20:39,379 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 195 transitions, 2817 flow [2023-08-27 14:20:39,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 98.5) internal successors, (1970), 20 states have internal predecessors, (1970), 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) [2023-08-27 14:20:39,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:39,380 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:39,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-27 14:20:39,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:39,585 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:39,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash -861908188, now seen corresponding path program 1 times [2023-08-27 14:20:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927406387] [2023-08-27 14:20:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 14:20:39,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927406387] [2023-08-27 14:20:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927406387] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984977949] [2023-08-27 14:20:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:39,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:39,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:39,614 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:39,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-27 14:20:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:39,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 14:20:39,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 14:20:39,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:20:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 14:20:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984977949] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:20:39,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:20:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-27 14:20:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045029872] [2023-08-27 14:20:39,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:20:39,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 14:20:39,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:39,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 14:20:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 14:20:39,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 358 [2023-08-27 14:20:39,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 195 transitions, 2817 flow. Second operand has 7 states, 7 states have (on average 143.0) internal successors, (1001), 7 states have internal predecessors, (1001), 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) [2023-08-27 14:20:39,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:39,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 358 [2023-08-27 14:20:39,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:44,752 INFO L124 PetriNetUnfolderBase]: 23972/34621 cut-off events. [2023-08-27 14:20:44,752 INFO L125 PetriNetUnfolderBase]: For 357211/360490 co-relation queries the response was YES. [2023-08-27 14:20:44,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194756 conditions, 34621 events. 23972/34621 cut-off events. For 357211/360490 co-relation queries the response was YES. Maximal size of possible extension queue 2534. Compared 251314 event pairs, 5505 based on Foata normal form. 2780/34413 useless extension candidates. Maximal degree in co-relation 194698. Up to 14223 conditions per place. [2023-08-27 14:20:45,064 INFO L140 encePairwiseOnDemand]: 354/358 looper letters, 455 selfloop transitions, 23 changer transitions 0/492 dead transitions. [2023-08-27 14:20:45,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 492 transitions, 8095 flow [2023-08-27 14:20:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 14:20:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 14:20:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 954 transitions. [2023-08-27 14:20:45,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4441340782122905 [2023-08-27 14:20:45,065 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 954 transitions. [2023-08-27 14:20:45,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 954 transitions. [2023-08-27 14:20:45,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:45,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 954 transitions. [2023-08-27 14:20:45,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 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) [2023-08-27 14:20:45,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 358.0) internal successors, (2506), 7 states have internal predecessors, (2506), 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) [2023-08-27 14:20:45,068 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 358.0) internal successors, (2506), 7 states have internal predecessors, (2506), 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) [2023-08-27 14:20:45,068 INFO L175 Difference]: Start difference. First operand has 167 places, 195 transitions, 2817 flow. Second operand 6 states and 954 transitions. [2023-08-27 14:20:45,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 492 transitions, 8095 flow [2023-08-27 14:20:45,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 492 transitions, 8059 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-27 14:20:45,840 INFO L231 Difference]: Finished difference. Result has 169 places, 201 transitions, 2910 flow [2023-08-27 14:20:45,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=2788, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2910, PETRI_PLACES=169, PETRI_TRANSITIONS=201} [2023-08-27 14:20:45,840 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 113 predicate places. [2023-08-27 14:20:45,840 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 201 transitions, 2910 flow [2023-08-27 14:20:45,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 143.0) internal successors, (1001), 7 states have internal predecessors, (1001), 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) [2023-08-27 14:20:45,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:45,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:45,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-27 14:20:46,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-27 14:20:46,044 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:46,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash -391099129, now seen corresponding path program 1 times [2023-08-27 14:20:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:46,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736967901] [2023-08-27 14:20:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:46,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:46,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736967901] [2023-08-27 14:20:46,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736967901] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:46,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774609421] [2023-08-27 14:20:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:46,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:46,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:46,357 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:46,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-27 14:20:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:46,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-27 14:20:46,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:46,571 INFO L351 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 15 treesize of output 11 [2023-08-27 14:20:46,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:46,621 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-27 14:20:46,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:46,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-27 14:20:46,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:46,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-27 14:20:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:47,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:20:47,205 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:47,205 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-08-27 14:20:47,215 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:20:47,215 INFO L351 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 2723 treesize of output 2595 [2023-08-27 14:20:47,225 INFO L351 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 73 treesize of output 67 [2023-08-27 14:20:47,230 INFO L351 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 67 treesize of output 55 [2023-08-27 14:20:47,236 INFO L351 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 78 treesize of output 54 [2023-08-27 14:20:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774609421] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:20:47,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:20:47,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-27 14:20:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581416397] [2023-08-27 14:20:47,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:20:47,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 14:20:47,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:20:47,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 14:20:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=314, Unknown=3, NotChecked=0, Total=380 [2023-08-27 14:20:47,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 358 [2023-08-27 14:20:47,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 201 transitions, 2910 flow. Second operand has 20 states, 20 states have (on average 98.5) internal successors, (1970), 20 states have internal predecessors, (1970), 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) [2023-08-27 14:20:47,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:20:47,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 358 [2023-08-27 14:20:47,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:20:49,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:20:52,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:20:57,659 INFO L124 PetriNetUnfolderBase]: 21460/32522 cut-off events. [2023-08-27 14:20:57,659 INFO L125 PetriNetUnfolderBase]: For 357048/357484 co-relation queries the response was YES. [2023-08-27 14:20:57,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187636 conditions, 32522 events. 21460/32522 cut-off events. For 357048/357484 co-relation queries the response was YES. Maximal size of possible extension queue 1671. Compared 233855 event pairs, 7820 based on Foata normal form. 1147/32041 useless extension candidates. Maximal degree in co-relation 187576. Up to 13351 conditions per place. [2023-08-27 14:20:58,058 INFO L140 encePairwiseOnDemand]: 347/358 looper letters, 287 selfloop transitions, 41 changer transitions 0/343 dead transitions. [2023-08-27 14:20:58,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 343 transitions, 4850 flow [2023-08-27 14:20:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 14:20:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 14:20:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1810 transitions. [2023-08-27 14:20:58,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2974038777522182 [2023-08-27 14:20:58,060 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1810 transitions. [2023-08-27 14:20:58,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1810 transitions. [2023-08-27 14:20:58,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:20:58,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1810 transitions. [2023-08-27 14:20:58,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 106.47058823529412) internal successors, (1810), 17 states have internal predecessors, (1810), 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) [2023-08-27 14:20:58,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 358.0) internal successors, (6444), 18 states have internal predecessors, (6444), 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) [2023-08-27 14:20:58,065 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 358.0) internal successors, (6444), 18 states have internal predecessors, (6444), 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) [2023-08-27 14:20:58,065 INFO L175 Difference]: Start difference. First operand has 169 places, 201 transitions, 2910 flow. Second operand 17 states and 1810 transitions. [2023-08-27 14:20:58,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 343 transitions, 4850 flow [2023-08-27 14:20:59,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 343 transitions, 4729 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-08-27 14:20:59,201 INFO L231 Difference]: Finished difference. Result has 182 places, 201 transitions, 2935 flow [2023-08-27 14:20:59,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=2845, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2935, PETRI_PLACES=182, PETRI_TRANSITIONS=201} [2023-08-27 14:20:59,201 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 126 predicate places. [2023-08-27 14:20:59,201 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 201 transitions, 2935 flow [2023-08-27 14:20:59,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 98.5) internal successors, (1970), 20 states have internal predecessors, (1970), 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) [2023-08-27 14:20:59,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:20:59,201 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:20:59,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-27 14:20:59,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-27 14:20:59,407 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:20:59,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:20:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash -861908291, now seen corresponding path program 1 times [2023-08-27 14:20:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:20:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106335838] [2023-08-27 14:20:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:20:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:20:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106335838] [2023-08-27 14:20:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106335838] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:20:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780759135] [2023-08-27 14:20:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:20:59,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:20:59,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:20:59,667 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:20:59,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-27 14:20:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:20:59,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 14:20:59,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:20:59,885 INFO L351 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 13 treesize of output 9 [2023-08-27 14:20:59,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:59,909 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-27 14:20:59,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:20:59,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-27 14:20:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:20:59,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:21:00,020 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1394) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2023-08-27 14:21:00,027 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-08-27 14:21:00,033 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:00,033 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-27 14:21:00,038 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:00,038 INFO L351 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 81 treesize of output 75 [2023-08-27 14:21:00,041 INFO L351 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 62 treesize of output 54 [2023-08-27 14:21:00,044 INFO L351 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 28 treesize of output 24 [2023-08-27 14:21:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 14:21:00,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780759135] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:21:00,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:21:00,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-27 14:21:00,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555203937] [2023-08-27 14:21:00,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:21:00,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 14:21:00,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:21:00,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 14:21:00,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=355, Unknown=2, NotChecked=78, Total=506 [2023-08-27 14:21:00,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 358 [2023-08-27 14:21:00,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 201 transitions, 2935 flow. Second operand has 23 states, 23 states have (on average 115.30434782608695) internal successors, (2652), 23 states have internal predecessors, (2652), 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) [2023-08-27 14:21:00,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:21:00,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 358 [2023-08-27 14:21:00,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:21:05,335 INFO L124 PetriNetUnfolderBase]: 22175/32299 cut-off events. [2023-08-27 14:21:05,340 INFO L125 PetriNetUnfolderBase]: For 397119/399841 co-relation queries the response was YES. [2023-08-27 14:21:05,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187748 conditions, 32299 events. 22175/32299 cut-off events. For 397119/399841 co-relation queries the response was YES. Maximal size of possible extension queue 2403. Compared 233481 event pairs, 6472 based on Foata normal form. 1700/32958 useless extension candidates. Maximal degree in co-relation 187688. Up to 24876 conditions per place. [2023-08-27 14:21:05,637 INFO L140 encePairwiseOnDemand]: 348/358 looper letters, 193 selfloop transitions, 101 changer transitions 0/308 dead transitions. [2023-08-27 14:21:05,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 308 transitions, 5087 flow [2023-08-27 14:21:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 14:21:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 14:21:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1228 transitions. [2023-08-27 14:21:05,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34301675977653634 [2023-08-27 14:21:05,644 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1228 transitions. [2023-08-27 14:21:05,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1228 transitions. [2023-08-27 14:21:05,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:21:05,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1228 transitions. [2023-08-27 14:21:05,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.8) internal successors, (1228), 10 states have internal predecessors, (1228), 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) [2023-08-27 14:21:05,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 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) [2023-08-27 14:21:05,651 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 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) [2023-08-27 14:21:05,652 INFO L175 Difference]: Start difference. First operand has 182 places, 201 transitions, 2935 flow. Second operand 10 states and 1228 transitions. [2023-08-27 14:21:05,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 308 transitions, 5087 flow [2023-08-27 14:21:06,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 308 transitions, 4986 flow, removed 2 selfloop flow, removed 13 redundant places. [2023-08-27 14:21:06,304 INFO L231 Difference]: Finished difference. Result has 180 places, 228 transitions, 3554 flow [2023-08-27 14:21:06,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=2852, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3554, PETRI_PLACES=180, PETRI_TRANSITIONS=228} [2023-08-27 14:21:06,304 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 124 predicate places. [2023-08-27 14:21:06,304 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 228 transitions, 3554 flow [2023-08-27 14:21:06,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 115.30434782608695) internal successors, (2652), 23 states have internal predecessors, (2652), 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) [2023-08-27 14:21:06,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:21:06,305 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2023-08-27 14:21:06,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-27 14:21:06,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-27 14:21:06,510 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:21:06,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:21:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1194852971, now seen corresponding path program 2 times [2023-08-27 14:21:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:21:06,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23429308] [2023-08-27 14:21:06,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:21:06,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:21:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:21:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:06,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:21:06,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23429308] [2023-08-27 14:21:06,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23429308] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:21:06,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923779954] [2023-08-27 14:21:06,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 14:21:06,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:21:06,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:21:06,733 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:21:06,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-27 14:21:06,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 14:21:06,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 14:21:06,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-27 14:21:06,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:21:06,996 INFO L351 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 11 treesize of output 7 [2023-08-27 14:21:07,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:21:07,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:21:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:07,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:21:07,367 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:07,367 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-08-27 14:21:07,375 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:07,375 INFO L351 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 47 treesize of output 39 [2023-08-27 14:21:07,384 INFO L351 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 15 treesize of output 9 [2023-08-27 14:21:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:07,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923779954] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:21:07,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:21:07,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-27 14:21:07,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558926074] [2023-08-27 14:21:07,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:21:07,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-27 14:21:07,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:21:07,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-27 14:21:07,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2023-08-27 14:21:07,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 358 [2023-08-27 14:21:07,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 228 transitions, 3554 flow. Second operand has 26 states, 26 states have (on average 108.15384615384616) internal successors, (2812), 26 states have internal predecessors, (2812), 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) [2023-08-27 14:21:07,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:21:07,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 358 [2023-08-27 14:21:07,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:21:14,642 INFO L124 PetriNetUnfolderBase]: 24035/34850 cut-off events. [2023-08-27 14:21:14,643 INFO L125 PetriNetUnfolderBase]: For 397626/401415 co-relation queries the response was YES. [2023-08-27 14:21:14,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207221 conditions, 34850 events. 24035/34850 cut-off events. For 397626/401415 co-relation queries the response was YES. Maximal size of possible extension queue 2582. Compared 251485 event pairs, 8533 based on Foata normal form. 2379/36892 useless extension candidates. Maximal degree in co-relation 207160. Up to 16898 conditions per place. [2023-08-27 14:21:15,022 INFO L140 encePairwiseOnDemand]: 347/358 looper letters, 325 selfloop transitions, 158 changer transitions 0/492 dead transitions. [2023-08-27 14:21:15,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 492 transitions, 8075 flow [2023-08-27 14:21:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-27 14:21:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-27 14:21:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3834 transitions. [2023-08-27 14:21:15,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31498521196187973 [2023-08-27 14:21:15,026 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3834 transitions. [2023-08-27 14:21:15,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3834 transitions. [2023-08-27 14:21:15,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:21:15,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3834 transitions. [2023-08-27 14:21:15,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 112.76470588235294) internal successors, (3834), 34 states have internal predecessors, (3834), 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) [2023-08-27 14:21:15,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 358.0) internal successors, (12530), 35 states have internal predecessors, (12530), 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) [2023-08-27 14:21:15,070 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 358.0) internal successors, (12530), 35 states have internal predecessors, (12530), 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) [2023-08-27 14:21:15,070 INFO L175 Difference]: Start difference. First operand has 180 places, 228 transitions, 3554 flow. Second operand 34 states and 3834 transitions. [2023-08-27 14:21:15,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 492 transitions, 8075 flow [2023-08-27 14:21:15,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 492 transitions, 7863 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-08-27 14:21:15,863 INFO L231 Difference]: Finished difference. Result has 223 places, 336 transitions, 5731 flow [2023-08-27 14:21:15,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=3445, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=5731, PETRI_PLACES=223, PETRI_TRANSITIONS=336} [2023-08-27 14:21:15,864 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 167 predicate places. [2023-08-27 14:21:15,864 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 336 transitions, 5731 flow [2023-08-27 14:21:15,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 108.15384615384616) internal successors, (2812), 26 states have internal predecessors, (2812), 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) [2023-08-27 14:21:15,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:21:15,864 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:21:15,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-27 14:21:16,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-27 14:21:16,069 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:21:16,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:21:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -861908290, now seen corresponding path program 2 times [2023-08-27 14:21:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:21:16,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584138307] [2023-08-27 14:21:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:21:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:21:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:21:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:21:16,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584138307] [2023-08-27 14:21:16,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584138307] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:21:16,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377728191] [2023-08-27 14:21:16,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 14:21:16,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:21:16,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:21:16,376 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:21:16,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-27 14:21:16,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 14:21:16,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 14:21:16,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-27 14:21:16,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:21:16,605 INFO L351 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 11 treesize of output 7 [2023-08-27 14:21:16,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:21:16,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:21:16,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:21:16,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:21:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:16,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:21:16,713 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1489) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2023-08-27 14:21:16,718 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1488) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1489) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2023-08-27 14:21:16,723 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:16,723 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-08-27 14:21:16,728 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:16,728 INFO L351 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 71 treesize of output 65 [2023-08-27 14:21:16,731 INFO L351 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 54 treesize of output 46 [2023-08-27 14:21:16,734 INFO L351 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 24 treesize of output 20 [2023-08-27 14:21:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 14:21:16,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377728191] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:21:16,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:21:16,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-27 14:21:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942600562] [2023-08-27 14:21:16,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:21:16,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-27 14:21:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:21:16,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-27 14:21:16,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=288, Unknown=2, NotChecked=70, Total=420 [2023-08-27 14:21:16,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 358 [2023-08-27 14:21:16,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 336 transitions, 5731 flow. Second operand has 21 states, 21 states have (on average 115.33333333333333) internal successors, (2422), 21 states have internal predecessors, (2422), 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) [2023-08-27 14:21:16,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:21:16,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 358 [2023-08-27 14:21:16,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:21:22,592 INFO L124 PetriNetUnfolderBase]: 22907/33344 cut-off events. [2023-08-27 14:21:22,592 INFO L125 PetriNetUnfolderBase]: For 417995/420746 co-relation queries the response was YES. [2023-08-27 14:21:22,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200421 conditions, 33344 events. 22907/33344 cut-off events. For 417995/420746 co-relation queries the response was YES. Maximal size of possible extension queue 2318. Compared 240720 event pairs, 6696 based on Foata normal form. 1664/33739 useless extension candidates. Maximal degree in co-relation 200346. Up to 25240 conditions per place. [2023-08-27 14:21:23,080 INFO L140 encePairwiseOnDemand]: 348/358 looper letters, 298 selfloop transitions, 132 changer transitions 0/447 dead transitions. [2023-08-27 14:21:23,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 447 transitions, 8399 flow [2023-08-27 14:21:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 14:21:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 14:21:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1347 transitions. [2023-08-27 14:21:23,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3420518029456577 [2023-08-27 14:21:23,082 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1347 transitions. [2023-08-27 14:21:23,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1347 transitions. [2023-08-27 14:21:23,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:21:23,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1347 transitions. [2023-08-27 14:21:23,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 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) [2023-08-27 14:21:23,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:21:23,085 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:21:23,085 INFO L175 Difference]: Start difference. First operand has 223 places, 336 transitions, 5731 flow. Second operand 11 states and 1347 transitions. [2023-08-27 14:21:23,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 447 transitions, 8399 flow [2023-08-27 14:21:23,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 447 transitions, 8003 flow, removed 143 selfloop flow, removed 8 redundant places. [2023-08-27 14:21:23,958 INFO L231 Difference]: Finished difference. Result has 225 places, 316 transitions, 5307 flow [2023-08-27 14:21:23,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=5043, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5307, PETRI_PLACES=225, PETRI_TRANSITIONS=316} [2023-08-27 14:21:23,958 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 169 predicate places. [2023-08-27 14:21:23,958 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 316 transitions, 5307 flow [2023-08-27 14:21:23,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 115.33333333333333) internal successors, (2422), 21 states have internal predecessors, (2422), 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) [2023-08-27 14:21:23,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:21:23,959 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-08-27 14:21:23,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-27 14:21:24,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:21:24,163 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:21:24,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:21:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1614259644, now seen corresponding path program 3 times [2023-08-27 14:21:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:21:24,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333919363] [2023-08-27 14:21:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:21:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:21:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:21:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:21:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333919363] [2023-08-27 14:21:24,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333919363] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:21:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206380430] [2023-08-27 14:21:24,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 14:21:24,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:21:24,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:21:24,267 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:21:24,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-27 14:21:24,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 14:21:24,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 14:21:24,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-27 14:21:24,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:21:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:24,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:21:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206380430] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:21:24,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:21:24,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-08-27 14:21:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231525065] [2023-08-27 14:21:24,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:21:24,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 14:21:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:21:24,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 14:21:24,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2023-08-27 14:21:24,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 358 [2023-08-27 14:21:24,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 316 transitions, 5307 flow. Second operand has 24 states, 24 states have (on average 124.16666666666667) internal successors, (2980), 24 states have internal predecessors, (2980), 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) [2023-08-27 14:21:24,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:21:24,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 358 [2023-08-27 14:21:24,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:21:33,317 INFO L124 PetriNetUnfolderBase]: 36118/51914 cut-off events. [2023-08-27 14:21:33,317 INFO L125 PetriNetUnfolderBase]: For 661069/666139 co-relation queries the response was YES. [2023-08-27 14:21:33,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308245 conditions, 51914 events. 36118/51914 cut-off events. For 661069/666139 co-relation queries the response was YES. Maximal size of possible extension queue 3617. Compared 387086 event pairs, 13055 based on Foata normal form. 5049/56443 useless extension candidates. Maximal degree in co-relation 308171. Up to 21598 conditions per place. [2023-08-27 14:21:34,038 INFO L140 encePairwiseOnDemand]: 348/358 looper letters, 491 selfloop transitions, 68 changer transitions 0/568 dead transitions. [2023-08-27 14:21:34,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 568 transitions, 9643 flow [2023-08-27 14:21:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 14:21:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 14:21:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1491 transitions. [2023-08-27 14:21:34,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786185881157948 [2023-08-27 14:21:34,039 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1491 transitions. [2023-08-27 14:21:34,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1491 transitions. [2023-08-27 14:21:34,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:21:34,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1491 transitions. [2023-08-27 14:21:34,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.54545454545453) internal successors, (1491), 11 states have internal predecessors, (1491), 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) [2023-08-27 14:21:34,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:21:34,043 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 358.0) internal successors, (4296), 12 states have internal predecessors, (4296), 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) [2023-08-27 14:21:34,043 INFO L175 Difference]: Start difference. First operand has 225 places, 316 transitions, 5307 flow. Second operand 11 states and 1491 transitions. [2023-08-27 14:21:34,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 568 transitions, 9643 flow [2023-08-27 14:21:36,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 568 transitions, 9218 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-08-27 14:21:36,447 INFO L231 Difference]: Finished difference. Result has 232 places, 320 transitions, 5346 flow [2023-08-27 14:21:36,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=4807, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5346, PETRI_PLACES=232, PETRI_TRANSITIONS=320} [2023-08-27 14:21:36,448 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 176 predicate places. [2023-08-27 14:21:36,448 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 320 transitions, 5346 flow [2023-08-27 14:21:36,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 124.16666666666667) internal successors, (2980), 24 states have internal predecessors, (2980), 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) [2023-08-27 14:21:36,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:21:36,448 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2023-08-27 14:21:36,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-08-27 14:21:36,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:21:36,653 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:21:36,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:21:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1194852972, now seen corresponding path program 4 times [2023-08-27 14:21:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:21:36,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769895805] [2023-08-27 14:21:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:21:36,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:21:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:21:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:21:36,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769895805] [2023-08-27 14:21:36,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769895805] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:21:36,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595991732] [2023-08-27 14:21:36,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 14:21:36,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:21:36,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:21:36,876 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:21:36,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-27 14:21:37,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 14:21:37,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 14:21:37,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-27 14:21:37,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:21:37,142 INFO L351 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 11 treesize of output 7 [2023-08-27 14:21:37,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:21:37,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:21:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:37,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:21:37,274 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2023-08-27 14:21:37,280 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:37,280 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-08-27 14:21:37,285 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:37,285 INFO L351 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 37 treesize of output 31 [2023-08-27 14:21:37,287 INFO L351 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 7 treesize of output 3 [2023-08-27 14:21:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-27 14:21:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595991732] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:21:37,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:21:37,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-08-27 14:21:37,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034787393] [2023-08-27 14:21:37,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:21:37,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 14:21:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:21:37,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 14:21:37,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=440, Unknown=1, NotChecked=42, Total=552 [2023-08-27 14:21:37,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 358 [2023-08-27 14:21:37,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 320 transitions, 5346 flow. Second operand has 24 states, 24 states have (on average 118.16666666666667) internal successors, (2836), 24 states have internal predecessors, (2836), 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) [2023-08-27 14:21:37,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:21:37,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 358 [2023-08-27 14:21:37,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:21:46,193 INFO L124 PetriNetUnfolderBase]: 35505/51284 cut-off events. [2023-08-27 14:21:46,194 INFO L125 PetriNetUnfolderBase]: For 738562/742800 co-relation queries the response was YES. [2023-08-27 14:21:46,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323724 conditions, 51284 events. 35505/51284 cut-off events. For 738562/742800 co-relation queries the response was YES. Maximal size of possible extension queue 3580. Compared 387851 event pairs, 13141 based on Foata normal form. 2334/51673 useless extension candidates. Maximal degree in co-relation 323646. Up to 44148 conditions per place. [2023-08-27 14:21:46,916 INFO L140 encePairwiseOnDemand]: 347/358 looper letters, 263 selfloop transitions, 76 changer transitions 0/348 dead transitions. [2023-08-27 14:21:46,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 348 transitions, 6301 flow [2023-08-27 14:21:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 14:21:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-27 14:21:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1593 transitions. [2023-08-27 14:21:46,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.342286205414697 [2023-08-27 14:21:46,918 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1593 transitions. [2023-08-27 14:21:46,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1593 transitions. [2023-08-27 14:21:46,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:21:46,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1593 transitions. [2023-08-27 14:21:46,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 122.53846153846153) internal successors, (1593), 13 states have internal predecessors, (1593), 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) [2023-08-27 14:21:46,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 358.0) internal successors, (5012), 14 states have internal predecessors, (5012), 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) [2023-08-27 14:21:46,921 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 358.0) internal successors, (5012), 14 states have internal predecessors, (5012), 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) [2023-08-27 14:21:46,921 INFO L175 Difference]: Start difference. First operand has 232 places, 320 transitions, 5346 flow. Second operand 13 states and 1593 transitions. [2023-08-27 14:21:46,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 348 transitions, 6301 flow [2023-08-27 14:21:48,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 348 transitions, 6165 flow, removed 62 selfloop flow, removed 4 redundant places. [2023-08-27 14:21:48,999 INFO L231 Difference]: Finished difference. Result has 240 places, 310 transitions, 5219 flow [2023-08-27 14:21:49,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=5067, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5219, PETRI_PLACES=240, PETRI_TRANSITIONS=310} [2023-08-27 14:21:49,000 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 184 predicate places. [2023-08-27 14:21:49,000 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 310 transitions, 5219 flow [2023-08-27 14:21:49,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 118.16666666666667) internal successors, (2836), 24 states have internal predecessors, (2836), 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) [2023-08-27 14:21:49,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:21:49,000 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:21:49,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-08-27 14:21:49,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-08-27 14:21:49,204 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:21:49,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:21:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash -949967869, now seen corresponding path program 1 times [2023-08-27 14:21:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:21:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657234549] [2023-08-27 14:21:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:21:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:21:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:21:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:21:49,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657234549] [2023-08-27 14:21:49,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657234549] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:21:49,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935298790] [2023-08-27 14:21:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:21:49,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:21:49,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:21:49,451 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:21:49,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-27 14:21:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:21:49,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-27 14:21:49,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:21:49,690 INFO L351 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 13 treesize of output 9 [2023-08-27 14:21:49,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:21:49,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:21:49,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:21:49,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:21:49,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:21:49,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:21:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:49,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:21:49,847 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) 4294967296)) is different from false [2023-08-27 14:21:49,964 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:49,964 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-08-27 14:21:49,970 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:21:49,970 INFO L351 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 277 treesize of output 265 [2023-08-27 14:21:49,973 INFO L351 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 122 treesize of output 106 [2023-08-27 14:21:49,977 INFO L351 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 51 treesize of output 47 [2023-08-27 14:21:49,980 INFO L351 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 54 treesize of output 46 [2023-08-27 14:21:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:21:50,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935298790] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:21:50,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:21:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-27 14:21:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563833585] [2023-08-27 14:21:50,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:21:50,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-27 14:21:50,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:21:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-27 14:21:50,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=508, Unknown=18, NotChecked=46, Total=650 [2023-08-27 14:21:50,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 358 [2023-08-27 14:21:50,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 310 transitions, 5219 flow. Second operand has 26 states, 26 states have (on average 112.26923076923077) internal successors, (2919), 26 states have internal predecessors, (2919), 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) [2023-08-27 14:21:50,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:21:50,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 358 [2023-08-27 14:21:50,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:21:58,711 INFO L124 PetriNetUnfolderBase]: 33265/48194 cut-off events. [2023-08-27 14:21:58,711 INFO L125 PetriNetUnfolderBase]: For 656516/660714 co-relation queries the response was YES. [2023-08-27 14:21:59,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296045 conditions, 48194 events. 33265/48194 cut-off events. For 656516/660714 co-relation queries the response was YES. Maximal size of possible extension queue 3354. Compared 360390 event pairs, 12062 based on Foata normal form. 3281/50626 useless extension candidates. Maximal degree in co-relation 295966. Up to 31363 conditions per place. [2023-08-27 14:21:59,516 INFO L140 encePairwiseOnDemand]: 349/358 looper letters, 379 selfloop transitions, 68 changer transitions 0/456 dead transitions. [2023-08-27 14:21:59,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 456 transitions, 7641 flow [2023-08-27 14:21:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 14:21:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 14:21:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1230 transitions. [2023-08-27 14:21:59,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3435754189944134 [2023-08-27 14:21:59,517 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1230 transitions. [2023-08-27 14:21:59,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1230 transitions. [2023-08-27 14:21:59,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:21:59,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1230 transitions. [2023-08-27 14:21:59,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 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) [2023-08-27 14:21:59,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 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) [2023-08-27 14:21:59,520 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 358.0) internal successors, (3938), 11 states have internal predecessors, (3938), 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) [2023-08-27 14:21:59,520 INFO L175 Difference]: Start difference. First operand has 240 places, 310 transitions, 5219 flow. Second operand 10 states and 1230 transitions. [2023-08-27 14:21:59,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 456 transitions, 7641 flow [2023-08-27 14:22:01,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 456 transitions, 7518 flow, removed 5 selfloop flow, removed 10 redundant places. [2023-08-27 14:22:01,595 INFO L231 Difference]: Finished difference. Result has 240 places, 310 transitions, 5321 flow [2023-08-27 14:22:01,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=5078, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5321, PETRI_PLACES=240, PETRI_TRANSITIONS=310} [2023-08-27 14:22:01,596 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 184 predicate places. [2023-08-27 14:22:01,596 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 310 transitions, 5321 flow [2023-08-27 14:22:01,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 112.26923076923077) internal successors, (2919), 26 states have internal predecessors, (2919), 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) [2023-08-27 14:22:01,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:22:01,596 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 14:22:01,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-08-27 14:22:01,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:22:01,801 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:22:01,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:22:01,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1614438390, now seen corresponding path program 2 times [2023-08-27 14:22:01,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:22:01,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463200429] [2023-08-27 14:22:01,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:22:01,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:22:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:22:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:22:02,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:22:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463200429] [2023-08-27 14:22:02,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463200429] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:22:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602557673] [2023-08-27 14:22:02,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 14:22:02,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:22:02,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:22:02,032 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:22:02,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-08-27 14:22:02,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 14:22:02,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 14:22:02,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-27 14:22:02,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:22:02,328 INFO L351 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 11 treesize of output 7 [2023-08-27 14:22:02,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:22:02,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:22:02,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:22:02,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 14:22:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:22:02,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:22:02,648 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:22:02,648 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-27 14:22:02,654 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:22:02,654 INFO L351 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 79 treesize of output 71 [2023-08-27 14:22:02,657 INFO L351 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 60 treesize of output 48 [2023-08-27 14:22:02,661 INFO L351 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 26 treesize of output 20 [2023-08-27 14:22:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:22:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602557673] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:22:02,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:22:02,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-27 14:22:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567472668] [2023-08-27 14:22:02,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:22:02,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-27 14:22:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:22:02,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-27 14:22:02,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=718, Unknown=2, NotChecked=0, Total=812 [2023-08-27 14:22:02,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 358 [2023-08-27 14:22:02,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 310 transitions, 5321 flow. Second operand has 29 states, 29 states have (on average 105.13793103448276) internal successors, (3049), 29 states have internal predecessors, (3049), 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) [2023-08-27 14:22:02,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:22:02,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 358 [2023-08-27 14:22:02,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:22:07,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 14:22:37,025 INFO L124 PetriNetUnfolderBase]: 41424/59337 cut-off events. [2023-08-27 14:22:37,025 INFO L125 PetriNetUnfolderBase]: For 820244/824821 co-relation queries the response was YES. [2023-08-27 14:22:37,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373804 conditions, 59337 events. 41424/59337 cut-off events. For 820244/824821 co-relation queries the response was YES. Maximal size of possible extension queue 4191. Compared 447836 event pairs, 14343 based on Foata normal form. 2057/60794 useless extension candidates. Maximal degree in co-relation 373723. Up to 27521 conditions per place. [2023-08-27 14:22:37,972 INFO L140 encePairwiseOnDemand]: 341/358 looper letters, 573 selfloop transitions, 398 changer transitions 0/980 dead transitions. [2023-08-27 14:22:37,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 980 transitions, 16045 flow [2023-08-27 14:22:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-27 14:22:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-27 14:22:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 4208 transitions. [2023-08-27 14:22:37,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.317680809300921 [2023-08-27 14:22:37,976 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 4208 transitions. [2023-08-27 14:22:37,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 4208 transitions. [2023-08-27 14:22:37,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:22:37,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 4208 transitions. [2023-08-27 14:22:37,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 113.72972972972973) internal successors, (4208), 37 states have internal predecessors, (4208), 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) [2023-08-27 14:22:37,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 358.0) internal successors, (13604), 38 states have internal predecessors, (13604), 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) [2023-08-27 14:22:37,985 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 358.0) internal successors, (13604), 38 states have internal predecessors, (13604), 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) [2023-08-27 14:22:37,985 INFO L175 Difference]: Start difference. First operand has 240 places, 310 transitions, 5321 flow. Second operand 37 states and 4208 transitions. [2023-08-27 14:22:37,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 980 transitions, 16045 flow [2023-08-27 14:22:42,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 980 transitions, 15953 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-27 14:22:42,030 INFO L231 Difference]: Finished difference. Result has 278 places, 517 transitions, 10197 flow [2023-08-27 14:22:42,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=5089, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10197, PETRI_PLACES=278, PETRI_TRANSITIONS=517} [2023-08-27 14:22:42,033 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 222 predicate places. [2023-08-27 14:22:42,033 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 517 transitions, 10197 flow [2023-08-27 14:22:42,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 105.13793103448276) internal successors, (3049), 29 states have internal predecessors, (3049), 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) [2023-08-27 14:22:42,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:22:42,034 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:22:42,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-08-27 14:22:42,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:22:42,240 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:22:42,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:22:42,240 INFO L85 PathProgramCache]: Analyzing trace with hash 634946459, now seen corresponding path program 1 times [2023-08-27 14:22:42,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:22:42,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829730397] [2023-08-27 14:22:42,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:22:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:22:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:22:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:22:42,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:22:42,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829730397] [2023-08-27 14:22:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829730397] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:22:42,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913246259] [2023-08-27 14:22:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:22:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:22:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:22:42,369 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:22:42,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-08-27 14:22:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:22:42,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-27 14:22:42,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:22:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:22:42,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:22:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:22:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913246259] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:22:42,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:22:42,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2023-08-27 14:22:42,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112666037] [2023-08-27 14:22:42,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:22:42,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 14:22:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:22:42,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 14:22:42,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-08-27 14:22:42,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 358 [2023-08-27 14:22:42,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 517 transitions, 10197 flow. Second operand has 20 states, 20 states have (on average 119.4) internal successors, (2388), 20 states have internal predecessors, (2388), 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) [2023-08-27 14:22:42,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:22:42,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 358 [2023-08-27 14:22:42,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 14:22:52,319 INFO L124 PetriNetUnfolderBase]: 33453/49790 cut-off events. [2023-08-27 14:22:52,320 INFO L125 PetriNetUnfolderBase]: For 731948/732171 co-relation queries the response was YES. [2023-08-27 14:22:52,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321829 conditions, 49790 events. 33453/49790 cut-off events. For 731948/732171 co-relation queries the response was YES. Maximal size of possible extension queue 2287. Compared 356712 event pairs, 17943 based on Foata normal form. 673/50457 useless extension candidates. Maximal degree in co-relation 321740. Up to 44406 conditions per place. [2023-08-27 14:22:53,100 INFO L140 encePairwiseOnDemand]: 350/358 looper letters, 585 selfloop transitions, 38 changer transitions 0/640 dead transitions. [2023-08-27 14:22:53,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 640 transitions, 13253 flow [2023-08-27 14:22:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 14:22:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 14:22:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1170 transitions. [2023-08-27 14:22:53,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36312849162011174 [2023-08-27 14:22:53,103 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1170 transitions. [2023-08-27 14:22:53,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1170 transitions. [2023-08-27 14:22:53,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 14:22:53,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1170 transitions. [2023-08-27 14:22:53,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.0) internal successors, (1170), 9 states have internal predecessors, (1170), 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) [2023-08-27 14:22:53,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 358.0) internal successors, (3580), 10 states have internal predecessors, (3580), 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) [2023-08-27 14:22:53,107 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 358.0) internal successors, (3580), 10 states have internal predecessors, (3580), 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) [2023-08-27 14:22:53,107 INFO L175 Difference]: Start difference. First operand has 278 places, 517 transitions, 10197 flow. Second operand 9 states and 1170 transitions. [2023-08-27 14:22:53,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 640 transitions, 13253 flow [2023-08-27 14:22:56,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 640 transitions, 12348 flow, removed 296 selfloop flow, removed 9 redundant places. [2023-08-27 14:22:56,603 INFO L231 Difference]: Finished difference. Result has 281 places, 497 transitions, 9090 flow [2023-08-27 14:22:56,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=8764, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9090, PETRI_PLACES=281, PETRI_TRANSITIONS=497} [2023-08-27 14:22:56,604 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 225 predicate places. [2023-08-27 14:22:56,604 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 497 transitions, 9090 flow [2023-08-27 14:22:56,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 119.4) internal successors, (2388), 20 states have internal predecessors, (2388), 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) [2023-08-27 14:22:56,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 14:22:56,604 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 14:22:56,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-08-27 14:22:56,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-08-27 14:22:56,804 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2023-08-27 14:22:56,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 14:22:56,805 INFO L85 PathProgramCache]: Analyzing trace with hash -949967870, now seen corresponding path program 1 times [2023-08-27 14:22:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 14:22:56,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818502946] [2023-08-27 14:22:56,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:22:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 14:22:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:22:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:22:57,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 14:22:57,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818502946] [2023-08-27 14:22:57,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818502946] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 14:22:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004205996] [2023-08-27 14:22:57,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 14:22:57,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 14:22:57,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 14:22:57,111 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 14:22:57,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-08-27 14:22:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 14:22:57,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-27 14:22:57,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 14:22:57,368 INFO L351 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 11 treesize of output 7 [2023-08-27 14:22:57,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:22:57,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:22:57,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:22:57,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:22:57,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 14:22:57,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 14:22:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 14:22:57,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 14:22:57,538 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1782 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) 9223372039002259456))) is different from false [2023-08-27 14:22:57,542 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1782 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2023-08-27 14:22:57,547 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1781) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1782) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2023-08-27 14:22:57,580 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:22:57,580 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-08-27 14:22:57,586 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 14:22:57,586 INFO L351 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 619 treesize of output 595 [2023-08-27 14:22:57,590 INFO L351 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 67 treesize of output 59 [2023-08-27 14:22:57,594 INFO L351 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 59 treesize of output 55 [2023-08-27 14:22:57,626 INFO L351 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 66 treesize of output 50 [2023-08-27 14:22:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 14:22:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004205996] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 14:22:57,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 14:22:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-27 14:22:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973140950] [2023-08-27 14:22:57,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 14:22:57,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-27 14:22:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 14:22:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-27 14:22:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=429, Unknown=9, NotChecked=132, Total=650 [2023-08-27 14:22:57,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 358 [2023-08-27 14:22:57,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 497 transitions, 9090 flow. Second operand has 26 states, 26 states have (on average 112.26923076923077) internal successors, (2919), 26 states have internal predecessors, (2919), 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) [2023-08-27 14:22:57,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 14:22:57,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 358 [2023-08-27 14:22:57,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand