/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 19:51:50,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 19:51:50,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 19:51:50,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 19:51:50,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 19:51:50,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 19:51:50,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 19:51:50,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 19:51:50,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 19:51:50,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 19:51:50,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 19:51:50,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 19:51:50,427 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 19:51:50,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 19:51:50,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 19:51:50,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 19:51:50,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 19:51:50,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 19:51:50,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 19:51:50,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 19:51:50,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 19:51:50,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 19:51:50,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 19:51:50,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 19:51:50,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 19:51:50,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 19:51:50,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 19:51:50,431 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 19:51:50,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 19:51:50,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 19:51:50,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 19:51:50,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 19:51:50,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 19:51:50,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 19:51:50,432 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 19:51:50,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 19:51:50,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 19:51:50,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 19:51:50,433 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 19:51:50,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 19:51:50,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 19:51:50,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 19:51:50,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 19:51:50,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 19:51:50,692 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 19:51:50,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2024-05-30 19:51:51,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 19:51:52,008 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 19:51:52,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2024-05-30 19:51:52,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/89153fd8f/5078426f08f04b3b89d090bbcb396a49/FLAGeab271e95 [2024-05-30 19:51:52,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/89153fd8f/5078426f08f04b3b89d090bbcb396a49 [2024-05-30 19:51:52,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 19:51:52,039 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 19:51:52,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 19:51:52,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 19:51:52,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 19:51:52,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794e1d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52, skipping insertion in model container [2024-05-30 19:51:52,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,076 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 19:51:52,218 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2024-05-30 19:51:52,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 19:51:52,231 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 19:51:52,247 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2024-05-30 19:51:52,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 19:51:52,274 INFO L206 MainTranslator]: Completed translation [2024-05-30 19:51:52,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52 WrapperNode [2024-05-30 19:51:52,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 19:51:52,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 19:51:52,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 19:51:52,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 19:51:52,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,323 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 288 [2024-05-30 19:51:52,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 19:51:52,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 19:51:52,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 19:51:52,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 19:51:52,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 19:51:52,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 19:51:52,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 19:51:52,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 19:51:52,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (1/1) ... [2024-05-30 19:51:52,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 19:51:52,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 19:51:52,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 19:51:52,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 19:51:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 19:51:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 19:51:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 19:51:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 19:51:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 19:51:52,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 19:51:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 19:51:52,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 19:51:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-30 19:51:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-30 19:51:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 19:51:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 19:51:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 19:51:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 19:51:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 19:51:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 19:51:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 19:51:52,488 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 19:51:52,589 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 19:51:52,591 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 19:51:52,956 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 19:51:53,164 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 19:51:53,164 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2024-05-30 19:51:53,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 07:51:53 BoogieIcfgContainer [2024-05-30 19:51:53,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 19:51:53,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 19:51:53,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 19:51:53,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 19:51:53,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 07:51:52" (1/3) ... [2024-05-30 19:51:53,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3638e760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 07:51:53, skipping insertion in model container [2024-05-30 19:51:53,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 07:51:52" (2/3) ... [2024-05-30 19:51:53,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3638e760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 07:51:53, skipping insertion in model container [2024-05-30 19:51:53,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 07:51:53" (3/3) ... [2024-05-30 19:51:53,172 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2024-05-30 19:51:53,179 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 19:51:53,185 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 19:51:53,185 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 19:51:53,185 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 19:51:53,230 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-30 19:51:53,261 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 19:51:53,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 19:51:53,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 19:51:53,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 19:51:53,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 19:51:53,301 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 19:51:53,306 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 19:51:53,310 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c13d425, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 19:51:53,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 19:51:53,533 INFO L78 Accepts]: Start accepts. Automaton has currently 867 states, but on-demand construction may add more states Word has length 160 [2024-05-30 19:51:53,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 19:51:53,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 19:51:53,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 19:51:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash -949297926, now seen corresponding path program 1 times [2024-05-30 19:51:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 19:51:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140949044] [2024-05-30 19:51:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 19:51:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 19:51:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 19:51:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-30 19:51:53,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 19:51:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140949044] [2024-05-30 19:51:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140949044] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 19:51:53,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 19:51:53,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 19:51:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999508245] [2024-05-30 19:51:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 19:51:53,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 19:51:53,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 19:51:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 19:51:53,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 19:51:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:53,862 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 19:51:53,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 19:51:53,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:53,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:53,924 INFO L78 Accepts]: Start accepts. Automaton has currently 867 states, but on-demand construction may add more states Word has length 154 [2024-05-30 19:51:53,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 19:51:53,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 19:51:53,926 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 19:51:53,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 19:51:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1496613672, now seen corresponding path program 1 times [2024-05-30 19:51:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 19:51:53,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065581494] [2024-05-30 19:51:53,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 19:51:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 19:51:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 19:51:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 19:51:54,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 19:51:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065581494] [2024-05-30 19:51:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065581494] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 19:51:54,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 19:51:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-30 19:51:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036703024] [2024-05-30 19:51:54,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 19:51:54,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-30 19:51:54,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 19:51:54,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-30 19:51:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-30 19:51:54,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:54,370 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 19:51:54,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 19:51:54,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:54,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:54,569 INFO L78 Accepts]: Start accepts. Automaton has currently 883 states, but on-demand construction may add more states Word has length 170 [2024-05-30 19:51:54,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 19:51:54,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 19:51:54,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 19:51:54,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 19:51:54,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1999135113, now seen corresponding path program 1 times [2024-05-30 19:51:54,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 19:51:54,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789987438] [2024-05-30 19:51:54,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 19:51:54,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 19:51:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 19:51:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 19:51:54,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 19:51:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789987438] [2024-05-30 19:51:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789987438] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 19:51:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298485923] [2024-05-30 19:51:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 19:51:54,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 19:51:54,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 19:51:54,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 19:51:54,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 19:51:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 19:51:55,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 19:51:55,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 19:51:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 19:51:55,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 19:51:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 19:51:55,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298485923] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-30 19:51:55,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-30 19:51:55,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-05-30 19:51:55,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803647500] [2024-05-30 19:51:55,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 19:51:55,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 19:51:55,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 19:51:55,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 19:51:55,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-05-30 19:51:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:55,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 19:51:55,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 19:51:55,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:55,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:55,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:55,554 INFO L78 Accepts]: Start accepts. Automaton has currently 296 states, but on-demand construction may add more states Word has length 176 [2024-05-30 19:51:55,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 19:51:55,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 19:51:55,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 19:51:55,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 19:51:55,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 19:51:55,781 INFO L85 PathProgramCache]: Analyzing trace with hash 559167619, now seen corresponding path program 1 times [2024-05-30 19:51:55,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 19:51:55,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268193034] [2024-05-30 19:51:55,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 19:51:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 19:51:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 19:51:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 19:51:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 19:51:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268193034] [2024-05-30 19:51:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268193034] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 19:51:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703305284] [2024-05-30 19:51:56,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 19:51:56,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 19:51:56,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 19:51:56,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 19:51:56,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 19:51:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 19:51:56,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-30 19:51:56,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 19:51:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 19:51:56,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 19:51:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 19:51:56,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703305284] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 19:51:56,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 19:51:56,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-05-30 19:51:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865727644] [2024-05-30 19:51:56,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 19:51:56,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-30 19:51:56,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 19:51:56,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-30 19:51:56,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2024-05-30 19:51:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:56,654 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 19:51:56,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.84) internal successors, (221), 25 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 19:51:56,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:56,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:56,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:56,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 19:51:56,934 INFO L78 Accepts]: Start accepts. Automaton has currently 314 states, but on-demand construction may add more states Word has length 192 [2024-05-30 19:51:56,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 19:51:56,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-30 19:51:57,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 19:51:57,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 19:51:57,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 19:51:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash -19580044, now seen corresponding path program 2 times [2024-05-30 19:51:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 19:51:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532997195] [2024-05-30 19:51:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 19:51:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 19:51:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 19:51:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-05-30 19:51:57,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 19:51:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532997195] [2024-05-30 19:51:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532997195] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 19:51:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342934735] [2024-05-30 19:51:57,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 19:51:57,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 19:51:57,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 19:51:57,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 19:51:57,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 19:51:57,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 19:51:57,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 19:51:57,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 19:51:57,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 19:51:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-05-30 19:51:57,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 19:51:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-05-30 19:51:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342934735] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 19:51:57,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 19:51:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2024-05-30 19:51:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236683264] [2024-05-30 19:51:57,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 19:51:57,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-05-30 19:51:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 19:51:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-05-30 19:51:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-05-30 19:51:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:57,670 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 19:51:57,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.238095238095237) internal successors, (299), 21 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 19:51:57,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:57,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:57,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:57,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 19:51:57,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 19:51:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 19:51:58,093 INFO L78 Accepts]: Start accepts. Automaton has currently 816 states, but on-demand construction may add more states Word has length 198 [2024-05-30 19:51:58,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 19:51:58,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 19:51:58,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 19:51:58,300 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 19:51:58,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 19:51:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash -275597778, now seen corresponding path program 3 times [2024-05-30 19:51:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 19:51:58,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529270909] [2024-05-30 19:51:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 19:51:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 19:51:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 19:51:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-30 19:51:58,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 19:51:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529270909] [2024-05-30 19:51:58,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529270909] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 19:51:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308392351] [2024-05-30 19:51:58,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 19:51:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 19:51:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 19:51:58,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 19:51:58,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-30 19:51:58,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-30 19:51:58,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 19:51:58,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-30 19:51:58,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 19:51:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-30 19:51:58,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 19:51:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-30 19:51:59,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308392351] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 19:51:59,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 19:51:59,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 29 [2024-05-30 19:51:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088635155] [2024-05-30 19:51:59,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 19:51:59,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-05-30 19:51:59,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 19:51:59,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-05-30 19:51:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2024-05-30 19:51:59,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:59,109 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 19:51:59,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.862068965517242) internal successors, (315), 29 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 19:51:59,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 19:51:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 19:51:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 19:51:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 19:51:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 19:51:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 19:51:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-30 19:51:59,826 INFO L78 Accepts]: Start accepts. Automaton has currently 853 states, but on-demand construction may add more states Word has length 220 [2024-05-30 19:51:59,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 19:51:59,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-30 19:52:00,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-30 19:52:00,033 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 19:52:00,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 19:52:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2034137639, now seen corresponding path program 4 times [2024-05-30 19:52:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 19:52:00,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265967818] [2024-05-30 19:52:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 19:52:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 19:52:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 19:52:00,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 19:52:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 19:52:00,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 19:52:00,300 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 19:52:00,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 19:52:00,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 19:52:00,306 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-05-30 19:52:00,307 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/4) [2024-05-30 19:52:00,310 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 19:52:00,310 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 19:52:00,374 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-30 19:52:00,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-30 19:52:00,390 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-30 19:52:00,392 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-30 19:52:00,392 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-30 19:52:00,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 07:52:00 BasicIcfg [2024-05-30 19:52:00,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 19:52:00,404 INFO L158 Benchmark]: Toolchain (without parser) took 8365.61ms. Allocated memory was 373.3MB in the beginning and 483.4MB in the end (delta: 110.1MB). Free memory was 301.6MB in the beginning and 225.3MB in the end (delta: 76.2MB). Peak memory consumption was 187.5MB. Max. memory is 8.0GB. [2024-05-30 19:52:00,404 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 19:52:00,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.03ms. Allocated memory is still 373.3MB. Free memory was 301.4MB in the beginning and 289.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-30 19:52:00,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.10ms. Allocated memory is still 373.3MB. Free memory was 288.8MB in the beginning and 286.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 19:52:00,405 INFO L158 Benchmark]: Boogie Preprocessor took 34.69ms. Allocated memory is still 373.3MB. Free memory was 286.1MB in the beginning and 284.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 19:52:00,405 INFO L158 Benchmark]: RCFGBuilder took 806.00ms. Allocated memory is still 373.3MB. Free memory was 284.0MB in the beginning and 280.6MB in the end (delta: 3.5MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2024-05-30 19:52:00,405 INFO L158 Benchmark]: TraceAbstraction took 7236.11ms. Allocated memory was 373.3MB in the beginning and 483.4MB in the end (delta: 110.1MB). Free memory was 279.0MB in the beginning and 225.3MB in the end (delta: 53.6MB). Peak memory consumption was 164.3MB. Max. memory is 8.0GB. [2024-05-30 19:52:00,406 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.03ms. Allocated memory is still 373.3MB. Free memory was 301.4MB in the beginning and 289.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.10ms. Allocated memory is still 373.3MB. Free memory was 288.8MB in the beginning and 286.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.69ms. Allocated memory is still 373.3MB. Free memory was 286.1MB in the beginning and 284.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 806.00ms. Allocated memory is still 373.3MB. Free memory was 284.0MB in the beginning and 280.6MB in the end (delta: 3.5MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7236.11ms. Allocated memory was 373.3MB in the beginning and 483.4MB in the end (delta: 110.1MB). Free memory was 279.0MB in the beginning and 225.3MB in the end (delta: 53.6MB). Peak memory consumption was 164.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9162, independent: 8427, independent conditional: 8427, independent unconditional: 0, dependent: 735, dependent conditional: 735, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8540, independent: 8427, independent conditional: 8427, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8540, independent: 8427, independent conditional: 8427, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8839, independent: 8427, independent conditional: 0, independent unconditional: 8427, dependent: 412, dependent conditional: 299, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8839, independent: 8427, independent conditional: 0, independent unconditional: 8427, dependent: 412, dependent conditional: 0, dependent unconditional: 412, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8839, independent: 8427, independent conditional: 0, independent unconditional: 8427, dependent: 412, dependent conditional: 0, dependent unconditional: 412, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 314, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 314, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8839, independent: 8116, independent conditional: 0, independent unconditional: 8116, dependent: 409, dependent conditional: 0, dependent unconditional: 409, unknown: 314, unknown conditional: 0, unknown unconditional: 314] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 311, Positive conditional cache size: 0, Positive unconditional cache size: 311, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 299, Maximal queried relation: 6, Independence queries for same thread: 622 - StatisticsResult: Visitor Statistics States: 890, Transitions: 1132, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 890, Transitions: 1059, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 904, Transitions: 1073, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 230, Transitions: 239, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 246, Transitions: 255, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 796, Transitions: 933, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 818, Transitions: 955, Traversal time: 0.7s - CounterExampleResult [Line: 106]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L40] 0 int* A; VAL [A={0:0}] [L41] 0 int* B; VAL [A={0:0}, B={0:0}] [L42] 0 int res1, res2, M, N; VAL [A={0:0}, B={0:0}, M=0, N=0, res1=0, res2=0] [L87] 0 pthread_t t1, t2, t3; VAL [A={0:0}, B={0:0}, M=0, N=0, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L90] 0 M = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=0, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L91] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L92] CALL, EXPR 0 create_fresh_int_array(N) [L112] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) VAL [A={0:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L112] RET 0 assume_abort_if_not(size >= 0) [L113] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) VAL [A={0:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L113] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L115] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, res1=0, res2=0, size=3] [L116] 0 int i = 0; VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=0, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=1, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=2, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=3, res1=0, res2=0, size=3] [L116] COND FALSE 0 !(i < size) VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={3:0}, i=3, res1=0, res2=0, size=3] [L119] 0 return arr; VAL [A={0:0}, B={0:0}, M=2, N=3, \old(size)=3, \result={3:0}, arr={3:0}, res1=0, res2=0, size=3] [L92] RET, EXPR 0 create_fresh_int_array(N) [L92] 0 A = create_fresh_int_array(N) VAL [A={3:0}, B={0:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L93] CALL, EXPR 0 create_fresh_int_array(N) [L112] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) VAL [A={3:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L112] RET 0 assume_abort_if_not(size >= 0) [L113] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) VAL [A={3:0}, B={0:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L113] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L115] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, res1=0, res2=0, size=3] [L116] 0 int i = 0; VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=0, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=0, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=0, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=1, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=1, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=1, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=2, res1=0, res2=0, size=3] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=2, res1=0, res2=0, size=3] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=2, res1=0, res2=0, size=3] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=3, res1=0, res2=0, size=3] [L116] COND FALSE 0 !(i < size) VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, arr={-7:0}, i=3, res1=0, res2=0, size=3] [L119] 0 return arr; VAL [A={3:0}, B={0:0}, M=2, N=3, \old(size)=3, \result={-7:0}, arr={-7:0}, res1=0, res2=0, size=3] [L93] RET, EXPR 0 create_fresh_int_array(N) [L93] 0 B = create_fresh_int_array(N) VAL [A={3:0}, B={-7:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L95] CALL 0 assume_abort_if_not(M >= 0 && M < N) [L37] COND FALSE 0 !(!cond) VAL [A={3:0}, B={-7:0}, M=2, N=3, \old(cond)=1, cond=1, res1=0, res2=0] [L95] RET 0 assume_abort_if_not(M >= 0 && M < N) [L98] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, B={-7:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L99] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, B={-7:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L100] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [A={3:0}, B={-7:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L101] 0 \read(t1) VAL [A={3:0}, B={-7:0}, M=2, N=3, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L48] 1 int i=0; VAL [A={3:0}, B={-7:0}, M=2, N=3, i=0, res1=0, res2=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=0, res1=9, res2=0, tmp=9] [L48] 1 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=1, res1=9, res2=0, tmp=9] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=1, res1=15, res2=0, tmp=15] [L48] 1 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=2, res1=15, res2=0, tmp=15] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=2, res1=-14, res2=0, tmp=-14] [L48] 1 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=3, res1=-14, res2=0, tmp=-14] [L48] COND FALSE 1 !(i= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(A[i], B[i]) [L63] CALL, EXPR 2 plus(res2, plus(A[i], B[i])) [L123] CALL 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(res2, plus(A[i], B[i])) [L63] 2 int tmp = plus(res2, plus(A[i], B[i])); [L74] 3 int i=M; VAL [A={3:0}, B={-7:0}, M=2, N=3, i=2, res1=-14, res2=0] [L74] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L76] RET, EXPR 3 plus(A[i], B[i]) [L76] CALL, EXPR 3 plus(res2, plus(A[i], B[i])) [L123] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L76] RET, EXPR 3 plus(res2, plus(A[i], B[i])) [L76] 3 int tmp = plus(res2, plus(A[i], B[i])); [L66] 2 res2 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=0, res1=-14, res2=9, tmp=9] [L61] 2 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=1, res1=-14, res2=9, tmp=9] [L61] COND TRUE 2 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(A[i], B[i]) [L63] CALL, EXPR 2 plus(res2, plus(A[i], B[i])) [L123] CALL 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 2 !(!cond) [L123] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 2 !(!cond) [L124] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 2 return a + b; [L63] RET, EXPR 2 plus(res2, plus(A[i], B[i])) [L63] 2 int tmp = plus(res2, plus(A[i], B[i])); [L66] 2 res2 = tmp VAL [A={3:0}, B={-7:0}, M=2, N=3, i=1, res1=-14, res2=-23, tmp=-23] [L61] 2 i++ VAL [A={3:0}, B={-7:0}, M=2, N=3, i=2, res1=-14, res2=-23, tmp=-23] [L61] COND FALSE 2 !(i