/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.trace.refinement.strategy BADGER -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/chunk02/singleton_with-uninit-problems.line721.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-e57bdd3-m [2022-10-19 18:04:33,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-19 18:04:33,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-19 18:04:33,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-19 18:04:33,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-19 18:04:33,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-19 18:04:33,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-19 18:04:33,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-19 18:04:33,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-19 18:04:33,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-19 18:04:33,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-19 18:04:33,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-19 18:04:33,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-19 18:04:33,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-19 18:04:33,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-19 18:04:33,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-19 18:04:33,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-19 18:04:33,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-19 18:04:33,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-19 18:04:33,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-19 18:04:33,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-19 18:04:33,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-19 18:04:33,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-19 18:04:33,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-19 18:04:33,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-19 18:04:33,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-19 18:04:33,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-19 18:04:33,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-19 18:04:33,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-19 18:04:33,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-19 18:04:33,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-19 18:04:33,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-19 18:04:33,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-19 18:04:33,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-19 18:04:33,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-19 18:04:33,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-19 18:04:33,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-19 18:04:33,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-19 18:04:33,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-19 18:04:33,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-19 18:04:33,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-19 18:04:33,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-19 18:04:33,796 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-19 18:04:33,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-19 18:04:33,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-19 18:04:33,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-19 18:04:33,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-19 18:04:33,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-19 18:04:33,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-19 18:04:33,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-19 18:04:33,799 INFO L138 SettingsManager]: * Use SBE=true [2022-10-19 18:04:33,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-19 18:04:33,800 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-19 18:04:33,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-19 18:04:33,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-19 18:04:33,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-19 18:04:33,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-19 18:04:33,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-19 18:04:33,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-19 18:04:33,801 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-19 18:04:33,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-19 18:04:33,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-19 18:04:33,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-19 18:04:33,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-19 18:04:33,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-19 18:04:33,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-19 18:04:33,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-19 18:04:33,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-19 18:04:33,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-19 18:04:33,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-19 18:04:33,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-19 18:04:33,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-19 18:04:33,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-19 18:04:33,802 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-19 18:04:33,803 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-19 18:04:33,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-19 18:04:33,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-19 18:04:33,803 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-19 18:04:33,803 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-19 18:04:33,803 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-19 18:04:33,804 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> BADGER [2022-10-19 18:04:34,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-19 18:04:34,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-19 18:04:34,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-19 18:04:34,207 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-19 18:04:34,208 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-19 18:04:34,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/chunk02/singleton_with-uninit-problems.line721.bpl [2022-10-19 18:04:34,211 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/chunk02/singleton_with-uninit-problems.line721.bpl' [2022-10-19 18:04:34,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-19 18:04:34,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-10-19 18:04:34,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-19 18:04:34,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-19 18:04:34,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-19 18:04:34,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,316 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-10-19 18:04:34,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-19 18:04:34,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-19 18:04:34,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-19 18:04:34,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-19 18:04:34,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-19 18:04:34,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-19 18:04:34,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-19 18:04:34,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-19 18:04:34,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/1) ... [2022-10-19 18:04:34,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-19 18:04:34,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-19 18:04:34,418 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) [2022-10-19 18:04:34,425 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 [2022-10-19 18:04:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2022-10-19 18:04:34,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2022-10-19 18:04:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-10-19 18:04:34,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-10-19 18:04:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-10-19 18:04:34,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-10-19 18:04:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-19 18:04:34,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-19 18:04:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-10-19 18:04:34,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-10-19 18:04:34,473 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-19 18:04:34,647 INFO L234 CfgBuilder]: Building ICFG [2022-10-19 18:04:34,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-19 18:04:35,076 INFO L275 CfgBuilder]: Performing block encoding [2022-10-19 18:04:35,088 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-19 18:04:35,088 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-19 18:04:35,090 INFO L202 PluginConnector]: Adding new model singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:04:35 BoogieIcfgContainer [2022-10-19 18:04:35,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-19 18:04:35,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-19 18:04:35,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-19 18:04:35,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-19 18:04:35,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.10 06:04:34" (1/2) ... [2022-10-19 18:04:35,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcb20e6 and model type singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 06:04:35, skipping insertion in model container [2022-10-19 18:04:35,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:04:35" (2/2) ... [2022-10-19 18:04:35,100 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.line721.bpl [2022-10-19 18:04:35,106 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-19 18:04:35,112 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-19 18:04:35,112 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-19 18:04:35,112 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-19 18:04:35,299 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2022-10-19 18:04:35,349 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-19 18:04:35,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-19 18:04:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-19 18:04:35,360 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) [2022-10-19 18:04:35,364 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 [2022-10-19 18:04:35,390 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-19 18:04:35,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-19 18:04:35,402 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;@16040865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-19 18:04:35,402 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-19 18:04:35,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-19 18:04:35,865 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-19 18:04:35,866 INFO L307 ceAbstractionStarter]: Result for error location thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/12) [2022-10-19 18:04:35,886 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-19 18:04:35,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-19 18:04:35,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-19 18:04:35,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-19 18:04:35,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-19 18:04:35,899 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-19 18:04:35,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-19 18:04:35,900 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;@16040865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-19 18:04:35,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-19 18:04:35,900 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-19 18:04:35,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-19 18:04:35,901 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-19 18:04:35,901 INFO L307 ceAbstractionStarter]: Result for error location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/12) [2022-10-19 18:04:35,908 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-19 18:04:35,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-19 18:04:35,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-19 18:04:35,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-19 18:04:35,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-19 18:04:35,919 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-19 18:04:35,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-19 18:04:35,920 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;@16040865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-19 18:04:35,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-19 18:04:36,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-19 18:04:36,180 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-19 18:04:36,181 INFO L307 ceAbstractionStarter]: Result for error location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/12) [2022-10-19 18:04:36,189 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-19 18:04:36,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-19 18:04:36,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-19 18:04:36,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-19 18:04:36,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-10-19 18:04:36,239 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-19 18:04:36,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-19 18:04:36,240 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;@16040865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-19 18:04:36,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-19 18:04:36,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-19 18:04:36,462 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-19 18:04:36,463 INFO L307 ceAbstractionStarter]: Result for error location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (4/12) [2022-10-19 18:04:36,467 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-19 18:04:36,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-19 18:04:36,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-19 18:04:36,469 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-19 18:04:36,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2022-10-19 18:04:36,475 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-19 18:04:36,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-19 18:04:36,476 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;@16040865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-19 18:04:36,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-19 18:04:36,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-19 18:04:36,701 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-19 18:04:36,701 INFO L307 ceAbstractionStarter]: Result for error location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (5/12) [2022-10-19 18:04:36,707 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-19 18:04:36,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-19 18:04:36,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-19 18:04:36,709 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-19 18:04:36,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2022-10-19 18:04:36,714 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-19 18:04:36,714 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-19 18:04:36,714 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;@16040865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-19 18:04:36,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-19 18:04:36,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-19 18:04:36,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-19 18:04:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash -376916488, now seen corresponding path program 1 times [2022-10-19 18:04:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-19 18:04:36,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913099493] [2022-10-19 18:04:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-19 18:04:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-19 18:04:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-19 18:04:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-19 18:04:37,053 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-19 18:04:37,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913099493] [2022-10-19 18:04:37,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913099493] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-19 18:04:37,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-19 18:04:37,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-19 18:04:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760995655] [2022-10-19 18:04:37,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-19 18:04:37,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-19 18:04:37,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-19 18:04:37,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-19 18:04:37,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-19 18:04:37,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-19 18:04:37,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-19 18:04:37,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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) [2022-10-19 18:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-19 18:04:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-19 18:04:37,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-19 18:04:37,118 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-19 18:04:37,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-19 18:04:37,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1374411925, now seen corresponding path program 1 times [2022-10-19 18:04:37,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-19 18:04:37,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23709613] [2022-10-19 18:04:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-19 18:04:37,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-19 18:04:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-19 18:04:37,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-19 18:04:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-19 18:04:37,252 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2022-10-19 18:04:37,252 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-19 18:04:37,253 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-19 18:04:37,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-19 18:04:37,253 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-10-19 18:04:37,253 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was UNSAFE (6/12) [2022-10-19 18:04:37,256 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-19 18:04:37,256 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-19 18:04:37,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,300 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,301 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,302 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,302 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,302 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,305 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,305 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,305 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,305 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,306 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,307 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,308 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,308 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,309 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,313 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,313 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-19 18:04:37,346 INFO L202 PluginConnector]: Adding new model singleton_with-uninit-problems.line721.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 06:04:37 BasicIcfg [2022-10-19 18:04:37,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-19 18:04:37,347 INFO L158 Benchmark]: Toolchain (without parser) took 3077.50ms. Allocated memory was 185.6MB in the beginning and 314.6MB in the end (delta: 129.0MB). Free memory was 162.2MB in the beginning and 250.9MB in the end (delta: -88.7MB). Peak memory consumption was 40.6MB. Max. memory is 8.0GB. [2022-10-19 18:04:37,348 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.58ms. Allocated memory is still 185.6MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-19 18:04:37,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.94ms. Allocated memory is still 185.6MB. Free memory was 162.1MB in the beginning and 160.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-19 18:04:37,350 INFO L158 Benchmark]: Boogie Preprocessor took 62.99ms. Allocated memory is still 185.6MB. Free memory was 160.4MB in the beginning and 158.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-19 18:04:37,350 INFO L158 Benchmark]: RCFGBuilder took 707.57ms. Allocated memory is still 185.6MB. Free memory was 158.2MB in the beginning and 160.7MB in the end (delta: -2.4MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. [2022-10-19 18:04:37,351 INFO L158 Benchmark]: TraceAbstraction took 2251.49ms. Allocated memory was 185.6MB in the beginning and 314.6MB in the end (delta: 129.0MB). Free memory was 160.1MB in the beginning and 250.9MB in the end (delta: -90.8MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-10-19 18:04:37,352 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.58ms. Allocated memory is still 185.6MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.94ms. Allocated memory is still 185.6MB. Free memory was 162.1MB in the beginning and 160.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.99ms. Allocated memory is still 185.6MB. Free memory was 160.4MB in the beginning and 158.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 707.57ms. Allocated memory is still 185.6MB. Free memory was 158.2MB in the beginning and 160.7MB in the end (delta: -2.4MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2251.49ms. Allocated memory was 185.6MB in the beginning and 314.6MB in the end (delta: 129.0MB). Free memory was 160.1MB in the beginning and 250.9MB in the end (delta: -90.8MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6142, positive: 6034, positive conditional: 6034, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6142, positive: 6034, positive conditional: 6034, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6125, positive: 6034, positive conditional: 0, positive unconditional: 6034, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1440, positive: 1413, positive conditional: 0, positive unconditional: 1413, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6125, positive: 4621, positive conditional: 0, positive unconditional: 4621, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 1440, unknown conditional: 0, unknown unconditional: 1440] , Statistics on independence cache: Total cache size (in pairs): 1440, Positive cache size: 1413, Positive conditional cache size: 0, Positive unconditional cache size: 1413, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6142, positive: 6034, positive conditional: 6034, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6142, positive: 6034, positive conditional: 6034, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6125, positive: 6034, positive conditional: 0, positive unconditional: 6034, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1440, positive: 1413, positive conditional: 0, positive unconditional: 1413, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6125, positive: 4621, positive conditional: 0, positive unconditional: 4621, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 1440, unknown conditional: 0, unknown unconditional: 1440] , Statistics on independence cache: Total cache size (in pairs): 1440, Positive cache size: 1413, Positive conditional cache size: 0, Positive unconditional cache size: 1413, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6142, positive: 6034, positive conditional: 6034, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6142, positive: 6034, positive conditional: 6034, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6125, positive: 6034, positive conditional: 0, positive unconditional: 6034, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1440, positive: 1413, positive conditional: 0, positive unconditional: 1413, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6125, positive: 4621, positive conditional: 0, positive unconditional: 4621, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 1440, unknown conditional: 0, unknown unconditional: 1440] , Statistics on independence cache: Total cache size (in pairs): 1440, Positive cache size: 1413, Positive conditional cache size: 0, Positive unconditional cache size: 1413, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6142, positive: 6034, positive conditional: 6034, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6142, positive: 6034, positive conditional: 6034, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6125, positive: 6034, positive conditional: 0, positive unconditional: 6034, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1440, positive: 1413, positive conditional: 0, positive unconditional: 1413, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6125, positive: 4621, positive conditional: 0, positive unconditional: 4621, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 1440, unknown conditional: 0, unknown unconditional: 1440] , Statistics on independence cache: Total cache size (in pairs): 1440, Positive cache size: 1413, Positive conditional cache size: 0, Positive unconditional cache size: 1413, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 21, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 16, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 21, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 0, Statistics for Abstraction: - CounterExampleResult [Line: 721]: assertion can be violated assertion can be violated We found a FailurePath: [L663] 0 assume { :begin_inline_ULTIMATE.init } true; [L664] 0 #NULL := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0] [L665] 0 assume 0 == #valid[0]; VAL [#NULL!base=0, #NULL!offset=0] [L666] 0 assume 0 < #StackHeapBarrier; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2] [L667] 0 assume { :begin_inline_#Ultimate.allocInit } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2] [L668] 0 #Ultimate.allocInit_~size#1, #Ultimate.allocInit_ptrBase#1 := 2, 1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2] [L669] 0 assume 1 == #valid[#Ultimate.allocInit_ptrBase#1]; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2] [L670] 0 assume #length[#Ultimate.allocInit_ptrBase#1] == #Ultimate.allocInit_~size#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2] [L671] 0 assume { :end_inline_#Ultimate.allocInit } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2] [L672] 0 assume { :begin_inline_write~init~int } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2] [L673] 0 write~init~int_#value#1, write~init~int_#ptr#1, write~init~int_#sizeOfWrittenType#1 := 48, { base: 1, offset: 0 }, 1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=0, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=48] [L674] 0 assume #memory_int[write~init~int_#ptr#1] == write~init~int_#value#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=0, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=48] [L675] 0 assume { :end_inline_write~init~int } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=0, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=48] [L676] 0 assume { :begin_inline_write~init~int } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=0, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=48] [L677] 0 write~init~int_#value#1, write~init~int_#ptr#1, write~init~int_#sizeOfWrittenType#1 := 0, { base: 1, offset: 1 }, 1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0] [L678] 0 assume #memory_int[write~init~int_#ptr#1] == write~init~int_#value#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0] [L679] 0 assume { :end_inline_write~init~int } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0] [L680] 0 assume { :begin_inline_#Ultimate.allocInit } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=2, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0] [L681] 0 #Ultimate.allocInit_~size#1, #Ultimate.allocInit_ptrBase#1 := 33, 2; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0] [L682] 0 assume 1 == #valid[#Ultimate.allocInit_ptrBase#1]; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0] [L683] 0 assume #length[#Ultimate.allocInit_ptrBase#1] == #Ultimate.allocInit_~size#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0] [L684] 0 assume { :end_inline_#Ultimate.allocInit } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0] [L685] 0 ~v~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L687] 0 assume { :end_inline_ULTIMATE.init } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L688] 0 assume { :begin_inline_main } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L689] 0 havoc main_#res#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L690] 0 havoc main_#t~pre20#1, main_#t~nondet21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, main_~#t~0#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L691] 0 #Ultimate.allocOnStack_old_#length#1, #Ultimate.allocOnStack_old_#valid#1 := #length, #valid; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L692] 0 assume { :begin_inline_#Ultimate.allocOnStack } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L693] 0 #Ultimate.allocOnStack_~size#1 := 4; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_~size#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L694] 0 havoc #Ultimate.allocOnStack_#res#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_~size#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L695] 0 havoc #valid, #length; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_~size#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L696] 0 assume 0 == #Ultimate.allocOnStack_old_#valid#1[#Ultimate.allocOnStack_#res#1!base]; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_~size#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L697] 0 assume #valid == #Ultimate.allocOnStack_old_#valid#1[#Ultimate.allocOnStack_#res#1!base := 1]; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_~size#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L698] 0 assume 0 == #Ultimate.allocOnStack_#res#1!offset; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L699] 0 assume 0 != #Ultimate.allocOnStack_#res#1!base; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L700] 0 assume #StackHeapBarrier < #Ultimate.allocOnStack_#res#1!base; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L701] 0 assume #length == #Ultimate.allocOnStack_old_#length#1[#Ultimate.allocOnStack_#res#1!base := #Ultimate.allocOnStack_~size#1]; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L702] 0 main_~#t~0#1 := #Ultimate.allocOnStack_#res#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L703] 0 assume { :end_inline_#Ultimate.allocOnStack } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L704] 0 main_#t~pre20#1 := #pthreadsForks; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=-1, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L705] 0 #pthreadsForks := 1 + #pthreadsForks; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L706] 0 write~int_old_#memory_int#1 := #memory_int; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L707] 0 assume { :begin_inline_write~int } true; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, ~v~0!base=0, ~v~0!offset=0] [L708] 0 write~int_#value#1, write~int_#ptr#1, write~int_#sizeOfWrittenType#1 := main_#t~pre20#1, main_~#t~0#1, 4; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L711] 0 assume 1 == #valid[write~int_#ptr#1!base]; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L712] 0 assume write~int_#sizeOfWrittenType#1 + write~int_#ptr#1!offset <= #length[write~int_#ptr#1!base] && 0 <= write~int_#ptr#1!offset; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L713] 0 havoc #memory_int; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L714] 0 assume #memory_int == write~int_old_#memory_int#1[write~int_#ptr#1 := write~int_#value#1]; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L715] 0 assume { :end_inline_write~int } true; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L716] FORK 0 fork main_#t~pre20#1, 0, 0, 0, 0, 0, 0 thread0({ base: 0, offset: 0 }); VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_#t~pre20#1=-1, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L717] 0 havoc main_#t~pre20#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L718] 0 havoc main_#t~nondet21#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L719] 0 assume { :begin_inline_read~int } true; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L720] 0 read~int_#ptr#1, read~int_#sizeOfReadType#1 := main_~#t~0#1, 4; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, read~int_#ptr#1!base=3, read~int_#ptr#1!offset=0, read~int_#sizeOfReadType#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~v~0!base=0, ~v~0!offset=0] [L278] 1 ~arg#1 := #in~arg#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, read~int_#ptr#1!base=3, read~int_#ptr#1!offset=0, read~int_#sizeOfReadType#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~arg#1!base=0, ~arg#1!offset=0, ~v~0!base=0, ~v~0!offset=0] [L279] 1 #Ultimate.allocOnStack_old_#length#1, #Ultimate.allocOnStack_old_#valid#1 := #length, #valid; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, read~int_#ptr#1!base=3, read~int_#ptr#1!offset=0, read~int_#sizeOfReadType#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~arg#1!base=0, ~arg#1!offset=0, ~v~0!base=0, ~v~0!offset=0] [L280] 1 assume { :begin_inline_#Ultimate.allocOnStack } true; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, read~int_#ptr#1!base=3, read~int_#ptr#1!offset=0, read~int_#sizeOfReadType#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~arg#1!base=0, ~arg#1!offset=0, ~v~0!base=0, ~v~0!offset=0] [L281] 1 #Ultimate.allocOnStack_~size#1 := 4; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, read~int_#ptr#1!base=3, read~int_#ptr#1!offset=0, read~int_#sizeOfReadType#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~arg#1!base=0, ~arg#1!offset=0, ~v~0!base=0, ~v~0!offset=0] [L282] 1 havoc #Ultimate.allocOnStack_#res#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, read~int_#ptr#1!base=3, read~int_#ptr#1!offset=0, read~int_#sizeOfReadType#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~arg#1!base=0, ~arg#1!offset=0, ~v~0!base=0, ~v~0!offset=0] [L283] 1 havoc #valid, #length; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, read~int_#ptr#1!base=3, read~int_#ptr#1!offset=0, read~int_#sizeOfReadType#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~arg#1!base=0, ~arg#1!offset=0, ~v~0!base=0, ~v~0!offset=0] [L721] 0 assert 1 == #valid[read~int_#ptr#1!base]; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=2, #Ultimate.allocInit_ptrBase#1=2, #Ultimate.allocInit_~size#1=33, #Ultimate.allocOnStack_#res#1.base=3, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, #Ultimate.allocOnStack_~size#1=4, main_~#t~0#1!base=3, main_~#t~0#1!offset=0, read~int_#ptr#1!base=3, read~int_#ptr#1!offset=0, read~int_#sizeOfReadType#1=4, write~init~int_#ptr#1!base=1, write~init~int_#ptr#1!offset=1, write~init~int_#sizeOfWrittenType#1=1, write~init~int_#value#1=0, write~int_#ptr#1!base=3, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~arg#1!base=0, ~arg#1!offset=0, ~v~0!base=0, ~v~0!offset=0] - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: thread0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 11 procedures, 690 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 11 procedures, 690 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 11 procedures, 690 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 11 procedures, 690 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 11 procedures, 690 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 11 procedures, 690 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-19 18:04:37,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2022-10-19 18:04:37,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2022-10-19 18:04:37,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2022-10-19 18:04:38,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-10-19 18:04:38,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-10-19 18:04:38,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-10-19 18:04:38,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...