/usr/lib/jvm/java-1.11.0-openjdk-amd64/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-57af04c-m [2024-01-26 05:23:59,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 05:23:59,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-01-26 05:23:59,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 05:23:59,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 05:23:59,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 05:23:59,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 05:23:59,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 05:23:59,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 05:23:59,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 05:23:59,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 05:23:59,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 05:23:59,867 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 05:23:59,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 05:23:59,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 05:23:59,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 05:23:59,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 05:23:59,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 05:23:59,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 05:23:59,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 05:23:59,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 05:23:59,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 05:23:59,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 05:23:59,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 05:23:59,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 05:23:59,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 05:23:59,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 05:23:59,870 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 05:23:59,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 05:23:59,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 05:23:59,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 05:23:59,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 05:23:59,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 05:23:59,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 05:23:59,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 05:23:59,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 05:23:59,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 05:23:59,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 05:23:59,872 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-01-26 05:23:59,873 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-01-26 05:24:00,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 05:24:00,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 05:24:00,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 05:24:00,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 05:24:00,074 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 05:24:00,075 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-01-26 05:24:01,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 05:24:01,247 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 05:24:01,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2024-01-26 05:24:01,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f91c5a002/c28c7deaffb945e28a71164dca626e42/FLAG0f26325b1 [2024-01-26 05:24:01,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f91c5a002/c28c7deaffb945e28a71164dca626e42 [2024-01-26 05:24:01,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 05:24:01,669 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 05:24:01,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 05:24:01,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 05:24:01,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 05:24:01,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1420ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01, skipping insertion in model container [2024-01-26 05:24:01,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,700 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 05:24:01,821 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[2874,2887] [2024-01-26 05:24:01,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 05:24:01,835 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 05:24:01,850 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[2874,2887] [2024-01-26 05:24:01,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 05:24:01,864 INFO L206 MainTranslator]: Completed translation [2024-01-26 05:24:01,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01 WrapperNode [2024-01-26 05:24:01,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 05:24:01,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 05:24:01,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 05:24:01,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 05:24:01,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,902 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 291 [2024-01-26 05:24:01,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 05:24:01,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 05:24:01,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 05:24:01,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 05:24:01,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 05:24:01,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 05:24:01,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 05:24:01,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 05:24:01,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (1/1) ... [2024-01-26 05:24:01,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 05:24:01,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:24:01,980 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-01-26 05:24:01,995 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-01-26 05:24:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 05:24:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 05:24:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 05:24:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 05:24:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 05:24:02,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 05:24:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 05:24:02,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 05:24:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 05:24:02,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 05:24:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 05:24:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 05:24:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 05:24:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 05:24:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 05:24:02,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 05:24:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 05:24:02,015 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 05:24:02,117 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 05:24:02,119 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 05:24:02,461 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 05:24:02,608 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 05:24:02,608 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2024-01-26 05:24:02,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 05:24:02 BoogieIcfgContainer [2024-01-26 05:24:02,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 05:24:02,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 05:24:02,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 05:24:02,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 05:24:02,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 05:24:01" (1/3) ... [2024-01-26 05:24:02,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30460e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 05:24:02, skipping insertion in model container [2024-01-26 05:24:02,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:24:01" (2/3) ... [2024-01-26 05:24:02,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30460e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 05:24:02, skipping insertion in model container [2024-01-26 05:24:02,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 05:24:02" (3/3) ... [2024-01-26 05:24:02,618 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2024-01-26 05:24:02,627 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 05:24:02,634 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 05:24:02,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 05:24:02,634 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 05:24:02,692 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-26 05:24:02,747 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 05:24:02,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 05:24:02,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:24:02,750 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-01-26 05:24:02,763 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-01-26 05:24:02,790 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 05:24:02,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 05:24:02,800 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;@16684493, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 05:24:02,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-26 05:24:02,996 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:24:03,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:24:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1002848271, now seen corresponding path program 1 times [2024-01-26 05:24:03,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:24:03,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264941660] [2024-01-26 05:24:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:24:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:24:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:24:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-26 05:24:03,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:24:03,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264941660] [2024-01-26 05:24:03,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264941660] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 05:24:03,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 05:24:03,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 05:24:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206764479] [2024-01-26 05:24:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 05:24:03,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 05:24:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:24:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 05:24:03,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 05:24:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:03,249 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:24:03,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 05:24:03,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:03,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 05:24:03,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:24:03,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:24:03,314 INFO L85 PathProgramCache]: Analyzing trace with hash -164567404, now seen corresponding path program 1 times [2024-01-26 05:24:03,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:24:03,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151072848] [2024-01-26 05:24:03,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:24:03,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:24:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:24:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 05:24:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:24:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151072848] [2024-01-26 05:24:03,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151072848] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 05:24:03,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 05:24:03,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-26 05:24:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773043264] [2024-01-26 05:24:03,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 05:24:03,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-26 05:24:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:24:03,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-26 05:24:03,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-01-26 05:24:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:03,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:24:03,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 05:24:03,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:03,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:04,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 05:24:04,027 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:24:04,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:24:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 367650498, now seen corresponding path program 1 times [2024-01-26 05:24:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:24:04,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96757568] [2024-01-26 05:24:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:24:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:24:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:24:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 05:24:04,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:24:04,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96757568] [2024-01-26 05:24:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96757568] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:24:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082774800] [2024-01-26 05:24:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:24:04,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:24:04,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:24:04,306 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-01-26 05:24:04,328 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-01-26 05:24:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:24:04,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 05:24:04,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:24:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 05:24:04,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:24:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 05:24:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082774800] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 05:24:04,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-26 05:24:04,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-01-26 05:24:04,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658224194] [2024-01-26 05:24:04,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 05:24:04,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 05:24:04,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:24:04,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 05:24:04,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-01-26 05:24:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:04,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:24:04,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 05:24:04,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:04,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:04,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:04,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-26 05:24:05,088 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-01-26 05:24:05,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:24:05,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:24:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2026771164, now seen corresponding path program 1 times [2024-01-26 05:24:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:24:05,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178425511] [2024-01-26 05:24:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:24:05,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:24:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:24:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 05:24:05,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:24:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178425511] [2024-01-26 05:24:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178425511] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:24:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005700219] [2024-01-26 05:24:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:24:05,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:24:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:24:05,395 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-01-26 05:24:05,420 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-01-26 05:24:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:24:05,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 05:24:05,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:24:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 05:24:05,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:24:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 05:24:05,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005700219] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:24:05,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:24:05,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-01-26 05:24:05,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130010291] [2024-01-26 05:24:05,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:24:05,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-01-26 05:24:05,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:24:05,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-01-26 05:24:05,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2024-01-26 05:24:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:05,961 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:24:05,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.04) internal successors, (226), 25 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 05:24:05,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:05,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:05,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:05,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:24:06,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-26 05:24:06,548 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-01-26 05:24:06,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:24:06,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:24:06,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1628339574, now seen corresponding path program 2 times [2024-01-26 05:24:06,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:24:06,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240540704] [2024-01-26 05:24:06,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:24:06,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:24:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:24:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-01-26 05:24:06,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:24:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240540704] [2024-01-26 05:24:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240540704] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:24:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225175454] [2024-01-26 05:24:06,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 05:24:06,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:24:06,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:24:06,789 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-01-26 05:24:06,800 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-01-26 05:24:06,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 05:24:06,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:24:06,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-26 05:24:06,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:24:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-01-26 05:24:07,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:24:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-01-26 05:24:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225175454] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:24:07,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:24:07,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2024-01-26 05:24:07,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761382999] [2024-01-26 05:24:07,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:24:07,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-01-26 05:24:07,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:24:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-01-26 05:24:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-01-26 05:24:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:07,078 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:24:07,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.571428571428571) internal successors, (306), 21 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 05:24:07,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:07,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:07,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:07,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:24:07,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:24:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-26 05:24:07,577 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-01-26 05:24:07,775 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-01-26 05:24:07,776 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:24:07,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:24:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1705789276, now seen corresponding path program 3 times [2024-01-26 05:24:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:24:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816191405] [2024-01-26 05:24:07,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:24:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:24:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:24:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 05:24:08,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:24:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816191405] [2024-01-26 05:24:08,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816191405] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:24:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392458210] [2024-01-26 05:24:08,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 05:24:08,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:24:08,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:24:08,095 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-01-26 05:24:08,099 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-01-26 05:24:08,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-26 05:24:08,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:24:08,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-26 05:24:08,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:24:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-01-26 05:24:08,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:24:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-01-26 05:24:08,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392458210] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:24:08,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:24:08,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 29 [2024-01-26 05:24:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608262105] [2024-01-26 05:24:08,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:24:08,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-01-26 05:24:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:24:08,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-01-26 05:24:08,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2024-01-26 05:24:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:08,534 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:24:08,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.068965517241379) internal successors, (321), 29 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 05:24:08,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:08,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:08,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:08,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:24:08,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-01-26 05:24:08,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:24:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:24:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:24:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-26 05:24:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-01-26 05:24:09,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-01-26 05:24:09,325 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-01-26 05:24:09,326 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:24:09,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:24:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash 250451948, now seen corresponding path program 4 times [2024-01-26 05:24:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:24:09,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313329096] [2024-01-26 05:24:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:24:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:24:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 05:24:09,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-26 05:24:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 05:24:09,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-26 05:24:09,700 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-26 05:24:09,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 05:24:09,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 05:24:09,709 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-01-26 05:24:09,710 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/4) [2024-01-26 05:24:09,712 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 05:24:09,712 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 05:24:09,782 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 05:24:09,785 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 05:24:09,788 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 05:24:09,790 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 05:24:09,791 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 05:24:09,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 05:24:09 BasicIcfg [2024-01-26 05:24:09,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 05:24:09,804 INFO L158 Benchmark]: Toolchain (without parser) took 8134.41ms. Allocated memory was 239.1MB in the beginning and 431.0MB in the end (delta: 191.9MB). Free memory was 174.7MB in the beginning and 211.2MB in the end (delta: -36.5MB). Peak memory consumption was 157.0MB. Max. memory is 8.0GB. [2024-01-26 05:24:09,804 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 239.1MB. Free memory is still 189.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 05:24:09,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.10ms. Allocated memory is still 239.1MB. Free memory was 174.4MB in the beginning and 161.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 05:24:09,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.75ms. Allocated memory is still 239.1MB. Free memory was 161.8MB in the beginning and 159.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 05:24:09,804 INFO L158 Benchmark]: Boogie Preprocessor took 29.29ms. Allocated memory is still 239.1MB. Free memory was 159.2MB in the beginning and 156.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 05:24:09,804 INFO L158 Benchmark]: RCFGBuilder took 676.18ms. Allocated memory was 239.1MB in the beginning and 343.9MB in the end (delta: 104.9MB). Free memory was 156.9MB in the beginning and 247.7MB in the end (delta: -90.8MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. [2024-01-26 05:24:09,805 INFO L158 Benchmark]: TraceAbstraction took 7191.45ms. Allocated memory was 343.9MB in the beginning and 431.0MB in the end (delta: 87.0MB). Free memory was 247.1MB in the beginning and 211.2MB in the end (delta: 36.0MB). Peak memory consumption was 123.0MB. Max. memory is 8.0GB. [2024-01-26 05:24:09,805 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.10ms. Allocated memory is still 239.1MB. Free memory is still 189.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.10ms. Allocated memory is still 239.1MB. Free memory was 174.4MB in the beginning and 161.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.75ms. Allocated memory is still 239.1MB. Free memory was 161.8MB in the beginning and 159.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.29ms. Allocated memory is still 239.1MB. Free memory was 159.2MB in the beginning and 156.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 676.18ms. Allocated memory was 239.1MB in the beginning and 343.9MB in the end (delta: 104.9MB). Free memory was 156.9MB in the beginning and 247.7MB in the end (delta: -90.8MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7191.45ms. Allocated memory was 343.9MB in the beginning and 431.0MB in the end (delta: 87.0MB). Free memory was 247.1MB in the beginning and 211.2MB in the end (delta: 36.0MB). Peak memory consumption was 123.0MB. 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: 10365, independent: 9597, independent conditional: 9597, independent unconditional: 0, dependent: 768, dependent conditional: 768, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9710, independent: 9597, independent conditional: 9597, 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: 9710, independent: 9597, independent conditional: 9597, 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: 10009, independent: 9597, independent conditional: 0, independent unconditional: 9597, 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: 10009, independent: 9597, independent conditional: 0, independent unconditional: 9597, 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: 10009, independent: 9597, independent conditional: 0, independent unconditional: 9597, 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: 351, independent: 348, independent conditional: 0, independent unconditional: 348, 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: 351, independent: 348, independent conditional: 0, independent unconditional: 348, 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: 39, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10009, independent: 9249, independent conditional: 0, independent unconditional: 9249, dependent: 409, dependent conditional: 0, dependent unconditional: 409, unknown: 351, unknown conditional: 0, unknown unconditional: 351] , Statistics on independence cache: Total cache size (in pairs): 351, Positive cache size: 348, Positive conditional cache size: 0, Positive unconditional cache size: 348, 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: 655 - 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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6:0}, arr={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, 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={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=0, res1=-1, res2=0, tmp=-1] [L48] 1 i++ VAL [A={3:0}, B={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=1, res1=-1, res2=0, tmp=-1] [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={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=1, res1=-2, res2=0, tmp=-2] [L48] 1 i++ VAL [A={3:0}, B={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=2, res1=-2, res2=0, tmp=-2] [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={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=2, res1=-1, res2=0, tmp=-1] [L48] 1 i++ VAL [A={3:0}, B={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=3, res1=-1, res2=0, tmp=-1] [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={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=2, res1=-1, 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={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=0, res1=-1, res2=-1, tmp=-1] [L61] 2 i++ VAL [A={3:0}, B={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=1, res1=-1, res2=-1, tmp=-1] [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={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=1, res1=-1, res2=0, tmp=0] [L61] 2 i++ VAL [A={3:0}, B={-6:0}, M=2, N=3, _argptr={0:0}, _argptr={0:0}, i=2, res1=-1, res2=0, tmp=0] [L61] COND FALSE 2 !(i