/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 -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 18:24:33,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 18:24:33,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 18:24:33,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 18:24:33,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 18:24:33,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 18:24:33,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 18:24:33,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 18:24:33,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 18:24:33,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 18:24:33,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 18:24:33,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 18:24:33,341 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 18:24:33,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 18:24:33,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 18:24:33,342 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 18:24:33,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 18:24:33,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 18:24:33,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 18:24:33,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 18:24:33,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 18:24:33,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 18:24:33,344 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 18:24:33,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 18:24:33,344 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 18:24:33,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 18:24:33,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 18:24:33,345 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 18:24:33,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 18:24:33,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:24:33,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 18:24:33,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 18:24:33,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 18:24:33,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 18:24:33,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 18:24:33,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 18:24:33,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 18:24:33,347 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 18:24:33,347 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 18:24:33,347 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 18:24:33,348 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/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> PSEUDO_LOCKSTEP [2023-11-17 18:24:33,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 18:24:33,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 18:24:33,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 18:24:33,561 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 18:24:33,561 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 18:24:33,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-11-17 18:24:34,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 18:24:34,776 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 18:24:34,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-11-17 18:24:34,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e02bbe0/60391511a7fd425a925a3dd4bb14738e/FLAGca53b1e23 [2023-11-17 18:24:34,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e02bbe0/60391511a7fd425a925a3dd4bb14738e [2023-11-17 18:24:34,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 18:24:34,809 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 18:24:34,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 18:24:34,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 18:24:34,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 18:24:34,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:24:34" (1/1) ... [2023-11-17 18:24:34,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66731fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:34, skipping insertion in model container [2023-11-17 18:24:34,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:24:34" (1/1) ... [2023-11-17 18:24:34,838 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 18:24:34,974 WARN L240 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] [2023-11-17 18:24:34,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:24:34,999 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 18:24:35,028 WARN L240 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] [2023-11-17 18:24:35,031 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:24:35,036 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 18:24:35,036 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 18:24:35,041 INFO L206 MainTranslator]: Completed translation [2023-11-17 18:24:35,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35 WrapperNode [2023-11-17 18:24:35,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 18:24:35,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 18:24:35,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 18:24:35,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 18:24:35,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,090 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 291 [2023-11-17 18:24:35,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 18:24:35,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 18:24:35,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 18:24:35,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 18:24:35,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 18:24:35,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 18:24:35,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 18:24:35,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 18:24:35,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (1/1) ... [2023-11-17 18:24:35,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:24:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:24:35,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 18:24:35,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 18:24:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 18:24:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 18:24:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 18:24:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 18:24:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 18:24:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 18:24:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 18:24:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 18:24:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 18:24:35,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 18:24:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 18:24:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 18:24:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 18:24:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 18:24:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 18:24:35,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 18:24:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 18:24:35,187 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 18:24:35,292 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 18:24:35,293 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 18:24:35,624 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 18:24:35,934 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 18:24:35,934 INFO L307 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-17 18:24:35,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:24:35 BoogieIcfgContainer [2023-11-17 18:24:35,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 18:24:35,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 18:24:35,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 18:24:35,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 18:24:35,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:24:34" (1/3) ... [2023-11-17 18:24:35,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21afbe4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:24:35, skipping insertion in model container [2023-11-17 18:24:35,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:24:35" (2/3) ... [2023-11-17 18:24:35,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21afbe4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:24:35, skipping insertion in model container [2023-11-17 18:24:35,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:24:35" (3/3) ... [2023-11-17 18:24:35,945 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-11-17 18:24:35,951 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 18:24:35,958 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 18:24:35,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 18:24:35,958 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 18:24:36,015 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 18:24:36,053 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:24:36,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 18:24:36,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:24:36,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 18:24:36,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 18:24:36,091 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 18:24:36,101 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 18:24:36,105 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;@2f28df84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:24:36,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 18:24:36,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:24:36,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:24:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash 163694757, now seen corresponding path program 1 times [2023-11-17 18:24:36,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:24:36,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705644548] [2023-11-17 18:24:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:24:36,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:24:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:24:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-17 18:24:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:24:36,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705644548] [2023-11-17 18:24:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705644548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:24:36,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:24:36,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 18:24:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948289570] [2023-11-17 18:24:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:24:36,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 18:24:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:24:36,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 18:24:36,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 18:24:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:36,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:24:36,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:24:36,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:36,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 18:24:36,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:24:36,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:24:36,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2008656770, now seen corresponding path program 1 times [2023-11-17 18:24:36,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:24:36,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353000455] [2023-11-17 18:24:36,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:24:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:24:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:24:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-17 18:24:37,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:24:37,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353000455] [2023-11-17 18:24:37,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353000455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:24:37,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:24:37,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 18:24:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334923493] [2023-11-17 18:24:37,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:24:37,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 18:24:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:24:37,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 18:24:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 18:24:37,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:37,191 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:24:37,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:24:37,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:37,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:24:37,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 18:24:37,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:24:37,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:24:37,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2141395668, now seen corresponding path program 1 times [2023-11-17 18:24:37,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:24:37,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941425439] [2023-11-17 18:24:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:24:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:24:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:24:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-17 18:24:37,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:24:37,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941425439] [2023-11-17 18:24:37,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941425439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:24:37,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779485801] [2023-11-17 18:24:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:24:37,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:24:37,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:24:37,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:24:37,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 18:24:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:24:37,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 18:24:37,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:24:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-17 18:24:38,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:24:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-17 18:24:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779485801] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:24:38,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:24:38,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-11-17 18:24:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578855818] [2023-11-17 18:24:38,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:24:38,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 18:24:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:24:38,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 18:24:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-11-17 18:24:38,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:38,302 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:24:38,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.25) internal successors, (246), 24 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:24:38,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:38,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:24:38,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:24:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:24:38,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 18:24:38,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-17 18:24:38,779 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:24:38,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:24:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1994407898, now seen corresponding path program 2 times [2023-11-17 18:24:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:24:38,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788593824] [2023-11-17 18:24:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:24:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:24:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:24:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-17 18:24:39,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:24:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788593824] [2023-11-17 18:24:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788593824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:24:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015598023] [2023-11-17 18:24:39,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:24:39,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:24:39,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:24:39,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:24:39,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 18:24:39,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 18:24:39,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:24:39,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 18:24:39,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:24:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-17 18:24:39,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:24:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-17 18:24:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015598023] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:24:39,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:24:39,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 31 [2023-11-17 18:24:39,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635331570] [2023-11-17 18:24:39,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:24:39,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 18:24:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:24:39,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 18:24:39,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2023-11-17 18:24:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:39,831 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:24:39,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 10.903225806451612) internal successors, (338), 31 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:24:39,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:39,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:24:39,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:24:39,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:24:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:24:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-17 18:24:40,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 18:24:40,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:24:40,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:24:40,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:24:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1818653538, now seen corresponding path program 3 times [2023-11-17 18:24:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:24:40,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345880818] [2023-11-17 18:24:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:24:40,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:24:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:24:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 27 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-17 18:24:41,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:24:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345880818] [2023-11-17 18:24:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345880818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:24:41,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359407532] [2023-11-17 18:24:41,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 18:24:41,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:24:41,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:24:41,352 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:24:41,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 18:24:41,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-17 18:24:41,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:24:41,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-17 18:24:41,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:24:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-17 18:24:41,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:24:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-17 18:24:42,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359407532] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:24:42,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:24:42,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 42 [2023-11-17 18:24:42,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728831849] [2023-11-17 18:24:42,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:24:42,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-17 18:24:42,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:24:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-17 18:24:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1592, Unknown=0, NotChecked=0, Total=1722 [2023-11-17 18:24:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:42,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:24:42,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 8.976190476190476) internal successors, (377), 42 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:24:42,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:42,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:24:42,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:24:42,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-17 18:24:42,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:24:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:24:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:24:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-17 18:24:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-17 18:24:43,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 18:24:43,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:24:43,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 18:24:43,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:24:43,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1837813866, now seen corresponding path program 4 times [2023-11-17 18:24:43,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:24:43,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199404540] [2023-11-17 18:24:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:24:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:24:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 18:24:43,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 18:24:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 18:24:43,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 18:24:43,700 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 18:24:43,700 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 18:24:43,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 18:24:43,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 18:24:43,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 18:24:43,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 18:24:43,710 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2023-11-17 18:24:43,714 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 18:24:43,714 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 18:24:43,815 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-17 18:24:43,816 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-17 18:24:43,818 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc29 [2023-11-17 18:24:43,819 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-17 18:24:43,823 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-17 18:24:43,824 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-17 18:24:43,824 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-17 18:24:43,824 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 18:24:43,825 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret18 [2023-11-17 18:24:43,825 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc29 [2023-11-17 18:24:43,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-17 18:24:43,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-17 18:24:43,826 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-17 18:24:43,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated [2023-11-17 18:24:43,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 18:24:43,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret19 [2023-11-17 18:24:43,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre20 could not be translated [2023-11-17 18:24:43,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post1 could not be translated [2023-11-17 18:24:43,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated [2023-11-17 18:24:43,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post1 could not be translated [2023-11-17 18:24:43,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post1 could not be translated [2023-11-17 18:24:43,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-17 18:24:43,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated [2023-11-17 18:24:43,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 18:24:43,831 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 18:24:43,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-17 18:24:43,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem26 could not be translated [2023-11-17 18:24:43,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem26 could not be translated [2023-11-17 18:24:43,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem27 could not be translated [2023-11-17 18:24:43,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem27 could not be translated [2023-11-17 18:24:43,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated [2023-11-17 18:24:43,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated [2023-11-17 18:24:43,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:24:43 BasicIcfg [2023-11-17 18:24:43,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 18:24:43,851 INFO L158 Benchmark]: Toolchain (without parser) took 9043.20ms. Allocated memory was 230.7MB in the beginning and 376.4MB in the end (delta: 145.8MB). Free memory was 191.5MB in the beginning and 326.2MB in the end (delta: -134.7MB). Peak memory consumption was 217.2MB. Max. memory is 8.0GB. [2023-11-17 18:24:43,852 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory was 124.1MB in the beginning and 124.0MB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 18:24:43,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.12ms. Allocated memory is still 230.7MB. Free memory was 191.2MB in the beginning and 179.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 18:24:43,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.42ms. Allocated memory is still 230.7MB. Free memory was 179.0MB in the beginning and 176.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 18:24:43,852 INFO L158 Benchmark]: Boogie Preprocessor took 38.86ms. Allocated memory is still 230.7MB. Free memory was 176.5MB in the beginning and 173.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 18:24:43,852 INFO L158 Benchmark]: RCFGBuilder took 805.78ms. Allocated memory is still 230.7MB. Free memory was 173.9MB in the beginning and 182.8MB in the end (delta: -8.9MB). Peak memory consumption was 58.2MB. Max. memory is 8.0GB. [2023-11-17 18:24:43,852 INFO L158 Benchmark]: TraceAbstraction took 7912.56ms. Allocated memory was 230.7MB in the beginning and 376.4MB in the end (delta: 145.8MB). Free memory was 182.3MB in the beginning and 326.2MB in the end (delta: -144.0MB). Peak memory consumption was 207.3MB. Max. memory is 8.0GB. [2023-11-17 18:24:43,853 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.11ms. Allocated memory is still 169.9MB. Free memory was 124.1MB in the beginning and 124.0MB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.12ms. Allocated memory is still 230.7MB. Free memory was 191.2MB in the beginning and 179.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.42ms. Allocated memory is still 230.7MB. Free memory was 179.0MB in the beginning and 176.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.86ms. Allocated memory is still 230.7MB. Free memory was 176.5MB in the beginning and 173.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 805.78ms. Allocated memory is still 230.7MB. Free memory was 173.9MB in the beginning and 182.8MB in the end (delta: -8.9MB). Peak memory consumption was 58.2MB. Max. memory is 8.0GB. * TraceAbstraction took 7912.56ms. Allocated memory was 230.7MB in the beginning and 376.4MB in the end (delta: 145.8MB). Free memory was 182.3MB in the beginning and 326.2MB in the end (delta: -144.0MB). Peak memory consumption was 207.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc29 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret18 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc29 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret19 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated - 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: IdentifierExpression #t~mem26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated - 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: 4465, independent: 4035, independent conditional: 1884, independent unconditional: 2151, dependent: 430, dependent conditional: 411, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4072, independent: 4035, independent conditional: 1884, independent unconditional: 2151, dependent: 37, dependent conditional: 18, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4072, independent: 4035, independent conditional: 1884, independent unconditional: 2151, dependent: 37, dependent conditional: 18, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4087, independent: 4035, independent conditional: 0, independent unconditional: 4035, dependent: 52, dependent conditional: 15, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4087, independent: 4035, independent conditional: 0, independent unconditional: 4035, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4087, independent: 4035, independent conditional: 0, independent unconditional: 4035, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1877, independent: 1858, independent conditional: 0, independent unconditional: 1858, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1877, independent: 1856, independent conditional: 0, independent unconditional: 1856, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4087, independent: 2177, independent conditional: 0, independent unconditional: 2177, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 1877, unknown conditional: 0, unknown unconditional: 1877] , Statistics on independence cache: Total cache size (in pairs): 1877, Positive cache size: 1858, Positive conditional cache size: 0, Positive unconditional cache size: 1858, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 1, Independence queries for same thread: 393 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 198, Number of trivial persistent sets: 159, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2170, independent: 2151, independent conditional: 0, independent unconditional: 2151, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4465, independent: 4035, independent conditional: 1884, independent unconditional: 2151, dependent: 430, dependent conditional: 411, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4072, independent: 4035, independent conditional: 1884, independent unconditional: 2151, dependent: 37, dependent conditional: 18, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4072, independent: 4035, independent conditional: 1884, independent unconditional: 2151, dependent: 37, dependent conditional: 18, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4087, independent: 4035, independent conditional: 0, independent unconditional: 4035, dependent: 52, dependent conditional: 15, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4087, independent: 4035, independent conditional: 0, independent unconditional: 4035, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4087, independent: 4035, independent conditional: 0, independent unconditional: 4035, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1877, independent: 1858, independent conditional: 0, independent unconditional: 1858, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1877, independent: 1856, independent conditional: 0, independent unconditional: 1856, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4087, independent: 2177, independent conditional: 0, independent unconditional: 2177, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 1877, unknown conditional: 0, unknown unconditional: 1877] , Statistics on independence cache: Total cache size (in pairs): 1877, Positive cache size: 1858, Positive conditional cache size: 0, Positive unconditional cache size: 1858, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 1, Independence queries for same thread: 393 - 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={9:0}, t2={10:0}, t3={7:0}] [L90] 0 M = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=3, N=0, res1=0, res2=0, t1={9:0}, t2={10:0}, t3={7:0}] [L91] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=3, N=4, res1=0, res2=0, t1={9:0}, t2={10:0}, t3={7: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=3, N=4, \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=3, N=4, \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=3, N=4, \old(size)=4, arr={3:0}, res1=0, res2=0, size=4] [L116] 0 int i = 0; VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=0, res1=0, res2=0, size=4] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=0, res1=0, res2=0, size=4] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=0, res1=0, res2=0, size=4] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=1, res1=0, res2=0, size=4] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=1, res1=0, res2=0, size=4] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=1, res1=0, res2=0, size=4] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=2, res1=0, res2=0, size=4] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=2, res1=0, res2=0, size=4] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=2, res1=0, res2=0, size=4] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=3, res1=0, res2=0, size=4] [L116] COND TRUE 0 i < size VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=3, res1=0, res2=0, size=4] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=3, res1=0, res2=0, size=4] [L116] 0 i++ VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=4, res1=0, res2=0, size=4] [L116] COND FALSE 0 !(i < size) VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={3:0}, i=4, res1=0, res2=0, size=4] [L119] 0 return arr; VAL [A={0:0}, B={0:0}, M=3, N=4, \old(size)=4, \result={3:0}, arr={3:0}, res1=0, res2=0, size=4] [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=3, N=4, res1=0, res2=0, t1={9:0}, t2={10:0}, t3={7: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=3, N=4, \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=3, N=4, \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=3, N=4, \old(size)=4, arr={5:0}, res1=0, res2=0, size=4] [L116] 0 int i = 0; VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=0, res1=0, res2=0, size=4] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=0, res1=0, res2=0, size=4] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=0, res1=0, res2=0, size=4] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=1, res1=0, res2=0, size=4] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=1, res1=0, res2=0, size=4] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=1, res1=0, res2=0, size=4] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=2, res1=0, res2=0, size=4] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=2, res1=0, res2=0, size=4] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=2, res1=0, res2=0, size=4] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=3, res1=0, res2=0, size=4] [L116] COND TRUE 0 i < size VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=3, res1=0, res2=0, size=4] [L117] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=3, res1=0, res2=0, size=4] [L116] 0 i++ VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=4, res1=0, res2=0, size=4] [L116] COND FALSE 0 !(i < size) VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, arr={5:0}, i=4, res1=0, res2=0, size=4] [L119] 0 return arr; VAL [A={3:0}, B={0:0}, M=3, N=4, \old(size)=4, \result={5:0}, arr={5:0}, res1=0, res2=0, size=4] [L93] RET, EXPR 0 create_fresh_int_array(N) [L93] 0 B = create_fresh_int_array(N) VAL [A={3:0}, B={5:0}, M=3, N=4, res1=0, res2=0, t1={9:0}, t2={10:0}, t3={7:0}] [L95] CALL 0 assume_abort_if_not(M >= 0 && M < N) [L37] COND FALSE 0 !(!cond) VAL [A={3:0}, B={5:0}, M=3, N=4, \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={5:0}, M=3, N=4, res1=0, res2=0, t1={9:0}, t2={10:0}, t3={7:0}] [L48] 1 int i=0; VAL [A={3:0}, B={5:0}, M=3, N=4, _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={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=0, res1=48, res2=0, tmp=48] [L48] 1 i++ VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=0, res1=48, res2=0, tmp=48] [L99] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, B={5:0}, M=3, N=4, res1=48, res2=0, t1={9:0}, t2={10:0}, t3={7:0}] [L48] 1 i++ VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=1, res1=48, res2=0, tmp=48] [L61] 2 int i=0; VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=0, res1=48, 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])); [L63] EXPR 2 A[i] [L63] EXPR 2 B[i] [L63] CALL, EXPR 2 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(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])); [L53] 1 res1 = tmp VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=1, res1=49, res2=0, tmp=49] [L66] 2 res2 = tmp VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=0, res1=49, res2=48, tmp=48] [L48] 1 i++ VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=1, res1=49, res2=48, tmp=49] [L61] 2 i++ VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=0, res1=49, res2=48, tmp=48] [L100] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [A={3:0}, B={5:0}, M=3, N=4, res1=49, res2=48, t1={9:0}, t2={10:0}, t3={7:0}] [L48] 1 i++ VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=2, res1=49, res2=48, tmp=49] [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={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=2, res1=31, res2=48, tmp=31] [L48] 1 i++ VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=3, res1=31, res2=48, tmp=31] [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={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=3, res1=1, res2=48, tmp=1] [L48] 1 i++ VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=4, res1=1, res2=48, 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])); [L76] EXPR 3 A[i] [L76] EXPR 3 B[i] [L76] CALL, EXPR 3 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(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={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=1, res1=1, res2=49, tmp=49] [L61] 2 i++ VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=2, res1=1, res2=49, tmp=49] [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={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=2, res1=1, res2=0, tmp=0] [L61] 2 i++ VAL [A={3:0}, B={5:0}, M=3, N=4, _argptr={0:0}, _argptr={0:0}, i=3, res1=1, res2=0, tmp=0] [L61] COND FALSE 2 !(i