/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/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 01:11:50,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 01:11:50,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 01:11:50,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 01:11:50,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 01:11:50,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 01:11:50,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 01:11:50,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 01:11:50,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 01:11:50,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 01:11:50,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 01:11:50,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 01:11:50,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 01:11:50,939 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 01:11:50,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 01:11:50,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 01:11:50,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 01:11:50,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 01:11:50,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 01:11:50,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 01:11:50,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 01:11:50,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 01:11:50,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 01:11:50,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 01:11:50,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 01:11:50,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 01:11:50,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 01:11:50,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 01:11:50,943 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 01:11:50,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 01:11:50,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 01:11:50,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 01:11:50,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 01:11:50,945 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 01:11:50,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 01:11:50,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 01:11:50,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 01:11:50,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 01:11:50,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 01:11:50,946 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 01:11:50,946 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 01:11:50,946 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 01:11:51,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 01:11:51,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 01:11:51,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 01:11:51,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 01:11:51,215 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 01:11:51,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-01-26 01:11:52,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 01:11:52,528 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 01:11:52,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-01-26 01:11:52,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/85c3c5832/e6a5b8ae72ff46c4a6128c3dbae600b8/FLAGf82081946 [2024-01-26 01:11:52,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/85c3c5832/e6a5b8ae72ff46c4a6128c3dbae600b8 [2024-01-26 01:11:52,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 01:11:52,549 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 01:11:52,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 01:11:52,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 01:11:52,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 01:11:52,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8c0ae2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52, skipping insertion in model container [2024-01-26 01:11:52,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,575 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 01:11:52,728 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2024-01-26 01:11:52,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 01:11:52,749 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 01:11:52,766 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2024-01-26 01:11:52,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 01:11:52,784 INFO L206 MainTranslator]: Completed translation [2024-01-26 01:11:52,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52 WrapperNode [2024-01-26 01:11:52,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 01:11:52,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 01:11:52,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 01:11:52,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 01:11:52,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,849 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2024-01-26 01:11:52,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 01:11:52,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 01:11:52,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 01:11:52,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 01:11:52,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 01:11:52,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 01:11:52,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 01:11:52,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 01:11:52,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (1/1) ... [2024-01-26 01:11:52,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 01:11:52,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:11:52,953 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 01:11:52,978 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 01:11:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 01:11:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 01:11:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 01:11:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 01:11:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 01:11:52,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 01:11:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 01:11:52,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 01:11:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 01:11:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 01:11:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 01:11:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 01:11:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 01:11:52,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 01:11:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 01:11:52,994 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 01:11:53,099 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 01:11:53,101 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 01:11:53,354 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 01:11:53,506 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 01:11:53,506 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-26 01:11:53,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 01:11:53 BoogieIcfgContainer [2024-01-26 01:11:53,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 01:11:53,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 01:11:53,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 01:11:53,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 01:11:53,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 01:11:52" (1/3) ... [2024-01-26 01:11:53,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6d049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 01:11:53, skipping insertion in model container [2024-01-26 01:11:53,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:11:52" (2/3) ... [2024-01-26 01:11:53,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6d049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 01:11:53, skipping insertion in model container [2024-01-26 01:11:53,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 01:11:53" (3/3) ... [2024-01-26 01:11:53,519 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-01-26 01:11:53,528 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 01:11:53,550 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 01:11:53,550 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 01:11:53,550 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 01:11:53,606 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 01:11:53,643 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 01:11:53,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 01:11:53,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:11:53,652 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 01:11:53,662 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 01:11:53,695 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 01:11:53,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 01:11:53,711 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aebca66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 01:11:53,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 01:11:53,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:11:53,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:11:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 649439088, now seen corresponding path program 1 times [2024-01-26 01:11:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:11:53,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877160058] [2024-01-26 01:11:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:11:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:11:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:11:54,120 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 01:11:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:11:54,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877160058] [2024-01-26 01:11:54,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877160058] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 01:11:54,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 01:11:54,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 01:11:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060246231] [2024-01-26 01:11:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:11:54,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 01:11:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:11:54,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 01:11:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 01:11:54,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:54,158 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:11:54,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 01:11:54,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:11:54,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:54,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 01:11:54,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:11:54,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:11:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1101290333, now seen corresponding path program 1 times [2024-01-26 01:11:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:11:54,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800204658] [2024-01-26 01:11:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:11:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:11:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:11:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:11:54,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:11:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800204658] [2024-01-26 01:11:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800204658] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:11:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633288303] [2024-01-26 01:11:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:11:54,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:11:54,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:11:54,859 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 01:11:54,882 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 01:11:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:11:55,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 01:11:55,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:11:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:11:55,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:11:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:11:55,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633288303] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:11:55,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:11:55,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-01-26 01:11:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364172875] [2024-01-26 01:11:55,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:11:55,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-26 01:11:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:11:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-26 01:11:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-01-26 01:11:55,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:55,594 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:11:55,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.041666666666667) internal successors, (169), 24 states have internal predecessors, (169), 0 states have call successors, (0), 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 01:11:55,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:55,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:11:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 01:11:55,956 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-01-26 01:11:56,149 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,SelfDestructingSolverStorable1 [2024-01-26 01:11:56,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:11:56,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:11:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2026664295, now seen corresponding path program 2 times [2024-01-26 01:11:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:11:56,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528358335] [2024-01-26 01:11:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:11:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:11:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:11:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-01-26 01:11:56,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:11:56,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528358335] [2024-01-26 01:11:56,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528358335] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:11:56,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886941205] [2024-01-26 01:11:56,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 01:11:56,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:11:56,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:11:56,415 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 01:11:56,432 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 01:11:56,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 01:11:56,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:11:56,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-26 01:11:56,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:11:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-01-26 01:11:56,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:11:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-01-26 01:11:56,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886941205] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:11:56,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:11:56,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-01-26 01:11:56,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430357272] [2024-01-26 01:11:56,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:11:56,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-26 01:11:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:11:56,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-26 01:11:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-01-26 01:11:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:56,805 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:11:56,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.347826086956522) internal successors, (215), 23 states have internal predecessors, (215), 0 states have call successors, (0), 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 01:11:56,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:56,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 01:11:56,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:11:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 01:11:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 01:11:57,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-26 01:11:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:11:57,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:11:57,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:11:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash -108846649, now seen corresponding path program 3 times [2024-01-26 01:11:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:11:57,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675987190] [2024-01-26 01:11:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:11:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:11:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:11:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 01:11:57,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:11:57,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675987190] [2024-01-26 01:11:57,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675987190] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:11:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997737372] [2024-01-26 01:11:57,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 01:11:57,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:11:57,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:11:57,874 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 01:11:57,893 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 01:11:58,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-26 01:11:58,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:11:58,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-26 01:11:58,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:11:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 01:11:58,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:11:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 01:11:58,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997737372] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:11:58,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:11:58,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2024-01-26 01:11:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135746681] [2024-01-26 01:11:58,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:11:58,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-01-26 01:11:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:11:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-01-26 01:11:58,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2024-01-26 01:11:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:58,734 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:11:58,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 0 states have call successors, (0), 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 01:11:58,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:58,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 01:11:58,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 01:11:58,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:11:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:11:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 01:11:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 01:11:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-26 01:11:59,216 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 01:11:59,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:11:59,417 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:11:59,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:11:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash -302183386, now seen corresponding path program 4 times [2024-01-26 01:11:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:11:59,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787822560] [2024-01-26 01:11:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:11:59,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:11:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:11:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 61 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-01-26 01:11:59,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:11:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787822560] [2024-01-26 01:11:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787822560] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:11:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854816462] [2024-01-26 01:11:59,820 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 01:11:59,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:11:59,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:11:59,825 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 01:11:59,844 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 01:11:59,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 01:11:59,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:11:59,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 18 conjunts are in the unsatisfiable core [2024-01-26 01:11:59,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:12:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-01-26 01:12:00,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:12:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-01-26 01:12:00,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854816462] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:12:00,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:12:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2024-01-26 01:12:00,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243807464] [2024-01-26 01:12:00,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:12:00,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-01-26 01:12:00,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:12:00,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-01-26 01:12:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2024-01-26 01:12:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:12:00,798 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:12:00,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.5227272727272725) internal successors, (243), 44 states have internal predecessors, (243), 0 states have call successors, (0), 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 01:12:00,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:12:00,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 01:12:00,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 01:12:00,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-01-26 01:12:00,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:12:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:12:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 01:12:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 01:12:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-26 01:12:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:12:01,446 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-01-26 01:12:01,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:12:01,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:12:01,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:12:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash -424131779, now seen corresponding path program 5 times [2024-01-26 01:12:01,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:12:01,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137630751] [2024-01-26 01:12:01,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:12:01,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:12:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:12:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 77 proven. 76 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-01-26 01:12:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:12:02,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137630751] [2024-01-26 01:12:02,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137630751] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:12:02,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818186640] [2024-01-26 01:12:02,203 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-26 01:12:02,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:12:02,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:12:02,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:12:02,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-26 01:12:02,343 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-01-26 01:12:02,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:12:02,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-26 01:12:02,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:12:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 65 proven. 52 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-01-26 01:12:02,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:12:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 44 proven. 73 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-01-26 01:12:03,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818186640] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:12:03,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:12:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 49 [2024-01-26 01:12:03,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764117136] [2024-01-26 01:12:03,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:12:03,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-01-26 01:12:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:12:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-01-26 01:12:03,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2125, Unknown=0, NotChecked=0, Total=2352 [2024-01-26 01:12:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:12:03,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:12:03,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.285714285714286) internal successors, (308), 49 states have internal predecessors, (308), 0 states have call successors, (0), 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 01:12:03,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:12:03,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 01:12:03,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 01:12:03,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-01-26 01:12:03,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:12:03,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:12:05,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:12:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 01:12:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 01:12:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-26 01:12:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:12:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-01-26 01:12:05,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-26 01:12:05,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:12:05,560 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:12:05,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:12:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash 922544318, now seen corresponding path program 6 times [2024-01-26 01:12:05,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:12:05,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121423178] [2024-01-26 01:12:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:12:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:12:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 01:12:05,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-26 01:12:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 01:12:05,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-26 01:12:05,882 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-26 01:12:05,883 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 01:12:05,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 01:12:05,895 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1] [2024-01-26 01:12:05,896 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/3) [2024-01-26 01:12:05,899 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 01:12:05,899 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 01:12:05,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 01:12:06,005 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 01:12:06,010 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 01:12:06,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 01:12:06 BasicIcfg [2024-01-26 01:12:06,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 01:12:06,026 INFO L158 Benchmark]: Toolchain (without parser) took 13477.29ms. Allocated memory was 292.6MB in the beginning and 421.5MB in the end (delta: 129.0MB). Free memory was 240.0MB in the beginning and 300.4MB in the end (delta: -60.4MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. [2024-01-26 01:12:06,026 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 01:12:06,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.76ms. Allocated memory is still 292.6MB. Free memory was 239.5MB in the beginning and 227.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-01-26 01:12:06,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.14ms. Allocated memory is still 292.6MB. Free memory was 227.4MB in the beginning and 225.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:12:06,027 INFO L158 Benchmark]: Boogie Preprocessor took 51.60ms. Allocated memory is still 292.6MB. Free memory was 225.3MB in the beginning and 223.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:12:06,027 INFO L158 Benchmark]: RCFGBuilder took 604.36ms. Allocated memory is still 292.6MB. Free memory was 223.7MB in the beginning and 194.9MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2024-01-26 01:12:06,027 INFO L158 Benchmark]: TraceAbstraction took 12514.15ms. Allocated memory was 292.6MB in the beginning and 421.5MB in the end (delta: 129.0MB). Free memory was 194.4MB in the beginning and 300.4MB in the end (delta: -106.0MB). Peak memory consumption was 23.5MB. Max. memory is 8.0GB. [2024-01-26 01:12:06,031 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.12ms. Allocated memory is still 199.2MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.76ms. Allocated memory is still 292.6MB. Free memory was 239.5MB in the beginning and 227.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.14ms. Allocated memory is still 292.6MB. Free memory was 227.4MB in the beginning and 225.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.60ms. Allocated memory is still 292.6MB. Free memory was 225.3MB in the beginning and 223.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 604.36ms. Allocated memory is still 292.6MB. Free memory was 223.7MB in the beginning and 194.9MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 12514.15ms. Allocated memory was 292.6MB in the beginning and 421.5MB in the end (delta: 129.0MB). Free memory was 194.4MB in the beginning and 300.4MB in the end (delta: -106.0MB). Peak memory consumption was 23.5MB. 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 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: 417, independent: 348, independent conditional: 348, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 361, independent: 348, independent conditional: 348, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 361, independent: 348, independent conditional: 348, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 397, independent: 348, independent conditional: 0, independent unconditional: 348, dependent: 49, dependent conditional: 36, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 397, independent: 348, independent conditional: 0, independent unconditional: 348, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 397, independent: 348, independent conditional: 0, independent unconditional: 348, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 361, independent: 348, independent conditional: 0, independent unconditional: 348, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 361, independent: 348, independent conditional: 0, independent unconditional: 348, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 397, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 361, unknown conditional: 0, unknown unconditional: 361] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 348, Positive conditional cache size: 0, Positive unconditional cache size: 348, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 6, Independence queries for same thread: 56 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 12, RedundantProofs: 4, ProvenStates: 84, Times there's more than one choice: 66, Avg number of choices: 3.3095238095238093 - StatisticsResult: Reduction benchmarks 0.2s Time before loop, 2.0s Time in loop, 2.2s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, thread2Thread1of1ForFork0_minus_#in~a#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, thread2Thread1of1ForFork0_minus_#in~b#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork0_thidvar0, old(thread2Thread1of1ForFork0_thidvar0), thread2Thread1of1ForFork0_thidvar1, old(thread2Thread1of1ForFork0_thidvar1), thread2Thread1of1ForFork0_thidvar2, old(thread2Thread1of1ForFork0_thidvar2), write~int_#ptr.base, #Ultimate.allocOnHeap_#res.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, thread2Thread1of1ForFork0_#t~ret6#1, thread1_#res#1.base, thread2_#res#1.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~mem14#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread1_plus_#res#1, thread1_#t~mem2#1, thread2_#t~mem5#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet7#1, thread2Thread1of1ForFork0_#res#1.offset, thread2_minus_#in~a#1, thread2_minus_#in~b#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, thread1_#t~ret3#1, thread2_#t~ret6#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, thread1Thread1of1ForFork1_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, thread1Thread1of1ForFork1_plus_#res#1, thread1_plus_#in~a#1, thread1_plus_#in~b#1, thread1Thread1of1ForFork1_#t~mem2#1, read~int_#ptr.base, ULTIMATE.start_#t~ret18#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread1_#res#1.offset, thread2_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, read~int_#sizeOfReadType, thread1_plus_~a#1, thread1_plus_~b#1, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_~_argptr#1.offset, ULTIMATE.start_main_~#t1~0#1.offset, thread1_#t~post1#1, thread2_#t~post4#1, ULTIMATE.start_main_#t~pre11#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_~b#1, #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork0_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread2_minus_~a#1, thread2_minus_~b#1, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, write~int_#value, ~A~0.offset, old(~A~0.offset), write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, thread1Thread1of1ForFork1_thidvar0, old(thread1Thread1of1ForFork1_thidvar0), thread1Thread1of1ForFork1_thidvar1, old(thread1Thread1of1ForFork1_thidvar1), ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post1#1, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.offset, ~N~0, old(~N~0), #Ultimate.allocOnHeap_#res.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, #valid, old(#valid), ~counter~0, old(~counter~0), read~int_#value, #Ultimate.allocInit_~size, ULTIMATE.start_main_#t~ret8#1.offset, thread1_assume_abort_if_not_~cond#1, thread2_assume_abort_if_not_~cond#1, write~init~int_#ptr.base, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1_#in~_argptr#1.base, thread2_#in~_argptr#1.base, thread2Thread1of1ForFork0_minus_#res#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet12#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, #length, old(#length), thread1Thread1of1ForFork1_#in~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.base, thread2Thread1of1ForFork0_~tmp~1#1, write~int_#sizeOfWrittenType, ~A~0.base, old(~A~0.base), thread2_minus_#res#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork0_~i~1#1, #StackHeapBarrier, old(#StackHeapBarrier), thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, thread1_~tmp~0#1, thread2_~tmp~1#1, thread1_~i~0#1, thread2_~i~1#1, write~int_#ptr.offset, ULTIMATE.start_main_#t~pre9#1, #Ultimate.allocOnHeap_~size, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, old(#memory_int), #Ultimate.allocOnStack_#res.base, thread1Thread1of1ForFork1_~tmp~0#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork1_~i~0#1, read~int_#ptr.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset], Protected Variables before encountering a loop: [] - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, N=0, counter=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, N=0, counter=0, t1={5:0}, t2={3:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, counter=0, t1={5:0}, t2={3:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=6, \old(cond)=1, cond=1, counter=0] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=6, \old(cond)=1, cond=1, counter=0] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, size=6] [L97] 0 int i = 0; VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=0, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=0, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=0, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=1, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=1, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=1, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=2, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=2, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=2, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=3, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=3, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=3, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=4, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=4, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=4, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=5, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=5, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=5, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=6, size=6] [L97] COND FALSE 0 !(i < size) VAL [A={0:0}, N=6, \old(size)=6, arr={-3:0}, counter=0, i=6, size=6] [L100] 0 return arr; VAL [A={0:0}, N=6, \old(size)=6, \result={-3:0}, arr={-3:0}, counter=0, size=6] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={-3:0}, N=6, counter=0, t1={5:0}, t2={3:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, N=6, counter=0, t1={5:0}, t2={3:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, N=6, counter=0, t1={5:0}, t2={3:0}] [L83] 0 \read(t1) VAL [A={-3:0}, N=6, counter=0, t1={5:0}, t2={3:0}] [L49] 1 int i=0; VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=7, i=0, tmp=7] [L49] 1 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=7, i=1, tmp=7] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=13, i=1, tmp=13] [L49] 1 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=13, i=2, tmp=13] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=-4, i=2, tmp=-4] [L49] 1 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=-4, i=3, tmp=-4] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=9, i=3, tmp=9] [L49] 1 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=9, i=4, tmp=9] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] 2 int i=0; VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=9, i=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=5, i=4, tmp=5] [L49] 1 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=5, i=5, tmp=5] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=0, i=5, tmp=0] [L49] 1 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=0, i=6, tmp=0] [L49] COND FALSE 1 !(i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=-4, i=1, tmp=-4] [L62] 2 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=-4, i=2, tmp=-4] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=13, i=2, tmp=13] [L62] 2 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=13, i=3, tmp=13] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=0, i=3, tmp=0] [L62] 2 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=0, i=4, tmp=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=4, i=4, tmp=4] [L62] 2 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=4, i=5, tmp=4] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=9, i=5, tmp=9] [L62] 2 i++ VAL [A={-3:0}, N=6, _argptr={0:0}, _argptr={0:0}, counter=9, i=6, tmp=9] [L62] COND FALSE 2 !(i