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-1377b90 [2019-01-07 14:55:38,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:55:38,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:55:38,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:55:38,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:55:38,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:55:38,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:55:38,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:55:38,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:55:38,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:55:38,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:55:38,981 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:55:38,981 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:55:38,982 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:55:38,984 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:55:38,984 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:55:38,985 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:55:38,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:55:38,989 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:55:38,990 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:55:38,991 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:55:38,992 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:55:38,995 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:55:38,995 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:55:38,995 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:55:39,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:55:39,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:55:39,005 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:55:39,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:55:39,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:55:39,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:55:39,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:55:39,008 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:55:39,008 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:55:39,013 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:55:39,014 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:55:39,014 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-07 14:55:39,026 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:55:39,027 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:55:39,028 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:55:39,028 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:55:39,028 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:55:39,028 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:55:39,028 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:55:39,029 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:55:39,029 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:55:39,029 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 14:55:39,029 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 14:55:39,029 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:55:39,029 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:55:39,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:55:39,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:55:39,031 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:55:39,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:55:39,031 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:55:39,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:55:39,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:55:39,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:55:39,032 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:55:39,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:55:39,032 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:55:39,032 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:55:39,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:55:39,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:55:39,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:55:39,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:55:39,034 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:55:39,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:55:39,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:55:39,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:55:39,034 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:55:39,035 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:55:39,035 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:55:39,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:55:39,035 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:55:39,036 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:55:39,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:55:39,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:55:39,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:55:39,098 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:55:39,099 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:55:39,100 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-07 14:55:39,100 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-01-07 14:55:39,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:55:39,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:55:39,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:55:39,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:55:39,145 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:55:39,165 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 07.01 02:55:39" (1/1) ... [2019-01-07 14:55:39,181 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 07.01 02:55:39" (1/1) ... [2019-01-07 14:55:39,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:55:39,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:55:39,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:55:39,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:55:39,230 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 07.01 02:55:39" (1/1) ... [2019-01-07 14:55:39,230 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 07.01 02:55:39" (1/1) ... [2019-01-07 14:55:39,231 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 07.01 02:55:39" (1/1) ... [2019-01-07 14:55:39,232 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 07.01 02:55:39" (1/1) ... [2019-01-07 14:55:39,237 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 07.01 02:55:39" (1/1) ... [2019-01-07 14:55:39,248 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 07.01 02:55:39" (1/1) ... [2019-01-07 14:55:39,251 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 07.01 02:55:39" (1/1) ... [2019-01-07 14:55:39,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:55:39,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:55:39,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:55:39,259 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:55:39,260 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 07.01 02:55:39" (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-07 14:55:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:55:39,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:55:39,877 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:55:39,878 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-07 14:55:39,879 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:55:39 BoogieIcfgContainer [2019-01-07 14:55:39,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:55:39,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:55:39,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:55:39,884 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:55:39,884 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 07.01 02:55:39" (1/2) ... [2019-01-07 14:55:39,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b2562b and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:55:39, skipping insertion in model container [2019-01-07 14:55:39,886 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 07.01 02:55:39" (2/2) ... [2019-01-07 14:55:39,888 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-01-07 14:55:39,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:55:39,906 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-07 14:55:39,926 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-07 14:55:39,961 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:55:39,961 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:55:39,961 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:55:39,961 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:55:39,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:55:39,962 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:55:39,962 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:55:39,962 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:55:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-07 14:55:39,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 14:55:39,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:55:39,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 14:55:39,995 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:55:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:55:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-07 14:55:40,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:55:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:55:40,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:55:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:55:40,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:55:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:55:40,268 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-07 14:55:40,273 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-07 14:55:40,275 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-07 14:55:40,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:55:40,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 14:55:40,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:55:40,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:55:40,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:55:40,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:55:40,312 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-07 14:55:40,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:55:40,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:55:40,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:55:40,324 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-07 14:55:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:55:40,605 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-07 14:55:40,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:55:40,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:55:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:55:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:55:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-07 14:55:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:55:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-07 14:55:40,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2019-01-07 14:55:40,771 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-07 14:55:40,784 INFO L225 Difference]: With dead ends: 17 [2019-01-07 14:55:40,784 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 14:55:40,788 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-07 14:55:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 14:55:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-07 14:55:40,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:55:40,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2019-01-07 14:55:40,864 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2019-01-07 14:55:40,864 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2019-01-07 14:55:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:55:40,867 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-07 14:55:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-07 14:55:40,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:55:40,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:55:40,869 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2019-01-07 14:55:40,869 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2019-01-07 14:55:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:55:40,872 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-07 14:55:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-07 14:55:40,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:55:40,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:55:40,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:55:40,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:55:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 14:55:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-07 14:55:40,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-07 14:55:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:55:40,881 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-07 14:55:40,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:55:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-07 14:55:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:55:40,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:55:40,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:55:40,883 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:55:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:55:40,884 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-07 14:55:40,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:55:40,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:55:40,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:55:40,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:55:40,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:55:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:55:40,994 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-07 14:55:41,001 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-07 14:55:41,003 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-07 14:55:41,004 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-07 14:55:41,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:55:41,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 14:55:41,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:55:41,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:55:41,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:55:41,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:55:41,044 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-07 14:55:41,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:55:41,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:55:41,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:55:41,045 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-07 14:55:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:55:41,144 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-07 14:55:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:55:41,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:55:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:55:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:55:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-07 14:55:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:55:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-07 14:55:41,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-07 14:55:41,195 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-07 14:55:41,196 INFO L225 Difference]: With dead ends: 12 [2019-01-07 14:55:41,196 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 14:55:41,197 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-07 14:55:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 14:55:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-07 14:55:41,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:55:41,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 9 states. [2019-01-07 14:55:41,207 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 9 states. [2019-01-07 14:55:41,207 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 9 states. [2019-01-07 14:55:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:55:41,210 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-07 14:55:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-07 14:55:41,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:55:41,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:55:41,211 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states. [2019-01-07 14:55:41,212 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states. [2019-01-07 14:55:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:55:41,213 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-07 14:55:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-07 14:55:41,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:55:41,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:55:41,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:55:41,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:55:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 14:55:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-07 14:55:41,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-07 14:55:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:55:41,224 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-07 14:55:41,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:55:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-07 14:55:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:55:41,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:55:41,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:55:41,226 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:55:41,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:55:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-07 14:55:41,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:55:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:55:41,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:55:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:55:41,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:55:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:55:41,414 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-07 14:55:41,415 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-07 14:55:41,416 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-07 14:55:41,417 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-07 14:55:41,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:55:41,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:55:41,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 14:55:41,421 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-07 14:55:41,481 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 14:55:41,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:55:45,316 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 14:55:45,317 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 14:55:45,319 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:55:45,320 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:55:45,321 WARN L224 ngHoareTripleChecker]: Pre: {2147483647#(forall ((v_idx_3 Int) (v_idx_4 Int) (v_idx_5 Int) (v_idx_1 Int) (v_idx_2 Int)) (exists ((v_v_0_1 Int) (v_v_1_1 Int) (v_v_2_1 Int) (v_v_3_1 Int) (v_v_4_1 Int)) (and (= (select |c_old(#memory_int)| v_idx_5) v_v_4_1) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1) v_v_0_1) (= v_v_2_1 (select |c_old(#valid)| v_idx_3)) (= v_v_1_1 (select |c_#valid| v_idx_2)) (= v_v_3_1 (select |c_#memory_int| v_idx_4)))))} [2019-01-07 14:55:45,321 WARN L228 ngHoareTripleChecker]: Action: 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]; [2019-01-07 14:55:45,323 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_p3_primed c_ULTIMATE.start_malloc_ptr_primed) (= (store |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed 1) |c_#valid_primed|) (< c_ULTIMATE.start_main_p1_primed c_ULTIMATE.start_main_p2_primed) (= 0 (select (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed)) (= 0 (select |c_#valid| c_ULTIMATE.start_main_p1_primed)) (< c_ULTIMATE.start_main_p2_primed c_ULTIMATE.start_main_p3_primed) (= |c_#memory_int_primed| (store (store (store |c_#memory_int| c_ULTIMATE.start_main_p1_primed 0) c_ULTIMATE.start_main_p2_primed 0) c_ULTIMATE.start_main_p3_primed 0)) (= (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) |c_ULTIMATE.start_malloc_old_#valid_primed|) (= (select |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed) 0)) [2019-01-07 14:55:45,324 WARN L230 ngHoareTripleChecker]: Post: {2147483646#(forall ((v_idx_14 Int) (v_idx_15 Int) (v_idx_12 Int) (v_idx_13 Int) (v_idx_10 Int) (v_idx_11 Int) (v_idx_20 Int) (v_idx_7 Int) (v_idx_8 Int) (v_idx_9 Int) (v_idx_6 Int) (v_idx_18 Int) (v_idx_19 Int) (v_idx_16 Int) (v_idx_17 Int)) (exists ((v_v_36_1 Int) (v_v_35_1 Int) (v_v_34_1 Int) (v_v_33_1 Int) (v_v_32_1 Int) (v_b_19_1 Int) (v_v_39_1 Int) (v_v_38_1 Int) (v_b_23_1 Int) (v_b_22_1 Int) (v_b_21_1 Int) (v_b_20_1 Int) (v_v_43_1 Int) (v_v_42_1 Int) (v_v_41_1 Int) (v_v_28_1 Int) (v_v_26_1 Int) (v_v_27_1 Int) (v_b_12_1 Int) (v_b_13_1 Int) (v_b_16_1 Int) (v_b_18_1 Int) (v_b_17_1 Int) (v_v_2_1 Int) (v_v_4_1 Int)) (and (<= (- c_ULTIMATE.start_main_p1 v_b_22_1) (- 2)) (<= (- (- v_v_27_1) (- v_v_42_1)) 0) (<= (- v_v_27_1 (- v_v_39_1)) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_17_1) (- 1)) (<= (- c_ULTIMATE.start_main_p2 v_b_12_1) (- 1)) (<= (- (- v_b_12_1) (- v_b_22_1)) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_19_1)) (- 1)) (<= (- (- v_v_27_1) v_v_39_1) 0) (= v_v_2_1 (select |c_old(#valid)| v_idx_17)) (<= (- (- v_v_27_1) (- v_v_39_1)) 0) (<= (- (- v_b_16_1) (- v_b_21_1)) 0) (= (+ v_b_21_1 (- 1)) c_ULTIMATE.start_main_p2) (= v_b_18_1 c_ULTIMATE.start_main_p1) (= (+ v_b_21_1 (- 1)) v_b_20_1) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_20_1)) (- 1)) (<= (- v_b_18_1 v_b_22_1) (- 2)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_16_1) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_13_1)) 1) (<= (- c_ULTIMATE.start_main_p1 v_b_19_1) (- 1)) (<= (- v_v_27_1 v_v_33_1) (- 1)) (<= (- c_ULTIMATE.start_main_p1 v_b_13_1) (- 3)) (<= (- c_ULTIMATE.start_main_p2 v_b_23_1) (- 2)) (<= (- (- v_v_36_1) v_v_39_1) 0) (<= (- (- v_v_33_1) (- v_v_42_1)) (- 1)) (<= (- v_b_13_1 v_b_16_1) 1) (= (+ c_ULTIMATE.start_malloc_ptr 1) (+ c_ULTIMATE.start_main_p3 1)) (<= (- v_b_16_1 v_b_23_1) (- 1)) (<= (- v_v_33_1 (- v_v_33_1)) 2) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_21_1)) 1) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_13_1)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_18_1)) (- 2)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_21_1)) 0) (<= (- (- v_v_33_1) v_v_39_1) (- 1)) (<= (- v_b_13_1 v_b_22_1) 1) (= (+ v_b_22_1 1) (+ c_ULTIMATE.start_main_p3 1)) (<= (- v_b_20_1 v_b_22_1) (- 1)) (<= (- (- v_v_27_1) v_v_36_1) 0) (<= (- (- v_b_16_1) (- v_b_20_1)) (- 1)) (= v_b_12_1 c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_main_p3 v_b_23_1) (- 1)) (or (= v_v_28_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_16)) (< v_idx_16 v_b_13_1)) (or (< v_idx_20 v_b_17_1) (= (select |c_#valid| v_idx_20) v_v_34_1)) (<= (- v_v_33_1 v_v_36_1) 1) (<= (- v_v_36_1 v_v_42_1) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_16_1)) 0) (<= (- (- v_b_17_1) (- v_b_21_1)) (- 1)) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_23_1)) 1) (<= (- (- v_b_13_1) (- v_b_16_1)) (- 1)) (<= (- c_ULTIMATE.start_main_p1 v_b_16_1) (- 2)) (or (= (select |c_#memory_int| v_idx_10) v_v_39_1) (<= v_b_21_1 v_idx_10) (< v_idx_10 v_b_20_1)) (<= (- (- v_v_27_1) v_v_42_1) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_20_1)) (- 1)) (= v_b_21_1 (+ v_b_20_1 1)) (= (+ v_b_13_1 (- 1)) c_ULTIMATE.start_main_p3) (= v_b_19_1 (+ c_ULTIMATE.start_main_p1 1)) (<= (- c_ULTIMATE.start_main_p2 v_b_21_1) (- 1)) (<= (- (- v_v_36_1) (- v_v_42_1)) 0) (<= (- (- v_v_33_1) v_v_33_1) (- 2)) (or (= (select |c_#memory_int| v_idx_7) v_v_35_1) (<= v_b_18_1 v_idx_7)) (<= (- c_ULTIMATE.start_main_p1 v_b_21_1) (- 2)) (<= (- v_b_17_1 v_b_23_1) 0) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_15) v_v_27_1) (<= v_b_13_1 v_idx_15) (< v_idx_15 v_b_12_1)) (<= (- (- v_b_12_1) (- v_b_17_1)) 1) (<= (- v_b_16_1 v_b_17_1) (- 1)) (<= (- (- v_b_17_1) (- v_b_20_1)) (- 2)) (<= (- (- v_v_36_1) v_v_42_1) 0) (<= (- v_b_17_1 v_b_22_1) 1) (<= (- (- v_b_12_1) (- v_b_23_1)) 1) (<= (- v_v_39_1 (- v_v_42_1)) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_12_1)) 0) (<= (- c_ULTIMATE.start_main_p1 v_b_18_1) 0) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_18_1)) (- 1)) (<= (- (- v_b_12_1) (- v_b_20_1)) (- 1)) (= (+ v_b_12_1 1) (+ c_ULTIMATE.start_main_p3 1)) (<= (- c_ULTIMATE.start_main_p1 v_b_20_1) (- 1)) (<= (- c_ULTIMATE.start_main_p3 v_b_17_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_17_1)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_19_1)) (- 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_13_1) (- 1)) (<= (- (- v_v_39_1) v_v_39_1) 0) (<= (- c_ULTIMATE.start_main_p3 v_b_22_1) 0) (<= (- v_b_21_1 v_b_23_1) (- 1)) (<= (- v_v_33_1 v_v_39_1) 1) (<= (- (- v_b_17_1) (- v_b_19_1)) (- 2)) (<= (- v_b_20_1 v_b_23_1) (- 2)) (<= (- v_v_27_1 v_v_39_1) 0) (<= (- (- v_v_39_1) (- v_v_42_1)) 0) (<= (- (- v_v_36_1) v_v_36_1) 0) (= (+ v_b_23_1 (- 1)) c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (- 2)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_12_1)) 0) (<= (- v_b_19_1 v_b_21_1) (- 1)) (= v_b_22_1 c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_13) v_v_43_1) (< v_idx_13 v_b_23_1)) (<= (- c_ULTIMATE.start_main_p2 v_b_16_1) (- 1)) (or (= v_v_36_1 (select |c_#memory_int| v_idx_8)) (< v_idx_8 v_b_18_1) (<= v_b_19_1 v_idx_8)) (<= (- (- v_v_33_1) v_v_42_1) (- 1)) (<= (- (- v_v_39_1) v_v_42_1) 0) (<= (- (- v_v_27_1) v_v_33_1) (- 1)) (<= (- v_b_18_1 v_b_21_1) (- 2)) (<= (- (- v_b_22_1) (- v_b_23_1)) 1) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) (- 1)) (= (+ v_b_16_1 1) (+ c_ULTIMATE.start_main_p3 1)) (<= (- (- v_b_18_1) (- v_b_19_1)) 1) (<= (- v_b_22_1 v_b_23_1) (- 1)) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p3) (- 1)) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_18_1)) (- 2)) (<= (- (- v_b_13_1) (- v_b_23_1)) 0) (= (+ v_b_18_1 1) (+ c_ULTIMATE.start_main_p1 1)) (<= (- (- v_b_16_1) (- v_b_22_1)) 0) (<= (- (- c_ULTIMATE.start_main_p1) (- v_b_18_1)) 0) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_20_1)) 0) (<= (- (- v_b_13_1) (- v_b_17_1)) 0) (<= (- v_v_27_1 (- v_v_42_1)) 0) (<= (- v_v_39_1 (- v_v_39_1)) 0) (<= (- v_b_18_1 v_b_20_1) (- 1)) (<= (- v_v_33_1 (- v_v_42_1)) 1) (<= (- (- v_v_42_1) v_v_42_1) 0) (<= (- v_b_19_1 v_b_23_1) (- 2)) (<= (- v_v_33_1 v_v_42_1) 1) (<= (- c_ULTIMATE.start_main_p3 v_b_12_1) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_22_1) (- 1)) (<= (- v_v_36_1 (- v_v_36_1)) 0) (<= (- (- v_b_12_1) (- v_b_18_1)) (- 2)) (<= (- (- v_b_17_1) (- v_b_22_1)) (- 1)) (<= (- c_ULTIMATE.start_main_p3 v_b_16_1) 0) (<= (- v_b_12_1 v_b_16_1) 0) (<= (- c_ULTIMATE.start_main_p1 v_b_12_1) (- 2)) (<= (- v_b_18_1 v_b_23_1) (- 3)) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_22_1)) 0) (<= (- (- v_b_16_1) (- v_b_18_1)) (- 2)) (= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= (- v_v_27_1 (- v_v_27_1)) 0) (<= (- (- v_v_27_1) (- v_v_33_1)) 1) (<= (- (- v_b_12_1) (- v_b_19_1)) (- 1)) (<= (- (- v_b_13_1) (- v_b_21_1)) (- 1)) (<= (- v_v_27_1 v_v_36_1) 0) (<= (- (- v_v_33_1) (- v_v_36_1)) (- 1)) (<= (- v_b_21_1 v_b_22_1) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_20_1) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_21_1)) 0) (= v_b_16_1 c_ULTIMATE.start_main_p3) (<= (- v_b_16_1 v_b_22_1) 0) (<= (- v_b_12_1 v_b_13_1) (- 1)) (or (< v_idx_9 v_b_19_1) (= (select |c_#memory_int| v_idx_9) v_v_38_1) (<= v_b_20_1 v_idx_9)) (<= (- c_ULTIMATE.start_main_p3 v_b_13_1) (- 1)) (<= (- (- v_b_13_1) (- v_b_18_1)) (- 3)) (<= (- v_v_33_1 (- v_v_39_1)) 1) (<= (- (- v_b_20_1) (- v_b_21_1)) 1) (or (<= v_b_22_1 v_idx_11) (= (select |c_#memory_int| v_idx_11) v_v_41_1) (< v_idx_11 v_b_21_1)) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_19_1)) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_17_1)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_23_1)) 1) (<= (- v_v_33_1 (- v_v_36_1)) 1) (<= (- (- v_b_13_1) (- v_b_22_1)) (- 1)) (<= (- (- v_b_16_1) (- v_b_23_1)) 1) (= (select |c_old(#memory_int)| v_idx_6) v_v_4_1) (<= (- v_b_20_1 v_b_21_1) (- 1)) (<= (- (- v_b_13_1) (- v_b_20_1)) (- 2)) (<= (- (- c_ULTIMATE.start_main_p1) (- v_b_19_1)) 1) (<= (- c_ULTIMATE.start_main_p1 v_b_23_1) (- 3)) (= (+ c_ULTIMATE.start_main_p2 1) (+ v_b_20_1 1)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p3) (- 2)) (<= (- v_b_12_1 v_b_23_1) (- 1)) (<= (- v_v_42_1 (- v_v_42_1)) 0) (or (<= v_b_12_1 v_idx_14) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_14) v_v_26_1)) (<= (- v_b_18_1 v_b_19_1) (- 1)) (<= (- v_b_12_1 v_b_17_1) (- 1)) (<= (- (- v_v_36_1) (- v_v_39_1)) 0) (<= (- (- v_b_12_1) (- v_b_21_1)) 0) (<= (- v_v_27_1 v_v_42_1) 0) (<= (- (- v_b_12_1) (- v_b_13_1)) 1) (<= (- (- v_b_17_1) (- v_b_18_1)) (- 3)) (or (<= v_b_16_1 v_idx_18) (= (select |c_#valid| v_idx_18) v_v_32_1)) (or (< v_idx_12 v_b_22_1) (<= v_b_23_1 v_idx_12) (= (select |c_#memory_int| v_idx_12) v_v_42_1)) (<= (- v_b_13_1 v_b_23_1) 0) (<= (- v_v_36_1 (- v_v_42_1)) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_16_1)) 0) (<= (- v_b_12_1 v_b_22_1) 0) (<= (- v_v_39_1 v_v_42_1) 0) (= v_b_17_1 (+ c_ULTIMATE.start_main_p3 1)) (<= (- v_b_19_1 v_b_20_1) 0) (<= (- (- v_b_16_1) (- v_b_19_1)) (- 1)) (= (+ v_b_17_1 (- 1)) c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_malloc_ptr v_b_22_1) 0) (= v_b_23_1 (+ c_ULTIMATE.start_main_p3 1)) (<= (- v_b_13_1 v_b_17_1) 0) (<= (- (- v_b_13_1) (- v_b_19_1)) (- 2)) (<= (- v_b_19_1 v_b_22_1) (- 1)) (= c_ULTIMATE.start_main_p1 (+ v_b_19_1 (- 1))) (or (<= v_b_17_1 v_idx_19) (< v_idx_19 v_b_16_1) (= (select |c_#valid| v_idx_19) v_v_33_1)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p2) (- 1)) (<= (- v_v_36_1 v_v_39_1) 0) (<= (- (- v_b_12_1) (- v_b_16_1)) 0) (<= (- v_v_27_1 (- v_v_36_1)) 0) (<= (- (- v_b_17_1) (- v_b_23_1)) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_23_1) (- 1)) (= v_b_13_1 (+ c_ULTIMATE.start_main_p3 1)) (<= (- v_v_27_1 (- v_v_33_1)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_22_1)) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_17_1) (- 2)) (<= (- (- v_v_27_1) (- v_v_36_1)) 0) (<= (- v_v_36_1 (- v_v_39_1)) 0) (<= (- c_ULTIMATE.start_main_p1 v_b_17_1) (- 3)) (<= (- (- c_ULTIMATE.start_main_p3) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (- (- v_v_33_1) (- v_v_39_1)) (- 1)) (<= (- (- v_v_33_1) v_v_36_1) (- 1)) (<= (- c_ULTIMATE.start_main_p2 v_b_13_1) (- 2)) (<= (- (- v_b_16_1) (- v_b_17_1)) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_12_1) 0) (<= (- (- v_v_27_1) v_v_27_1) 0))))} [2019-01-07 14:55:45,324 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:55:45,491 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:55:45,491 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:55:45,567 WARN L270 ngHoareTripleChecker]: Pre: {2147483647#true} [2019-01-07 14:55:45,567 WARN L274 ngHoareTripleChecker]: Action: 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]; [2019-01-07 14:55:45,568 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_main_p3_primed c_ULTIMATE.start_malloc_ptr_primed) (= (store |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed 1) |c_#valid_primed|) (< c_ULTIMATE.start_main_p1_primed c_ULTIMATE.start_main_p2_primed) (= 0 (select (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed)) (= 0 (select |c_#valid| c_ULTIMATE.start_main_p1_primed)) (< c_ULTIMATE.start_main_p2_primed c_ULTIMATE.start_main_p3_primed) (= |c_#memory_int_primed| (store (store (store |c_#memory_int| c_ULTIMATE.start_main_p1_primed 0) c_ULTIMATE.start_main_p2_primed 0) c_ULTIMATE.start_main_p3_primed 0)) (= (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) |c_ULTIMATE.start_malloc_old_#valid_primed|) (= (select |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed) 0))