java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 14:50:26,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 14:50:26,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 14:50:26,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 14:50:26,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 14:50:26,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 14:50:26,842 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 14:50:26,844 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 14:50:26,851 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 14:50:26,852 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 14:50:26,853 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 14:50:26,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 14:50:26,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 14:50:26,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 14:50:26,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 14:50:26,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 14:50:26,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 14:50:26,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 14:50:26,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 14:50:26,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 14:50:26,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 14:50:26,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 14:50:26,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 14:50:26,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 14:50:26,868 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 14:50:26,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 14:50:26,870 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 14:50:26,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 14:50:26,871 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 14:50:26,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 14:50:26,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 14:50:26,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 14:50:26,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 14:50:26,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 14:50:26,874 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 14:50:26,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 14:50:26,876 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-18 14:50:26,899 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 14:50:26,899 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 14:50:26,900 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 14:50:26,900 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 14:50:26,900 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 14:50:26,900 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 14:50:26,900 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 14:50:26,902 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 14:50:26,902 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 14:50:26,902 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 14:50:26,902 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 14:50:26,902 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 14:50:26,903 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 14:50:26,903 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 14:50:26,903 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 14:50:26,904 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 14:50:26,904 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 14:50:26,904 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 14:50:26,904 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 14:50:26,904 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 14:50:26,905 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 14:50:26,905 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 14:50:26,905 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 14:50:26,905 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 14:50:26,905 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 14:50:26,906 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 14:50:26,908 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 14:50:26,908 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 14:50:26,908 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 14:50:26,908 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 14:50:26,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 14:50:26,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 14:50:26,909 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 14:50:26,909 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 14:50:26,910 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 14:50:26,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 14:50:26,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 14:50:26,910 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 14:50:26,910 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 14:50:26,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 14:50:26,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 14:50:26,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 14:50:26,974 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 14:50:26,974 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 14:50:26,975 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-01-18 14:50:26,976 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-01-18 14:50:27,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 14:50:27,029 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 14:50:27,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 14:50:27,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 14:50:27,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 14:50:27,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... [2019-01-18 14:50:27,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... [2019-01-18 14:50:27,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 14:50:27,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 14:50:27,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 14:50:27,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 14:50:27,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... [2019-01-18 14:50:27,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... [2019-01-18 14:50:27,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... [2019-01-18 14:50:27,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... [2019-01-18 14:50:27,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... [2019-01-18 14:50:27,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... [2019-01-18 14:50:27,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... [2019-01-18 14:50:27,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 14:50:27,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 14:50:27,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 14:50:27,106 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 14:50:27,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 14:50:27,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 14:50:27,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 14:50:27,663 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 14:50:27,663 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-18 14:50:27,664 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:50:27 BoogieIcfgContainer [2019-01-18 14:50:27,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 14:50:27,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 14:50:27,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 14:50:27,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 14:50:27,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:50:27" (1/2) ... [2019-01-18 14:50:27,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35507009 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:50:27, skipping insertion in model container [2019-01-18 14:50:27,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:50:27" (2/2) ... [2019-01-18 14:50:27,671 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-01-18 14:50:27,681 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 14:50:27,690 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-18 14:50:27,706 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-18 14:50:27,737 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 14:50:27,737 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 14:50:27,737 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 14:50:27,737 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 14:50:27,738 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 14:50:27,738 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 14:50:27,738 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 14:50:27,738 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 14:50:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-18 14:50:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 14:50:27,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:50:27,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 14:50:27,763 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:50:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:50:27,768 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-18 14:50:27,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:50:27,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:50:27,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:50:27,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:50:27,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:50:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:50:27,956 INFO L273 TraceCheckUtils]: 0: Hoare triple {12#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-18 14:50:27,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {13#false} is VALID [2019-01-18 14:50:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:50:27,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 14:50:27,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 14:50:27,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:50:27,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 14:50:27,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:50:27,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-18 14:50:27,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:50:27,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 14:50:28,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 14:50:28,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 14:50:28,008 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-18 14:50:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:50:28,298 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-18 14:50:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 14:50:28,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 14:50:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:50:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:50:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-18 14:50:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:50:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-18 14:50:28,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2019-01-18 14:50:28,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:50:28,451 INFO L225 Difference]: With dead ends: 17 [2019-01-18 14:50:28,451 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 14:50:28,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 14:50:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 14:50:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-18 14:50:28,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:50:28,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2019-01-18 14:50:28,548 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2019-01-18 14:50:28,548 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2019-01-18 14:50:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:50:28,554 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 14:50:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-18 14:50:28,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:50:28,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:50:28,555 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2019-01-18 14:50:28,555 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2019-01-18 14:50:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:50:28,559 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 14:50:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-18 14:50:28,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:50:28,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:50:28,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:50:28,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:50:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:50:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-18 14:50:28,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-18 14:50:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:50:28,569 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-18 14:50:28,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 14:50:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-18 14:50:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 14:50:28,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:50:28,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 14:50:28,571 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:50:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:50:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-18 14:50:28,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:50:28,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:50:28,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:50:28,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:50:28,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:50:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:50:28,628 INFO L273 TraceCheckUtils]: 0: Hoare triple {70#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-18 14:50:28,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-18 14:50:28,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {71#false} is VALID [2019-01-18 14:50:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:50:28,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 14:50:28,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 14:50:28,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:50:28,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 14:50:28,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:50:28,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-18 14:50:28,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:50:28,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 14:50:28,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 14:50:28,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 14:50:28,678 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-18 14:50:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:50:28,771 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 14:50:28,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 14:50:28,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 14:50:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:50:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:50:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-18 14:50:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:50:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-18 14:50:28,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-18 14:50:28,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:50:28,807 INFO L225 Difference]: With dead ends: 12 [2019-01-18 14:50:28,807 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 14:50:28,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 14:50:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 14:50:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-18 14:50:28,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:50:28,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 9 states. [2019-01-18 14:50:28,819 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 9 states. [2019-01-18 14:50:28,819 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 9 states. [2019-01-18 14:50:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:50:28,821 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-18 14:50:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-18 14:50:28,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:50:28,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:50:28,822 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states. [2019-01-18 14:50:28,822 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states. [2019-01-18 14:50:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:50:28,826 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-18 14:50:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-18 14:50:28,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:50:28,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:50:28,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:50:28,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:50:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 14:50:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-18 14:50:28,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-18 14:50:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:50:28,830 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-18 14:50:28,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 14:50:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-18 14:50:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 14:50:28,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:50:28,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 14:50:28,831 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:50:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:50:28,832 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-18 14:50:28,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:50:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:50:28,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:50:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:50:28,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:50:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:50:29,002 INFO L273 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {124#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-18 14:50:29,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {124#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-18 14:50:29,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {123#false} is VALID [2019-01-18 14:50:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:50:29,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:50:29,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:50:29,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 14:50:29,007 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-18 14:50:29,078 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 14:50:29,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:50:33,807 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-18 14:50:33,808 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-18 14:50:33,809 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-18 14:50:33,810 WARN L223 ngHoareTripleChecker]: -- [2019-01-18 14:50:33,810 WARN L224 ngHoareTripleChecker]: Pre: {2147483645#(forall ((v_idx_25 Int) (v_idx_26 Int) (v_idx_23 Int) (v_idx_34 Int) (v_idx_24 Int) (v_idx_35 Int) (v_idx_21 Int) (v_idx_32 Int) (v_idx_22 Int) (v_idx_33 Int) (v_idx_30 Int) (v_idx_31 Int) (v_idx_29 Int) (v_idx_27 Int) (v_idx_28 Int)) (exists ((v_v_35_1 Int) (v_v_34_1 Int) (v_v_32_1 Int) (v_v_43_1 Int) (v_v_41_1 Int) (v_v_2_1 Int) (v_v_4_1 Int) (v_v_28_1 Int) (v_v_26_1 Int) (v_v_38_1 Int)) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p3) (- 1)) (or (< v_idx_26 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_26) (= (select |c_#valid| v_idx_26) 1)) (or (= (select |c_#memory_int| v_idx_33) v_v_41_1) (<= c_ULTIMATE.start_malloc_ptr v_idx_33) (< v_idx_33 (+ c_ULTIMATE.start_main_p2 1))) (or (= (select |c_#memory_int| v_idx_34) 0) (< v_idx_34 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_34)) (= v_v_2_1 (select |c_old(#valid)| v_idx_24)) (or (<= c_ULTIMATE.start_malloc_ptr v_idx_21) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_21) v_v_26_1)) (or (< v_idx_30 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_30) 0) (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_30)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) 0) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p2) (- 1)) (or (<= c_ULTIMATE.start_malloc_ptr v_idx_25) (= (select |c_#valid| v_idx_25) v_v_32_1)) (or (= (select |c_#valid| v_idx_27) v_v_34_1) (< v_idx_27 (+ c_ULTIMATE.start_main_p3 1))) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p3) (- 2)) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_31 (+ c_ULTIMATE.start_main_p1 1)) (<= c_ULTIMATE.start_main_p2 v_idx_31) (= (select |c_#memory_int| v_idx_31) v_v_38_1)) (= (select |c_old(#memory_int)| v_idx_28) v_v_4_1) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_main_p3) (or (< v_idx_35 (+ c_ULTIMATE.start_main_p3 1)) (= (select |c_#memory_int| v_idx_35) v_v_43_1)) (<= (- (- c_ULTIMATE.start_main_p3) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_22)) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_22) (< v_idx_22 c_ULTIMATE.start_malloc_ptr)) (or (< v_idx_32 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p2 1) v_idx_32) (= (select |c_#memory_int| v_idx_32) 0)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_23) v_v_28_1) (< v_idx_23 (+ c_ULTIMATE.start_main_p3 1))) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_29) v_v_35_1) (<= c_ULTIMATE.start_main_p1 v_idx_29)) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) (- 1)) (<= (+ c_ULTIMATE.start_main_p1 1) c_ULTIMATE.start_main_p2))))} [2019-01-18 14:50:33,811 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; [2019-01-18 14:50:33,811 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) [2019-01-18 14:50:33,811 WARN L230 ngHoareTripleChecker]: Post: {2147483644#(forall ((v_idx_47 Int) (v_idx_36 Int) (v_idx_48 Int) (v_idx_37 Int) (v_idx_45 Int) (v_idx_46 Int) (v_idx_43 Int) (v_idx_44 Int) (v_idx_41 Int) (v_idx_42 Int) (v_idx_50 Int) (v_idx_40 Int) (v_idx_49 Int) (v_idx_38 Int) (v_idx_39 Int)) (exists ((v_v_35_1 Int) (v_v_34_1 Int) (v_v_32_1 Int) (v_v_43_1 Int) (v_v_41_1 Int) (v_v_2_1 Int) (v_v_28_1 Int) (v_v_4_1 Int) (v_v_38_1 Int) (v_v_26_1 Int)) (and (or (< v_idx_45 c_ULTIMATE.start_main_p1) (= 1 (select |c_#memory_int| v_idx_45)) (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_45)) (or (<= c_ULTIMATE.start_malloc_ptr v_idx_40) (= (select |c_#valid| v_idx_40) v_v_32_1)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p3) (- 1)) (or (<= c_ULTIMATE.start_main_p1 v_idx_44) (= (select |c_#memory_int| v_idx_44) v_v_35_1)) (or (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_41) (= 1 (select |c_#valid| v_idx_41)) (< v_idx_41 c_ULTIMATE.start_malloc_ptr)) (= v_v_2_1 (select |c_old(#valid)| v_idx_39)) (or (< v_idx_50 (+ c_ULTIMATE.start_main_p3 1)) (= (select |c_#memory_int| v_idx_50) v_v_43_1)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) 0) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_38) v_v_28_1) (< v_idx_38 (+ c_ULTIMATE.start_main_p3 1))) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p2) (- 1)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p3) (- 2)) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (<= (+ c_ULTIMATE.start_main_p2 1) v_idx_47) (< v_idx_47 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_47))) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_43)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_36) v_v_26_1) (<= c_ULTIMATE.start_malloc_ptr v_idx_36)) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_main_p3) (<= (- (- c_ULTIMATE.start_main_p3) (- c_ULTIMATE.start_malloc_ptr)) 0) (or (<= c_ULTIMATE.start_main_p2 v_idx_46) (< v_idx_46 (+ c_ULTIMATE.start_main_p1 1)) (= (select |c_#memory_int| v_idx_46) v_v_38_1)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_48) v_v_41_1) (<= c_ULTIMATE.start_malloc_ptr v_idx_48) (< v_idx_48 (+ c_ULTIMATE.start_main_p2 1))) (or (= (select |c_#valid| v_idx_42) v_v_34_1) (< v_idx_42 (+ c_ULTIMATE.start_main_p3 1))) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_malloc_ptr) (or (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_37) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_37)) (< v_idx_37 c_ULTIMATE.start_malloc_ptr)) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) (- 1)) (<= (+ c_ULTIMATE.start_main_p1 1) c_ULTIMATE.start_main_p2) (or (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_49) (< v_idx_49 c_ULTIMATE.start_malloc_ptr) (= (select |c_#memory_int| v_idx_49) 0)))))} [2019-01-18 14:50:33,812 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-18 14:50:34,472 WARN L268 ngHoareTripleChecker]: -- [2019-01-18 14:50:34,472 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-18 14:50:34,710 WARN L270 ngHoareTripleChecker]: Pre: {2147483645#(and (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (- 2)) (<= ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (- 1)) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) (<= (- (- ULTIMATE.start_main_p3) (- ULTIMATE.start_malloc_ptr)) 0) (forall ((v_idx_30 Int)) (or (< v_idx_30 ULTIMATE.start_main_p1) (= (select |#memory_int| v_idx_30) 0) (<= (+ ULTIMATE.start_main_p1 1) v_idx_30))) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p3) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) 0) (forall ((v_idx_22 Int)) (or (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_22)) (<= (+ ULTIMATE.start_main_p3 1) v_idx_22) (< v_idx_22 ULTIMATE.start_malloc_ptr))) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_malloc_ptr) (forall ((v_idx_26 Int)) (or (< v_idx_26 ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p3 1) v_idx_26) (= (select |#valid| v_idx_26) 1))) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (- 1)) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (- 1)) (forall ((v_idx_32 Int)) (or (< v_idx_32 ULTIMATE.start_main_p2) (<= (+ ULTIMATE.start_main_p2 1) v_idx_32) (= (select |#memory_int| v_idx_32) 0))) (<= (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) (forall ((v_idx_34 Int)) (or (= (select |#memory_int| v_idx_34) 0) (< v_idx_34 ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p3 1) v_idx_34))) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_malloc_ptr) (- 2)))} [2019-01-18 14:50:34,710 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; [2019-01-18 14:50:34,711 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) [2019-01-18 14:50:34,872 WARN L276 ngHoareTripleChecker]: Post: {2147483644#(and (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (- 2)) (<= ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (- 1)) (forall ((v_idx_41 Int)) (or (<= (+ ULTIMATE.start_main_p3 1) v_idx_41) (= 1 (select |#valid| v_idx_41)) (< v_idx_41 ULTIMATE.start_malloc_ptr))) (forall ((v_idx_37 Int)) (or (<= (+ ULTIMATE.start_main_p3 1) v_idx_37) (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_37)) (< v_idx_37 ULTIMATE.start_malloc_ptr))) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) (<= (- (- ULTIMATE.start_main_p3) (- ULTIMATE.start_malloc_ptr)) 0) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p3) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) 0) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_malloc_ptr) (forall ((v_idx_45 Int)) (or (< v_idx_45 ULTIMATE.start_main_p1) (= 1 (select |#memory_int| v_idx_45)) (<= (+ ULTIMATE.start_main_p1 1) v_idx_45))) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (- 1)) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (- 1)) (<= (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) (forall ((v_idx_47 Int)) (or (<= (+ ULTIMATE.start_main_p2 1) v_idx_47) (< v_idx_47 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| v_idx_47)))) (forall ((v_idx_49 Int)) (or (<= (+ ULTIMATE.start_main_p3 1) v_idx_49) (< v_idx_49 ULTIMATE.start_malloc_ptr) (= (select |#memory_int| v_idx_49) 0))) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_malloc_ptr) (- 2)))} [2019-01-18 14:50:40,847 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-18 14:50:40,847 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-18 14:50:40,848 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-18 14:50:40,848 WARN L223 ngHoareTripleChecker]: -- [2019-01-18 14:50:40,848 WARN L224 ngHoareTripleChecker]: Pre: {2147483641#(or (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_78 Int) (v_idx_68 Int) (v_idx_79 Int) (v_idx_76 Int) (v_idx_66 Int) (v_idx_77 Int) (v_idx_74 Int) (v_idx_75 Int) (v_idx_72 Int) (v_idx_73 Int) (v_idx_70 Int) (v_idx_71 Int) (v_idx_80 Int)) (exists ((v_v_35_1 Int) (v_v_34_1 Int) (v_v_32_1 Int) (v_v_43_1 Int) (v_v_41_1 Int) (v_v_2_1 Int) (v_v_28_1 Int) (v_v_4_1 Int) (v_v_38_1 Int) (v_v_26_1 Int)) (and (or (<= c_ULTIMATE.start_malloc_ptr v_idx_66) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_66) v_v_26_1)) (or (= (select |c_#memory_int| v_idx_75) 0) (< v_idx_75 c_ULTIMATE.start_main_p1) (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_75)) (or (< v_idx_76 (+ c_ULTIMATE.start_main_p1 1)) (<= c_ULTIMATE.start_main_p2 v_idx_76) (= (select |c_#memory_int| v_idx_76) v_v_38_1)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p3) (- 1)) (or (< v_idx_71 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_71) (= (select |c_#valid| v_idx_71) 1)) (or (= (select |c_#valid| v_idx_70) v_v_32_1) (<= c_ULTIMATE.start_malloc_ptr v_idx_70)) (or (= (select |c_#valid| v_idx_72) v_v_34_1) (< v_idx_72 (+ c_ULTIMATE.start_main_p3 1))) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) 0) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_68) v_v_28_1) (< v_idx_68 (+ c_ULTIMATE.start_main_p3 1))) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p2) (- 1)) (or (< v_idx_77 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p2 1) v_idx_77) (= (select |c_#memory_int| v_idx_77) 0)) (or (= (select |c_#memory_int| v_idx_74) v_v_35_1) (<= c_ULTIMATE.start_main_p1 v_idx_74)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p3) (- 2)) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_79) (= (select |c_#memory_int| v_idx_79) 0) (< v_idx_79 c_ULTIMATE.start_malloc_ptr)) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_73)) (or (<= c_ULTIMATE.start_malloc_ptr v_idx_78) (< v_idx_78 (+ c_ULTIMATE.start_main_p2 1)) (= (select |c_#memory_int| v_idx_78) v_v_41_1)) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_main_p3) (<= (- (- c_ULTIMATE.start_main_p3) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_67)) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_67) (< v_idx_67 c_ULTIMATE.start_malloc_ptr)) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_80) v_v_43_1) (< v_idx_80 (+ c_ULTIMATE.start_main_p3 1))) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) (- 1)) (<= (+ c_ULTIMATE.start_main_p1 1) c_ULTIMATE.start_main_p2) (= v_v_2_1 (select |c_old(#valid)| v_idx_69))))) (forall ((v_idx_89 Int) (v_idx_87 Int) (v_idx_88 Int) (v_idx_85 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_94 Int) (v_idx_84 Int) (v_idx_95 Int) (v_idx_81 Int) (v_idx_92 Int) (v_idx_82 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int)) (exists ((v_v_35_1 Int) (v_v_34_1 Int) (v_v_43_1 Int) (v_v_32_1 Int) (v_v_41_1 Int) (v_v_2_1 Int) (v_v_4_1 Int) (v_v_28_1 Int) (v_v_38_1 Int) (v_v_26_1 Int)) (and (or (= (select |c_#memory_int| v_idx_89) v_v_35_1) (<= c_ULTIMATE.start_main_p1 v_idx_89)) (or (<= c_ULTIMATE.start_main_p2 v_idx_91) (= (select |c_#memory_int| v_idx_91) v_v_38_1) (< v_idx_91 (+ c_ULTIMATE.start_main_p1 1))) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p3) (- 1)) (or (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_86) (< v_idx_86 c_ULTIMATE.start_malloc_ptr) (= (select |c_#valid| v_idx_86) 1)) (or (< v_idx_93 (+ c_ULTIMATE.start_main_p2 1)) (<= c_ULTIMATE.start_malloc_ptr v_idx_93) (= (select |c_#memory_int| v_idx_93) v_v_41_1)) (or (< v_idx_87 (+ c_ULTIMATE.start_main_p3 1)) (= (select |c_#valid| v_idx_87) v_v_34_1)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) 0) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p2) (- 1)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p3) (- 2)) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_88)) (or (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_94) (< v_idx_94 c_ULTIMATE.start_malloc_ptr) (= (select |c_#memory_int| v_idx_94) 0)) (or (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_82) (< v_idx_82 c_ULTIMATE.start_malloc_ptr) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_82))) (or (<= (+ c_ULTIMATE.start_main_p2 1) v_idx_92) (< v_idx_92 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_92) 0)) (or (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_90) (= (select |c_#memory_int| v_idx_90) 1) (< v_idx_90 c_ULTIMATE.start_main_p1)) (or (= v_v_26_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_81)) (<= c_ULTIMATE.start_malloc_ptr v_idx_81)) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_main_p3) (<= (- (- c_ULTIMATE.start_main_p3) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_95) v_v_43_1) (< v_idx_95 (+ c_ULTIMATE.start_main_p3 1))) (or (= (select |c_#valid| v_idx_85) v_v_32_1) (<= c_ULTIMATE.start_malloc_ptr v_idx_85)) (or (= v_v_28_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83)) (< v_idx_83 (+ c_ULTIMATE.start_main_p3 1))) (= (select |c_old(#valid)| v_idx_84) v_v_2_1) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) (- 1)) (<= (+ c_ULTIMATE.start_main_p1 1) c_ULTIMATE.start_main_p2)))))} [2019-01-18 14:50:40,849 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; [2019-01-18 14:50:40,849 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) [2019-01-18 14:50:40,849 WARN L230 ngHoareTripleChecker]: Post: {2147483640#(or (forall ((v_idx_98 Int) (v_idx_99 Int) (v_idx_96 Int) (v_idx_97 Int) (v_idx_104 Int) (v_idx_105 Int) (v_idx_102 Int) (v_idx_103 Int) (v_idx_108 Int) (v_idx_109 Int) (v_idx_106 Int) (v_idx_107 Int) (v_idx_100 Int) (v_idx_101 Int) (v_idx_110 Int)) (exists ((v_v_35_1 Int) (v_v_34_1 Int) (v_v_43_1 Int) (v_v_32_1 Int) (v_v_41_1 Int) (v_v_2_1 Int) (v_v_4_1 Int) (v_v_28_1 Int) (v_v_38_1 Int) (v_v_26_1 Int)) (and (= v_v_2_1 (select |c_old(#valid)| v_idx_99)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p3) (- 1)) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_103)) (or (= (select |c_#memory_int| v_idx_105) 1) (< v_idx_105 c_ULTIMATE.start_main_p1) (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_105)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) 0) (or (= (select |c_#memory_int| v_idx_108) v_v_41_1) (<= c_ULTIMATE.start_malloc_ptr v_idx_108) (< v_idx_108 (+ c_ULTIMATE.start_main_p2 1))) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p2) (- 1)) (or (= (select |c_#memory_int| v_idx_109) 0) (< v_idx_109 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_109)) (or (<= c_ULTIMATE.start_main_p1 v_idx_104) (= (select |c_#memory_int| v_idx_104) v_v_35_1)) (or (< v_idx_106 (+ c_ULTIMATE.start_main_p1 1)) (<= c_ULTIMATE.start_main_p2 v_idx_106) (= (select |c_#memory_int| v_idx_106) v_v_38_1)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_110) v_v_43_1) (< v_idx_110 (+ c_ULTIMATE.start_main_p3 1))) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p3) (- 2)) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (<= c_ULTIMATE.start_malloc_ptr v_idx_100) (= v_v_32_1 (select |c_#valid| v_idx_100))) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_main_p3) (or (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_97) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_97)) (< v_idx_97 c_ULTIMATE.start_malloc_ptr)) (<= (- (- c_ULTIMATE.start_main_p3) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (< v_idx_98 (+ c_ULTIMATE.start_main_p3 1)) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_98) v_v_28_1)) (or (< v_idx_107 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p2 1) v_idx_107) (= (select |c_#memory_int| v_idx_107) 0)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_96) v_v_26_1) (<= c_ULTIMATE.start_malloc_ptr v_idx_96)) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_malloc_ptr) (or (< v_idx_102 (+ c_ULTIMATE.start_main_p3 1)) (= v_v_34_1 (select |c_#valid| v_idx_102))) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) (- 1)) (<= (+ c_ULTIMATE.start_main_p1 1) c_ULTIMATE.start_main_p2) (or (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_101) (< v_idx_101 c_ULTIMATE.start_malloc_ptr) (= 1 (select |c_#valid| v_idx_101)))))) (forall ((v_idx_115 Int) (v_idx_116 Int) (v_idx_124 Int) (v_idx_113 Int) (v_idx_125 Int) (v_idx_114 Int) (v_idx_119 Int) (v_idx_117 Int) (v_idx_118 Int) (v_idx_122 Int) (v_idx_111 Int) (v_idx_123 Int) (v_idx_112 Int) (v_idx_120 Int) (v_idx_121 Int)) (exists ((v_v_35_1 Int) (v_v_34_1 Int) (v_v_43_1 Int) (v_v_32_1 Int) (v_v_41_1 Int) (v_v_2_1 Int) (v_v_28_1 Int) (v_v_4_1 Int) (v_v_38_1 Int) (v_v_26_1 Int)) (and (or (< v_idx_121 (+ c_ULTIMATE.start_main_p1 1)) (= (select |c_#memory_int| v_idx_121) v_v_38_1) (<= c_ULTIMATE.start_main_p2 v_idx_121)) (or (= 1 (select |c_#valid| v_idx_116)) (< v_idx_116 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_116)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p3) (- 1)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) 0) (or (<= (+ c_ULTIMATE.start_main_p2 1) v_idx_122) (< v_idx_122 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_122) 0)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p2) (- 1)) (or (<= c_ULTIMATE.start_malloc_ptr v_idx_111) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_111) v_v_26_1)) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_112)) (< v_idx_112 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_112)) (or (= (select |c_#memory_int| v_idx_119) v_v_35_1) (<= c_ULTIMATE.start_main_p1 v_idx_119)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p3) (- 2)) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_124 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_124) (= (select |c_#memory_int| v_idx_124) 0)) (or (= v_v_34_1 (select |c_#valid| v_idx_117)) (< v_idx_117 (+ c_ULTIMATE.start_main_p3 1))) (= v_v_2_1 (select |c_old(#valid)| v_idx_114)) (or (= (select |c_#memory_int| v_idx_125) v_v_43_1) (< v_idx_125 (+ c_ULTIMATE.start_main_p3 1))) (or (< v_idx_113 (+ c_ULTIMATE.start_main_p3 1)) (= v_v_28_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_113))) (= (select |c_old(#memory_int)| v_idx_118) v_v_4_1) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_main_p3) (or (<= c_ULTIMATE.start_malloc_ptr v_idx_115) (= v_v_32_1 (select |c_#valid| v_idx_115))) (<= (- (- c_ULTIMATE.start_main_p3) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_120) 2) (< v_idx_120 c_ULTIMATE.start_main_p1) (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_120)) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) (- 1)) (or (< v_idx_123 (+ c_ULTIMATE.start_main_p2 1)) (<= c_ULTIMATE.start_malloc_ptr v_idx_123) (= (select |c_#memory_int| v_idx_123) v_v_41_1)) (<= (+ c_ULTIMATE.start_main_p1 1) c_ULTIMATE.start_main_p2)))))} [2019-01-18 14:50:40,849 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-18 14:50:41,424 WARN L268 ngHoareTripleChecker]: -- [2019-01-18 14:50:41,425 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-18 14:50:48,489 WARN L181 SmtUtils]: Spent 7.06 s on a formula simplification that was a NOOP. DAG size: 214 [2019-01-18 14:50:48,490 WARN L270 ngHoareTripleChecker]: Pre: {2147483641#(or (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_78 Int) (v_idx_68 Int) (v_idx_79 Int) (v_idx_76 Int) (v_idx_66 Int) (v_idx_77 Int) (v_idx_74 Int) (v_idx_75 Int) (v_idx_72 Int) (v_idx_73 Int) (v_idx_70 Int) (v_idx_71 Int) (v_idx_80 Int)) (exists ((v_v_35_1 Int) (v_v_34_1 Int) (v_v_32_1 Int) (v_v_43_1 Int) (v_v_41_1 Int) (v_v_2_1 Int) (v_v_28_1 Int) (v_v_4_1 Int) (v_v_38_1 Int) (v_v_26_1 Int)) (and (or (<= ULTIMATE.start_malloc_ptr v_idx_66) (= (select |ULTIMATE.start_malloc_old_#valid| v_idx_66) v_v_26_1)) (or (= (select |#memory_int| v_idx_75) 0) (< v_idx_75 ULTIMATE.start_main_p1) (<= (+ ULTIMATE.start_main_p1 1) v_idx_75)) (or (< v_idx_76 (+ ULTIMATE.start_main_p1 1)) (<= ULTIMATE.start_main_p2 v_idx_76) (= (select |#memory_int| v_idx_76) v_v_38_1)) (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (- 1)) (or (< v_idx_71 ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p3 1) v_idx_71) (= (select |#valid| v_idx_71) 1)) (or (= (select |#valid| v_idx_70) v_v_32_1) (<= ULTIMATE.start_malloc_ptr v_idx_70)) (or (= (select |#valid| v_idx_72) v_v_34_1) (< v_idx_72 (+ ULTIMATE.start_main_p3 1))) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) 0) (or (= (select |ULTIMATE.start_malloc_old_#valid| v_idx_68) v_v_28_1) (< v_idx_68 (+ ULTIMATE.start_main_p3 1))) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (- 1)) (or (< v_idx_77 ULTIMATE.start_main_p2) (<= (+ ULTIMATE.start_main_p2 1) v_idx_77) (= (select |#memory_int| v_idx_77) 0)) (or (= (select |#memory_int| v_idx_74) v_v_35_1) (<= ULTIMATE.start_main_p1 v_idx_74)) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (- 2)) (<= ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) (or (<= (+ ULTIMATE.start_main_p3 1) v_idx_79) (= (select |#memory_int| v_idx_79) 0) (< v_idx_79 ULTIMATE.start_malloc_ptr)) (= v_v_4_1 (select |old(#memory_int)| v_idx_73)) (or (<= ULTIMATE.start_malloc_ptr v_idx_78) (< v_idx_78 (+ ULTIMATE.start_main_p2 1)) (= (select |#memory_int| v_idx_78) v_v_41_1)) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) (<= (- (- ULTIMATE.start_main_p3) (- ULTIMATE.start_malloc_ptr)) 0) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p3) (or (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_67)) (<= (+ ULTIMATE.start_main_p3 1) v_idx_67) (< v_idx_67 ULTIMATE.start_malloc_ptr)) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_malloc_ptr) (or (= (select |#memory_int| v_idx_80) v_v_43_1) (< v_idx_80 (+ ULTIMATE.start_main_p3 1))) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (- 1)) (<= (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) (= v_v_2_1 (select |old(#valid)| v_idx_69))))) (forall ((v_idx_89 Int) (v_idx_87 Int) (v_idx_88 Int) (v_idx_85 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_94 Int) (v_idx_84 Int) (v_idx_95 Int) (v_idx_81 Int) (v_idx_92 Int) (v_idx_82 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int)) (exists ((v_v_35_1 Int) (v_v_34_1 Int) (v_v_43_1 Int) (v_v_32_1 Int) (v_v_41_1 Int) (v_v_2_1 Int) (v_v_4_1 Int) (v_v_28_1 Int) (v_v_38_1 Int) (v_v_26_1 Int)) (and (or (= (select |#memory_int| v_idx_89) v_v_35_1) (<= ULTIMATE.start_main_p1 v_idx_89)) (or (<= ULTIMATE.start_main_p2 v_idx_91) (= (select |#memory_int| v_idx_91) v_v_38_1) (< v_idx_91 (+ ULTIMATE.start_main_p1 1))) (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (- 1)) (or (<= (+ ULTIMATE.start_main_p3 1) v_idx_86) (< v_idx_86 ULTIMATE.start_malloc_ptr) (= (select |#valid| v_idx_86) 1)) (or (< v_idx_93 (+ ULTIMATE.start_main_p2 1)) (<= ULTIMATE.start_malloc_ptr v_idx_93) (= (select |#memory_int| v_idx_93) v_v_41_1)) (or (< v_idx_87 (+ ULTIMATE.start_main_p3 1)) (= (select |#valid| v_idx_87) v_v_34_1)) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) 0) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (- 1)) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (- 2)) (<= ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) (= v_v_4_1 (select |old(#memory_int)| v_idx_88)) (or (<= (+ ULTIMATE.start_main_p3 1) v_idx_94) (< v_idx_94 ULTIMATE.start_malloc_ptr) (= (select |#memory_int| v_idx_94) 0)) (or (<= (+ ULTIMATE.start_main_p3 1) v_idx_82) (< v_idx_82 ULTIMATE.start_malloc_ptr) (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_82))) (or (<= (+ ULTIMATE.start_main_p2 1) v_idx_92) (< v_idx_92 ULTIMATE.start_main_p2) (= (select |#memory_int| v_idx_92) 0)) (or (<= (+ ULTIMATE.start_main_p1 1) v_idx_90) (= (select |#memory_int| v_idx_90) 1) (< v_idx_90 ULTIMATE.start_main_p1)) (or (= v_v_26_1 (select |ULTIMATE.start_malloc_old_#valid| v_idx_81)) (<= ULTIMATE.start_malloc_ptr v_idx_81)) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) (<= (- (- ULTIMATE.start_main_p3) (- ULTIMATE.start_malloc_ptr)) 0) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p3) (or (= (select |#memory_int| v_idx_95) v_v_43_1) (< v_idx_95 (+ ULTIMATE.start_main_p3 1))) (or (= (select |#valid| v_idx_85) v_v_32_1) (<= ULTIMATE.start_malloc_ptr v_idx_85)) (or (= v_v_28_1 (select |ULTIMATE.start_malloc_old_#valid| v_idx_83)) (< v_idx_83 (+ ULTIMATE.start_main_p3 1))) (= (select |old(#valid)| v_idx_84) v_v_2_1) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (- 1)) (<= (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2)))))} [2019-01-18 14:50:48,490 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; [2019-01-18 14:50:48,490 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) [2019-01-18 14:50:54,262 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-18 14:50:54,265 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.toStringSimplified(DebuggingHoareTripleChecker.java:313) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.logUnsoundness(DebuggingHoareTripleChecker.java:276) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.checkValidity(DebuggingHoareTripleChecker.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.checkValidity(DebuggingHoareTripleChecker.java:179) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.checkInternal(DebuggingHoareTripleChecker.java:139) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.rcfg.RcfgDebugHelper.isPostSound(RcfgDebugHelper.java:80) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.rcfg.RcfgDebugHelper.isPostSound(RcfgDebugHelper.java:62) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.rcfg.RcfgDebugHelper.isPostSound(RcfgDebugHelper.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.assertIsPostSound(FixpointEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:254) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:382) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 50 more [2019-01-18 14:50:54,271 INFO L168 Benchmark]: Toolchain (without parser) took 27241.08 ms. Allocated memory was 134.2 MB in the beginning and 316.7 MB in the end (delta: 182.5 MB). Free memory was 107.8 MB in the beginning and 229.4 MB in the end (delta: -121.5 MB). Peak memory consumption was 205.6 MB. Max. memory is 7.1 GB. [2019-01-18 14:50:54,274 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 134.2 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 14:50:54,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.27 ms. Allocated memory is still 134.2 MB. Free memory was 107.8 MB in the beginning and 105.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-18 14:50:54,275 INFO L168 Benchmark]: Boogie Preprocessor took 21.79 ms. Allocated memory is still 134.2 MB. Free memory was 105.7 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-18 14:50:54,276 INFO L168 Benchmark]: RCFGBuilder took 558.18 ms. Allocated memory is still 134.2 MB. Free memory was 104.5 MB in the beginning and 91.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-01-18 14:50:54,277 INFO L168 Benchmark]: TraceAbstraction took 26603.54 ms. Allocated memory was 134.2 MB in the beginning and 316.7 MB in the end (delta: 182.5 MB). Free memory was 91.4 MB in the beginning and 229.4 MB in the end (delta: -138.0 MB). Peak memory consumption was 189.2 MB. Max. memory is 7.1 GB. [2019-01-18 14:50:54,282 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 134.2 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.27 ms. Allocated memory is still 134.2 MB. Free memory was 107.8 MB in the beginning and 105.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.79 ms. Allocated memory is still 134.2 MB. Free memory was 105.7 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 558.18 ms. Allocated memory is still 134.2 MB. Free memory was 104.5 MB in the beginning and 91.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26603.54 ms. Allocated memory was 134.2 MB in the beginning and 316.7 MB in the end (delta: 182.5 MB). Free memory was 91.4 MB in the beginning and 229.4 MB in the end (delta: -138.0 MB). Peak memory consumption was 189.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...