java -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-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:24:34,129 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:24:34,131 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:24:34,143 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:24:34,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:24:34,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:24:34,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:24:34,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:24:34,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:24:34,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:24:34,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:24:34,152 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:24:34,153 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:24:34,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:24:34,155 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:24:34,156 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:24:34,157 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:24:34,159 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:24:34,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:24:34,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:24:34,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:24:34,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:24:34,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:24:34,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:24:34,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:24:34,171 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:24:34,172 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:24:34,173 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:24:34,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:24:34,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:24:34,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:24:34,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:24:34,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:24:34,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:24:34,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:24:34,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:24:34,186 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-02-15 11:24:34,213 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:24:34,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:24:34,214 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:24:34,214 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:24:34,215 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:24:34,215 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:24:34,215 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:24:34,215 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:24:34,215 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:24:34,216 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:24:34,216 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:24:34,216 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:24:34,216 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:24:34,217 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:24:34,217 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:24:34,217 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:24:34,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:24:34,218 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:24:34,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:24:34,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:24:34,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:24:34,219 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:24:34,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:24:34,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:24:34,219 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:24:34,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:24:34,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:24:34,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:24:34,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:24:34,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:24:34,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:24:34,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:24:34,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:24:34,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:24:34,221 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:24:34,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:24:34,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:24:34,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:24:34,222 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:24:34,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:24:34,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:24:34,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:24:34,271 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:24:34,272 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:24:34,273 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-02-15 11:24:34,273 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-02-15 11:24:34,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:24:34,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:24:34,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:24:34,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:24:34,319 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:24:34,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/1) ... [2019-02-15 11:24:34,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/1) ... [2019-02-15 11:24:34,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:24:34,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:24:34,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:24:34,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:24:34,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/1) ... [2019-02-15 11:24:34,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/1) ... [2019-02-15 11:24:34,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/1) ... [2019-02-15 11:24:34,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/1) ... [2019-02-15 11:24:34,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/1) ... [2019-02-15 11:24:34,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/1) ... [2019-02-15 11:24:34,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/1) ... [2019-02-15 11:24:34,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:24:34,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:24:34,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:24:34,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:24:34,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (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-02-15 11:24:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:24:34,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:24:34,847 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:24:34,848 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-15 11:24:34,849 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:24:34 BoogieIcfgContainer [2019-02-15 11:24:34,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:24:34,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:24:34,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:24:34,853 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:24:34,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:34" (1/2) ... [2019-02-15 11:24:34,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7ca893 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:24:34, skipping insertion in model container [2019-02-15 11:24:34,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:24:34" (2/2) ... [2019-02-15 11:24:34,857 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-02-15 11:24:34,866 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:24:34,875 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-15 11:24:34,892 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-15 11:24:34,925 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:24:34,926 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:24:34,926 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:24:34,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:24:34,926 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:24:34,926 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:24:34,927 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:24:34,927 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:24:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-15 11:24:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 11:24:34,946 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:34,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 11:24:34,950 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:34,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:34,957 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-15 11:24:34,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:34,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:34,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:34,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:34,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:35,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:24:35,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:24:35,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:24:35,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:24:35,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:24:35,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:24:35,219 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-15 11:24:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:35,421 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-15 11:24:35,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:24:35,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 11:24:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:35,436 INFO L225 Difference]: With dead ends: 21 [2019-02-15 11:24:35,436 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 11:24:35,440 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-02-15 11:24:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 11:24:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-15 11:24:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 11:24:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-15 11:24:35,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-15 11:24:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:35,481 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-15 11:24:35,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:24:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-15 11:24:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:24:35,482 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:35,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:24:35,483 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-15 11:24:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:35,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:35,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:35,804 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-15 11:24:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:35,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:35,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:35,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:24:35,826 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-15 11:24:35,874 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:24:35,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:24:45,232 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:24:45,234 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:24:45,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:45,239 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:24:45,683 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:24:46,065 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:24:46,066 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:24:46,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:24:46,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-15 11:24:46,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:24:46,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:24:46,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:24:46,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:24:46,072 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 3 states. [2019-02-15 11:24:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:48,518 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2019-02-15 11:24:48,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:24:48,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 11:24:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:48,519 INFO L225 Difference]: With dead ends: 18 [2019-02-15 11:24:48,519 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 11:24:48,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:24:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 11:24:48,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-15 11:24:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 11:24:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2019-02-15 11:24:48,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 3 [2019-02-15 11:24:48,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:48,525 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2019-02-15 11:24:48,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:24:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2019-02-15 11:24:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:24:48,526 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:48,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:24:48,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-15 11:24:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:48,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:48,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:48,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:48,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:48,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:24:48,650 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-15 11:24:48,652 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:24:48,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:24:54,009 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:24:54,010 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:24:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:54,010 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:24:54,267 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:24:54,825 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:24:54,825 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:24:54,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:24:54,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-15 11:24:54,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:24:54,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:24:54,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:24:54,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:24:54,827 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2019-02-15 11:24:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:59,174 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2019-02-15 11:24:59,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:24:59,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 11:24:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:59,175 INFO L225 Difference]: With dead ends: 19 [2019-02-15 11:24:59,175 INFO L226 Difference]: Without dead ends: 12 [2019-02-15 11:24:59,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:24:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-15 11:24:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-15 11:24:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 11:24:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2019-02-15 11:24:59,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 3 [2019-02-15 11:24:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:59,181 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 24 transitions. [2019-02-15 11:24:59,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:24:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 24 transitions. [2019-02-15 11:24:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:24:59,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:59,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:24:59,183 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-15 11:24:59,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:59,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:59,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:59,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:59,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:59,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:24:59,280 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-15 11:24:59,281 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:24:59,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:05,895 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:25:05,896 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:25:05,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:05,897 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:25:06,484 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:25:07,530 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:25:07,530 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:25:07,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:25:07,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-15 11:25:07,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:07,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:25:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:25:07,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:07,532 INFO L87 Difference]: Start difference. First operand 12 states and 24 transitions. Second operand 3 states. [2019-02-15 11:25:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:10,862 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2019-02-15 11:25:10,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:10,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 11:25:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:10,863 INFO L225 Difference]: With dead ends: 20 [2019-02-15 11:25:10,863 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 11:25:10,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 11:25:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-15 11:25:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 11:25:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2019-02-15 11:25:10,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 3 [2019-02-15 11:25:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:10,871 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 28 transitions. [2019-02-15 11:25:10,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:25:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2019-02-15 11:25:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:10,871 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:10,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:10,872 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:10,872 INFO L82 PathProgramCache]: Analyzing trace with hash 30244, now seen corresponding path program 1 times [2019-02-15 11:25:10,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:10,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:10,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:10,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:11,149 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-02-15 11:25:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:11,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:11,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:11,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:25:11,156 INFO L207 CegarAbsIntRunner]: [0], [14], [19] [2019-02-15 11:25:11,157 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:11,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:16,188 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:25:16,189 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:25:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:16,189 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:25:16,465 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:25:17,031 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:25:17,032 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:25:17,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:25:17,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-15 11:25:17,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:17,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:25:17,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:25:17,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:17,033 INFO L87 Difference]: Start difference. First operand 13 states and 28 transitions. Second operand 3 states. [2019-02-15 11:25:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:23,703 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-15 11:25:23,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:23,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 11:25:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:23,704 INFO L225 Difference]: With dead ends: 21 [2019-02-15 11:25:23,704 INFO L226 Difference]: Without dead ends: 14 [2019-02-15 11:25:23,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-15 11:25:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-15 11:25:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 11:25:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-02-15 11:25:23,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 32 transitions. Word has length 3 [2019-02-15 11:25:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:23,712 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 32 transitions. [2019-02-15 11:25:23,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:25:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 32 transitions. [2019-02-15 11:25:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:23,712 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:23,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:23,713 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:23,713 INFO L82 PathProgramCache]: Analyzing trace with hash 939102, now seen corresponding path program 1 times [2019-02-15 11:25:23,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:23,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:23,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:23,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:23,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:23,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:23,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:23,793 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:23,793 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-15 11:25:23,795 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:23,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:35,874 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:25:35,874 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:35,875 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:25:36,235 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:25:37,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_325 Int) (v_idx_323 Int) (v_idx_317 Int) (v_idx_329 Int) (v_idx_327 Int) (v_idx_320 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p2 2)) (.cse1 (+ c_ULTIMATE.start_main_p4 1)) (.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse11 (+ c_ULTIMATE.start_main_p1 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_327 c_ULTIMATE.start_main_p3) (<= .cse0 v_idx_327) (= 0 (select |c_#memory_int| v_idx_327))) (or (= 1 (select |c_#valid| v_idx_320)) (< v_idx_320 c_ULTIMATE.start_main_p4) (<= .cse1 v_idx_320)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (< v_idx_317 c_ULTIMATE.start_main_p4) (<= .cse1 v_idx_317) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_317))) (<= .cse2 c_ULTIMATE.start_main_p3) (or (< v_idx_325 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_325) 0) (<= .cse2 v_idx_325)) (<= .cse3 c_ULTIMATE.start_main_p4) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (let ((.cse7 (select |c_#memory_int| v_idx_323))) (let ((.cse5 (<= .cse11 v_idx_323)) (.cse6 (<= 0 .cse7)) (.cse8 (<= 0 (* 2 .cse7))) (.cse9 (< v_idx_323 c_ULTIMATE.start_main_p1))) (let ((.cse10 (or .cse5 (and .cse6 .cse8) .cse9))) (or (let ((.cse4 (select |c_#memory_int| v_idx_329))) (and (<= .cse4 0) (or .cse5 (and .cse6 (<= .cse4 .cse7) .cse8) .cse9) (<= (* 2 .cse4) 0))) (and (< v_idx_329 c_ULTIMATE.start_main_p4) .cse10) (and (<= .cse1 v_idx_329) .cse10))))) (<= .cse0 c_ULTIMATE.start_main_p4) (<= .cse11 c_ULTIMATE.start_main_p2) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse12 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-15 11:25:37,110 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-15 11:25:37,110 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:25:37,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:25:37,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-15 11:25:37,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:37,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:37,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:37,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-15 11:25:37,111 INFO L87 Difference]: Start difference. First operand 14 states and 32 transitions. Second operand 4 states. [2019-02-15 11:25:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:43,206 INFO L93 Difference]: Finished difference Result 22 states and 43 transitions. [2019-02-15 11:25:43,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:43,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:25:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:43,207 INFO L225 Difference]: With dead ends: 22 [2019-02-15 11:25:43,208 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 11:25:43,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-15 11:25:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 11:25:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-02-15 11:25:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 11:25:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2019-02-15 11:25:43,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 4 [2019-02-15 11:25:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:43,216 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 28 transitions. [2019-02-15 11:25:43,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:25:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2019-02-15 11:25:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:43,216 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:43,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:43,217 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:43,217 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-15 11:25:43,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:43,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:43,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:43,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:43,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:43,422 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-15 11:25:43,680 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-02-15 11:25:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:43,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:43,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:43,688 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:43,689 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-15 11:25:43,690 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:43,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:56,040 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:25:56,040 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:56,041 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:25:56,389 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:25:57,062 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-15 11:25:57,062 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:25:57,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:25:57,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-15 11:25:57,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:57,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:25:57,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:25:57,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:57,064 INFO L87 Difference]: Start difference. First operand 13 states and 28 transitions. Second operand 3 states. [2019-02-15 11:25:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:59,339 INFO L93 Difference]: Finished difference Result 22 states and 43 transitions. [2019-02-15 11:25:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:59,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 11:25:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:59,340 INFO L225 Difference]: With dead ends: 22 [2019-02-15 11:25:59,340 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 11:25:59,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 11:25:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-02-15 11:25:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 11:25:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-02-15 11:25:59,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 32 transitions. Word has length 4 [2019-02-15 11:25:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:59,350 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 32 transitions. [2019-02-15 11:25:59,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:25:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 32 transitions. [2019-02-15 11:25:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:59,350 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:59,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:59,351 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:59,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-15 11:25:59,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:59,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:59,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:59,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:59,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:59,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:59,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:59,488 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:59,488 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-15 11:25:59,489 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:59,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:15,445 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:26:15,445 INFO L272 AbstractInterpreter]: Visited 4 different actions 34 times. Merged at 2 different actions 10 times. Widened at 2 different actions 6 times. Found 12 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:15,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:15,445 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:26:15,839 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:26:16,473 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-15 11:26:16,473 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:26:16,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:26:16,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-15 11:26:16,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:16,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:26:16,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:26:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:26:16,474 INFO L87 Difference]: Start difference. First operand 14 states and 32 transitions. Second operand 3 states. [2019-02-15 11:26:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:19,420 INFO L93 Difference]: Finished difference Result 16 states and 38 transitions. [2019-02-15 11:26:19,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:26:19,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 11:26:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:19,421 INFO L225 Difference]: With dead ends: 16 [2019-02-15 11:26:19,422 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 11:26:19,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:26:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 11:26:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-15 11:26:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 11:26:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2019-02-15 11:26:19,433 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 37 transitions. Word has length 4 [2019-02-15 11:26:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:19,434 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 37 transitions. [2019-02-15 11:26:19,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:26:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 37 transitions. [2019-02-15 11:26:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:19,434 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:19,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:19,435 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:19,435 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-02-15 11:26:19,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:19,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:19,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:19,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:19,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:19,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:19,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:19,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:19,543 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-02-15 11:26:19,544 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:19,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:34,374 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:26:34,375 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:34,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:34,375 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:26:34,744 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:26:35,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_599 Int) (v_idx_597 Int) (v_idx_587 Int) (v_idx_590 Int) (v_idx_595 Int) (v_idx_593 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p2 2)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse11 (+ c_ULTIMATE.start_main_p1 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 3)) (.cse0 (+ c_ULTIMATE.start_main_p4 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_599) 0) (< v_idx_599 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_599)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (<= .cse1 v_idx_597) (< v_idx_597 c_ULTIMATE.start_main_p3) (= (select |c_#memory_int| v_idx_597) 0)) (<= .cse2 c_ULTIMATE.start_main_p3) (<= .cse3 c_ULTIMATE.start_main_p4) (let ((.cse9 (select |c_#memory_int| v_idx_593))) (let ((.cse7 (<= 0 .cse9)) (.cse8 (<= 0 (* 2 .cse9))) (.cse5 (< v_idx_593 c_ULTIMATE.start_main_p1)) (.cse6 (<= .cse11 v_idx_593))) (let ((.cse10 (or (and .cse7 .cse8) .cse5 .cse6))) (or (let ((.cse4 (select |c_#memory_int| v_idx_595))) (and (<= (* 2 .cse4) 0) (or .cse5 .cse6 (and .cse7 .cse8 (<= .cse4 .cse9))) (<= .cse4 0))) (and (< v_idx_595 c_ULTIMATE.start_main_p2) .cse10) (and (<= .cse2 v_idx_595) .cse10))))) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (or (= 1 (select |c_#valid| v_idx_590)) (<= .cse0 v_idx_590) (< v_idx_590 c_ULTIMATE.start_main_p4)) (<= .cse1 c_ULTIMATE.start_main_p4) (<= .cse11 c_ULTIMATE.start_main_p2) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse12 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_587)) (<= .cse0 v_idx_587) (< v_idx_587 c_ULTIMATE.start_main_p4))))) is different from false [2019-02-15 11:26:35,898 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-15 11:26:35,899 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:26:35,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:26:35,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-15 11:26:35,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:35,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:26:35,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:26:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-15 11:26:35,900 INFO L87 Difference]: Start difference. First operand 15 states and 37 transitions. Second operand 4 states. [2019-02-15 11:26:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:43,138 INFO L93 Difference]: Finished difference Result 25 states and 56 transitions. [2019-02-15 11:26:43,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:26:43,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:26:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:43,139 INFO L225 Difference]: With dead ends: 25 [2019-02-15 11:26:43,139 INFO L226 Difference]: Without dead ends: 18 [2019-02-15 11:26:43,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-15 11:26:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-15 11:26:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-15 11:26:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 11:26:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2019-02-15 11:26:43,152 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 49 transitions. Word has length 4 [2019-02-15 11:26:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:43,153 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 49 transitions. [2019-02-15 11:26:43,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:26:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 49 transitions. [2019-02-15 11:26:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:43,153 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:43,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:43,154 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash 929740, now seen corresponding path program 1 times [2019-02-15 11:26:43,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:43,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:43,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:43,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:43,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:43,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:43,243 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [19] [2019-02-15 11:26:43,244 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:43,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:56,565 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:26:56,566 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:56,566 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:26:56,924 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:26:57,930 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-15 11:26:57,931 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:26:57,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:26:57,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-15 11:26:57,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:57,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:26:57,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:26:57,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:26:57,932 INFO L87 Difference]: Start difference. First operand 18 states and 49 transitions. Second operand 3 states. [2019-02-15 11:27:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:03,591 INFO L93 Difference]: Finished difference Result 26 states and 60 transitions. [2019-02-15 11:27:03,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:27:03,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 11:27:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:03,592 INFO L225 Difference]: With dead ends: 26 [2019-02-15 11:27:03,592 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 11:27:03,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:27:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 11:27:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-15 11:27:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 11:27:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 53 transitions. [2019-02-15 11:27:03,604 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 53 transitions. Word has length 4 [2019-02-15 11:27:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:03,605 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 53 transitions. [2019-02-15 11:27:03,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:27:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 53 transitions. [2019-02-15 11:27:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:27:03,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:03,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:27:03,606 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:03,606 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-15 11:27:03,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:03,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:03,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:03,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:03,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:03,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:27:03,724 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-15 11:27:03,725 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:03,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:17,263 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:27:17,263 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:27:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:17,264 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:27:17,612 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:27:18,168 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_764 Int) (v_idx_762 Int) (v_idx_752 Int) (v_idx_758 Int) (v_idx_755 Int) (v_idx_760 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 3)) (.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse4 (+ c_ULTIMATE.start_main_p3 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (<= .cse0 v_idx_752) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_752)) (< v_idx_752 c_ULTIMATE.start_main_p4)) (or (<= .cse0 v_idx_755) (= (select |c_#valid| v_idx_755) 1) (< v_idx_755 c_ULTIMATE.start_main_p4)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (<= .cse1 v_idx_758) (< v_idx_758 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_758) 0)) (<= .cse2 c_ULTIMATE.start_main_p3) (<= .cse3 c_ULTIMATE.start_main_p4) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_764 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_764) 0) (<= .cse0 v_idx_764)) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (<= .cse4 c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_main_p2) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse5 c_ULTIMATE.start_main_p4) (let ((.cse9 (select |c_#memory_int| v_idx_762))) (let ((.cse7 (<= .cse4 v_idx_762)) (.cse8 (< v_idx_762 c_ULTIMATE.start_main_p3)) (.cse10 (<= 0 .cse9)) (.cse11 (<= 0 (* 2 .cse9)))) (let ((.cse12 (or .cse7 .cse8 (and .cse10 .cse11)))) (or (let ((.cse6 (select |c_#memory_int| v_idx_760))) (and (<= .cse6 0) (or .cse7 .cse8 (and (<= .cse6 .cse9) .cse10 .cse11)) (<= (* 2 .cse6) 0))) (and .cse12 (< v_idx_760 c_ULTIMATE.start_main_p2)) (and .cse12 (<= .cse2 v_idx_760))))))))) is different from false [2019-02-15 11:27:18,527 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-15 11:27:18,527 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:27:18,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:27:18,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-15 11:27:18,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:27:18,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:27:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:27:18,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-15 11:27:18,528 INFO L87 Difference]: Start difference. First operand 19 states and 53 transitions. Second operand 4 states. [2019-02-15 11:27:19,241 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_743 Int) (v_idx_740 Int) (v_idx_747 Int) (v_idx_745 Int) (v_idx_737 Int) (v_idx_749 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (<= .cse0 v_idx_749) (< v_idx_749 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_749) 0)) (or (<= .cse0 v_idx_740) (< v_idx_740 c_ULTIMATE.start_main_p4) (= (select |c_#valid| v_idx_740) 1)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse2 c_ULTIMATE.start_main_p4) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p4) (or (<= .cse0 v_idx_737) (< v_idx_737 c_ULTIMATE.start_main_p4) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_737) 0)) (or (<= .cse4 v_idx_743) (= (select |c_#memory_int| v_idx_743) 0) (< v_idx_743 c_ULTIMATE.start_main_p1)) (let ((.cse11 (select |c_#memory_int| v_idx_747))) (let ((.cse7 (<= .cse3 v_idx_747)) (.cse8 (< v_idx_747 c_ULTIMATE.start_main_p3)) (.cse9 (<= 0 .cse11)) (.cse10 (<= 0 (* 2 .cse11)))) (let ((.cse5 (or .cse7 .cse8 (and .cse9 .cse10)))) (or (and (< v_idx_745 c_ULTIMATE.start_main_p2) .cse5) (let ((.cse6 (select |c_#memory_int| v_idx_745))) (and (<= (* 2 .cse6) 0) (or .cse7 .cse8 (and .cse9 .cse10 (<= .cse6 .cse11))) (<= .cse6 0))) (and (<= .cse1 v_idx_745) .cse5))))) (<= .cse4 c_ULTIMATE.start_main_p2) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse12 c_ULTIMATE.start_main_p4)))) (forall ((v_idx_764 Int) (v_idx_762 Int) (v_idx_752 Int) (v_idx_758 Int) (v_idx_755 Int) (v_idx_760 Int)) (let ((.cse16 (+ c_ULTIMATE.start_main_p2 2)) (.cse13 (+ c_ULTIMATE.start_main_p4 1)) (.cse14 (+ c_ULTIMATE.start_main_p1 1)) (.cse18 (+ c_ULTIMATE.start_main_p1 3)) (.cse15 (+ c_ULTIMATE.start_main_p2 1)) (.cse17 (+ c_ULTIMATE.start_main_p3 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (<= .cse13 v_idx_752) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_752)) (< v_idx_752 c_ULTIMATE.start_main_p4)) (or (<= .cse13 v_idx_755) (= (select |c_#valid| v_idx_755) 1) (< v_idx_755 c_ULTIMATE.start_main_p4)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (<= .cse14 v_idx_758) (< v_idx_758 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_758) 0)) (<= .cse15 c_ULTIMATE.start_main_p3) (<= .cse16 c_ULTIMATE.start_main_p4) (<= .cse16 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_764 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_764) 0) (<= .cse13 v_idx_764)) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (<= .cse17 c_ULTIMATE.start_main_p4) (<= .cse14 c_ULTIMATE.start_main_p2) (<= .cse18 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse18 c_ULTIMATE.start_main_p4) (let ((.cse22 (select |c_#memory_int| v_idx_762))) (let ((.cse20 (<= .cse17 v_idx_762)) (.cse21 (< v_idx_762 c_ULTIMATE.start_main_p3)) (.cse23 (<= 0 .cse22)) (.cse24 (<= 0 (* 2 .cse22)))) (let ((.cse25 (or .cse20 .cse21 (and .cse23 .cse24)))) (or (let ((.cse19 (select |c_#memory_int| v_idx_760))) (and (<= .cse19 0) (or .cse20 .cse21 (and (<= .cse19 .cse22) .cse23 .cse24)) (<= (* 2 .cse19) 0))) (and .cse25 (< v_idx_760 c_ULTIMATE.start_main_p2)) (and .cse25 (<= .cse15 v_idx_760)))))))))) is different from false [2019-02-15 11:27:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:30,538 INFO L93 Difference]: Finished difference Result 27 states and 64 transitions. [2019-02-15 11:27:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:27:30,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:27:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:30,539 INFO L225 Difference]: With dead ends: 27 [2019-02-15 11:27:30,539 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 11:27:30,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-15 11:27:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 11:27:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-15 11:27:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 11:27:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-15 11:27:30,554 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-15 11:27:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:30,554 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-15 11:27:30,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:27:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-15 11:27:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:30,555 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:30,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:30,555 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:30,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-02-15 11:27:30,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:30,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:30,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:30,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:30,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:30,691 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-15 11:27:30,692 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:30,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:55,750 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:27:55,750 INFO L272 AbstractInterpreter]: Visited 5 different actions 57 times. Merged at 3 different actions 13 times. Widened at 3 different actions 9 times. Found 29 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:55,751 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:27:56,254 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:27:57,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_852 Int) (v_idx_842 Int) (v_idx_850 Int) (v_idx_845 Int) (v_idx_854 Int) (v_idx_848 Int)) (let ((.cse15 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p2 2)) (.cse19 (+ c_ULTIMATE.start_main_p3 1)) (.cse18 (+ c_ULTIMATE.start_main_p4 1)) (.cse17 (+ c_ULTIMATE.start_main_p1 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 3))) (and (let ((.cse6 (select |c_#memory_int| v_idx_854)) (.cse14 (select |c_#memory_int| v_idx_848))) (let ((.cse3 (< v_idx_854 c_ULTIMATE.start_main_p4)) (.cse9 (<= .cse6 .cse14)) (.cse5 (<= (* 2 .cse6) 0)) (.cse13 (<= .cse6 0)) (.cse4 (<= .cse18 v_idx_854)) (.cse7 (<= .cse17 v_idx_848)) (.cse10 (<= 0 (* 2 .cse14))) (.cse11 (<= 0 .cse14)) (.cse8 (< v_idx_848 c_ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse16 (or .cse7 (and .cse10 .cse11) .cse8))) (or (and .cse16 .cse3) (and (or .cse7 .cse8 (and .cse9 .cse10 .cse11)) .cse5 .cse13) (and .cse16 .cse4))))) (or (and (< v_idx_850 c_ULTIMATE.start_main_p2) .cse0) (let ((.cse1 (select |c_#memory_int| v_idx_850))) (and (<= (* 2 .cse1) 0) (let ((.cse12 (<= .cse1 .cse14))) (let ((.cse2 (or .cse7 .cse8 (and .cse10 .cse11 .cse12)))) (or (and .cse2 .cse3) (and .cse2 .cse4) (and .cse5 (<= (+ .cse1 .cse6) 0) (or .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12)) .cse13)))) (<= .cse1 0))) (and .cse0 (<= .cse15 v_idx_850)))))) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_842)) (<= .cse18 v_idx_842) (< v_idx_842 c_ULTIMATE.start_main_p4)) (or (<= .cse19 v_idx_852) (< v_idx_852 c_ULTIMATE.start_main_p3) (= (select |c_#memory_int| v_idx_852) 0)) (<= .cse15 c_ULTIMATE.start_main_p3) (<= .cse20 c_ULTIMATE.start_main_p4) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (<= .cse19 c_ULTIMATE.start_main_p4) (or (< v_idx_845 c_ULTIMATE.start_main_p4) (<= .cse18 v_idx_845) (= 1 (select |c_#valid| v_idx_845))) (<= .cse17 c_ULTIMATE.start_main_p2) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-15 11:27:59,193 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-15 11:27:59,193 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:27:59,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:27:59,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2019-02-15 11:27:59,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:27:59,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:27:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:27:59,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-15 11:27:59,195 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 4 states. [2019-02-15 11:28:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:06,216 INFO L93 Difference]: Finished difference Result 28 states and 68 transitions. [2019-02-15 11:28:06,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:28:06,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 11:28:06,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:06,217 INFO L225 Difference]: With dead ends: 28 [2019-02-15 11:28:06,217 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 11:28:06,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-15 11:28:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 11:28:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-02-15 11:28:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 11:28:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2019-02-15 11:28:06,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 49 transitions. Word has length 5 [2019-02-15 11:28:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:06,238 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 49 transitions. [2019-02-15 11:28:06,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:28:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 49 transitions. [2019-02-15 11:28:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:28:06,239 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:06,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:28:06,239 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash 29112026, now seen corresponding path program 1 times [2019-02-15 11:28:06,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:06,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:06,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:06,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:06,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:06,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:06,384 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:28:06,384 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-15 11:28:06,385 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:06,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:29,308 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:28:29,308 INFO L272 AbstractInterpreter]: Visited 5 different actions 53 times. Merged at 3 different actions 12 times. Widened at 3 different actions 8 times. Found 27 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:28:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:29,308 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:28:29,822 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:28:30,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_985 Int) (v_idx_983 Int) (v_idx_977 Int) (v_idx_989 Int) (v_idx_987 Int) (v_idx_980 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 3)) (.cse2 (+ c_ULTIMATE.start_main_p3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse0 c_ULTIMATE.start_main_p3) (<= .cse1 c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_main_p4) (or (= (select |c_#memory_int| v_idx_985) 0) (< v_idx_985 c_ULTIMATE.start_main_p2) (<= .cse0 v_idx_985)) (or (<= .cse3 v_idx_977) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_977) 0) (< v_idx_977 c_ULTIMATE.start_main_p4)) (<= .cse4 c_ULTIMATE.start_main_p2) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse5 c_ULTIMATE.start_main_p4) (or (<= .cse3 v_idx_980) (= (select |c_#valid| v_idx_980) 1) (< v_idx_980 c_ULTIMATE.start_main_p4)) (let ((.cse19 (select |c_#memory_int| v_idx_989)) (.cse20 (select |c_#memory_int| v_idx_983))) (let ((.cse10 (< v_idx_989 c_ULTIMATE.start_main_p4)) (.cse16 (<= .cse19 .cse20)) (.cse11 (<= (* 2 .cse19) 0)) (.cse12 (<= .cse19 0)) (.cse9 (<= .cse3 v_idx_989)) (.cse14 (<= 0 (* 2 .cse20))) (.cse15 (<= 0 .cse20)) (.cse13 (< v_idx_983 c_ULTIMATE.start_main_p1)) (.cse18 (<= .cse4 v_idx_983))) (let ((.cse6 (let ((.cse21 (or (and .cse14 .cse15) .cse13 .cse18))) (or (and .cse10 .cse21) (and (or .cse13 (and .cse14 .cse15 .cse16) .cse18) .cse11 .cse12) (and .cse21 .cse9))))) (or (and (< v_idx_987 c_ULTIMATE.start_main_p3) .cse6) (and (<= .cse2 v_idx_987) .cse6) (let ((.cse7 (select |c_#memory_int| v_idx_987))) (and (<= 0 .cse7) (<= 0 (* 2 .cse7)) (let ((.cse17 (<= 0 (+ .cse7 .cse20)))) (let ((.cse8 (or .cse13 (and .cse14 .cse15 .cse17) .cse18))) (or (and .cse8 .cse9) (and .cse10 .cse8) (and .cse11 .cse12 (or .cse13 (and .cse14 .cse15 .cse16 .cse17) .cse18) (<= .cse19 .cse7)))))))))))))) is different from false [2019-02-15 11:28:30,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_995 Int) (v_idx_1004 Int) (v_idx_1002 Int) (v_idx_1000 Int) (v_idx_998 Int) (v_idx_992 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_995 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_995)) (<= .cse0 v_idx_995)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (< v_idx_1000 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_1000) 0) (<= .cse1 v_idx_1000)) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse2 c_ULTIMATE.start_main_p4) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p2) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_992)) (< v_idx_992 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_992)) (let ((.cse15 (select |c_#memory_int| v_idx_1004)) (.cse18 (select |c_#memory_int| v_idx_1002))) (let ((.cse7 (<= .cse0 v_idx_1004)) (.cse5 (< v_idx_1004 c_ULTIMATE.start_main_p4)) (.cse10 (<= .cse15 .cse18)) (.cse14 (<= (* 2 .cse15) 0)) (.cse17 (<= .cse15 0)) (.cse9 (<= 0 .cse18)) (.cse11 (<= 0 (* 2 .cse18))) (.cse12 (<= .cse3 v_idx_1002)) (.cse13 (< v_idx_1002 c_ULTIMATE.start_main_p3))) (let ((.cse19 (let ((.cse20 (or (and .cse9 .cse11) .cse12 .cse13))) (or (and .cse20 .cse7) (and .cse5 .cse20) (and (or .cse12 (and .cse9 .cse10 .cse11) .cse13) .cse14 .cse17))))) (or (let ((.cse16 (select |c_#memory_int| v_idx_998))) (and (let ((.cse8 (<= 0 (+ .cse18 .cse16)))) (let ((.cse6 (or (and .cse8 .cse9 .cse11) .cse12 .cse13))) (or (and .cse5 .cse6) (and .cse6 .cse7) (and (or (and .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) .cse14 (<= .cse15 .cse16) .cse17)))) (<= 0 (* 2 .cse16)) (<= 0 .cse16))) (and .cse19 (< v_idx_998 c_ULTIMATE.start_main_p1)) (and (<= .cse4 v_idx_998) .cse19))))) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-15 11:28:31,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1015 Int) (v_idx_1013 Int) (v_idx_1010 Int) (v_idx_1019 Int) (v_idx_1007 Int) (v_idx_1017 Int)) (let ((.cse19 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p2 2)) (.cse17 (+ c_ULTIMATE.start_main_p4 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse18 (+ c_ULTIMATE.start_main_p1 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse15 (select |c_#memory_int| v_idx_1019)) (.cse14 (select |c_#memory_int| v_idx_1013))) (let ((.cse8 (<= .cse15 .cse14)) (.cse12 (<= 0 .cse14)) (.cse13 (<= 0 (* 2 .cse14))) (.cse5 (< v_idx_1013 c_ULTIMATE.start_main_p1)) (.cse3 (<= .cse18 v_idx_1013)) (.cse7 (<= (* 2 .cse15) 0)) (.cse10 (<= .cse15 0)) (.cse6 (< v_idx_1019 c_ULTIMATE.start_main_p4)) (.cse11 (<= .cse17 v_idx_1019))) (let ((.cse0 (let ((.cse16 (or (and .cse7 .cse10) .cse6 .cse11))) (or (and (or .cse6 (and .cse7 .cse8 .cse10) .cse11) .cse12 .cse13) (and .cse5 .cse16) (and .cse3 .cse16))))) (or (and .cse0 (<= .cse1 v_idx_1017)) (and .cse0 (< v_idx_1017 c_ULTIMATE.start_main_p3)) (let ((.cse2 (select |c_#memory_int| v_idx_1017))) (and (<= 0 .cse2) (<= 0 (* 2 .cse2)) (let ((.cse9 (<= .cse15 .cse2))) (let ((.cse4 (or .cse6 (and .cse7 .cse9 .cse10) .cse11))) (or (and .cse3 .cse4) (and .cse5 .cse4) (and (or .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11) .cse12 .cse13 (<= 0 (+ .cse2 .cse14)))))))))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (<= .cse17 v_idx_1007) (< v_idx_1007 c_ULTIMATE.start_main_p4) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1007))) (<= .cse19 c_ULTIMATE.start_main_p3) (<= .cse20 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_#memory_int| v_idx_1015)) (< v_idx_1015 c_ULTIMATE.start_main_p2) (<= .cse19 v_idx_1015)) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_1010 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1010)) (<= .cse17 v_idx_1010)) (<= .cse1 c_ULTIMATE.start_main_p4) (<= .cse18 c_ULTIMATE.start_main_p2) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-15 11:28:31,369 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-15 11:28:31,369 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:28:31,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:28:31,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2019-02-15 11:28:31,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:28:31,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:28:31,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:28:31,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-15 11:28:31,371 INFO L87 Difference]: Start difference. First operand 18 states and 49 transitions. Second operand 6 states. [2019-02-15 11:28:33,482 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_1015 Int) (v_idx_1013 Int) (v_idx_1010 Int) (v_idx_1019 Int) (v_idx_1007 Int) (v_idx_1017 Int)) (let ((.cse19 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p2 2)) (.cse17 (+ c_ULTIMATE.start_main_p4 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse18 (+ c_ULTIMATE.start_main_p1 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse15 (select |c_#memory_int| v_idx_1019)) (.cse14 (select |c_#memory_int| v_idx_1013))) (let ((.cse8 (<= .cse15 .cse14)) (.cse12 (<= 0 .cse14)) (.cse13 (<= 0 (* 2 .cse14))) (.cse5 (< v_idx_1013 c_ULTIMATE.start_main_p1)) (.cse3 (<= .cse18 v_idx_1013)) (.cse7 (<= (* 2 .cse15) 0)) (.cse10 (<= .cse15 0)) (.cse6 (< v_idx_1019 c_ULTIMATE.start_main_p4)) (.cse11 (<= .cse17 v_idx_1019))) (let ((.cse0 (let ((.cse16 (or (and .cse7 .cse10) .cse6 .cse11))) (or (and (or .cse6 (and .cse7 .cse8 .cse10) .cse11) .cse12 .cse13) (and .cse5 .cse16) (and .cse3 .cse16))))) (or (and .cse0 (<= .cse1 v_idx_1017)) (and .cse0 (< v_idx_1017 c_ULTIMATE.start_main_p3)) (let ((.cse2 (select |c_#memory_int| v_idx_1017))) (and (<= 0 .cse2) (<= 0 (* 2 .cse2)) (let ((.cse9 (<= .cse15 .cse2))) (let ((.cse4 (or .cse6 (and .cse7 .cse9 .cse10) .cse11))) (or (and .cse3 .cse4) (and .cse5 .cse4) (and (or .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11) .cse12 .cse13 (<= 0 (+ .cse2 .cse14)))))))))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (<= .cse17 v_idx_1007) (< v_idx_1007 c_ULTIMATE.start_main_p4) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1007))) (<= .cse19 c_ULTIMATE.start_main_p3) (<= .cse20 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_#memory_int| v_idx_1015)) (< v_idx_1015 c_ULTIMATE.start_main_p2) (<= .cse19 v_idx_1015)) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_1010 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1010)) (<= .cse17 v_idx_1010)) (<= .cse1 c_ULTIMATE.start_main_p4) (<= .cse18 c_ULTIMATE.start_main_p2) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) (forall ((v_idx_985 Int) (v_idx_983 Int) (v_idx_977 Int) (v_idx_989 Int) (v_idx_987 Int) (v_idx_980 Int)) (let ((.cse23 (+ c_ULTIMATE.start_main_p2 2)) (.cse22 (+ c_ULTIMATE.start_main_p2 1)) (.cse27 (+ c_ULTIMATE.start_main_p1 3)) (.cse24 (+ c_ULTIMATE.start_main_p3 1)) (.cse26 (+ c_ULTIMATE.start_main_p1 1)) (.cse25 (+ c_ULTIMATE.start_main_p4 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse22 c_ULTIMATE.start_main_p3) (<= .cse23 c_ULTIMATE.start_main_p4) (<= .cse23 c_ULTIMATE.start_malloc_ptr) (<= .cse24 c_ULTIMATE.start_malloc_ptr) (<= .cse24 c_ULTIMATE.start_main_p4) (or (= (select |c_#memory_int| v_idx_985) 0) (< v_idx_985 c_ULTIMATE.start_main_p2) (<= .cse22 v_idx_985)) (or (<= .cse25 v_idx_977) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_977) 0) (< v_idx_977 c_ULTIMATE.start_main_p4)) (<= .cse26 c_ULTIMATE.start_main_p2) (<= .cse27 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse27 c_ULTIMATE.start_main_p4) (or (<= .cse25 v_idx_980) (= (select |c_#valid| v_idx_980) 1) (< v_idx_980 c_ULTIMATE.start_main_p4)) (let ((.cse41 (select |c_#memory_int| v_idx_989)) (.cse42 (select |c_#memory_int| v_idx_983))) (let ((.cse32 (< v_idx_989 c_ULTIMATE.start_main_p4)) (.cse38 (<= .cse41 .cse42)) (.cse33 (<= (* 2 .cse41) 0)) (.cse34 (<= .cse41 0)) (.cse31 (<= .cse25 v_idx_989)) (.cse36 (<= 0 (* 2 .cse42))) (.cse37 (<= 0 .cse42)) (.cse35 (< v_idx_983 c_ULTIMATE.start_main_p1)) (.cse40 (<= .cse26 v_idx_983))) (let ((.cse28 (let ((.cse43 (or (and .cse36 .cse37) .cse35 .cse40))) (or (and .cse32 .cse43) (and (or .cse35 (and .cse36 .cse37 .cse38) .cse40) .cse33 .cse34) (and .cse43 .cse31))))) (or (and (< v_idx_987 c_ULTIMATE.start_main_p3) .cse28) (and (<= .cse24 v_idx_987) .cse28) (let ((.cse29 (select |c_#memory_int| v_idx_987))) (and (<= 0 .cse29) (<= 0 (* 2 .cse29)) (let ((.cse39 (<= 0 (+ .cse29 .cse42)))) (let ((.cse30 (or .cse35 (and .cse36 .cse37 .cse39) .cse40))) (or (and .cse30 .cse31) (and .cse32 .cse30) (and .cse33 .cse34 (or .cse35 (and .cse36 .cse37 .cse38 .cse39) .cse40) (<= .cse41 .cse29)))))))))))))) (forall ((v_idx_962 Int) (v_idx_974 Int) (v_idx_972 Int) (v_idx_965 Int) (v_idx_968 Int) (v_idx_970 Int)) (let ((.cse64 (+ c_ULTIMATE.start_main_p2 2)) (.cse61 (+ c_ULTIMATE.start_main_p3 1)) (.cse44 (+ c_ULTIMATE.start_main_p1 1)) (.cse62 (+ c_ULTIMATE.start_main_p4 1)) (.cse63 (+ c_ULTIMATE.start_main_p2 1)) (.cse65 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse59 (select |c_#memory_int| v_idx_972)) (.cse48 (select |c_#memory_int| v_idx_974))) (let ((.cse47 (<= .cse62 v_idx_974)) (.cse58 (< v_idx_974 c_ULTIMATE.start_main_p4)) (.cse50 (<= (* 2 .cse48) 0)) (.cse52 (<= .cse48 .cse59)) (.cse57 (<= .cse48 0)) (.cse51 (< v_idx_972 c_ULTIMATE.start_main_p3)) (.cse56 (<= .cse61 v_idx_972)) (.cse53 (<= 0 .cse59)) (.cse54 (<= 0 (* 2 .cse59)))) (let ((.cse45 (let ((.cse60 (or .cse51 .cse56 (and .cse53 .cse54)))) (or (and .cse47 .cse60) (and .cse58 .cse60) (and .cse50 (or .cse51 .cse56 (and .cse52 .cse53 .cse54)) .cse57))))) (or (and (<= .cse44 v_idx_968) .cse45) (let ((.cse49 (select |c_#memory_int| v_idx_968))) (and (let ((.cse55 (<= 0 (+ .cse49 .cse59)))) (let ((.cse46 (or (and .cse53 .cse54 .cse55) .cse51 .cse56))) (or (and .cse46 .cse47) (and (<= .cse48 .cse49) .cse50 (or .cse51 (and .cse52 .cse53 .cse54 .cse55) .cse56) .cse57) (and .cse46 .cse58)))) (<= 0 (* 2 .cse49)) (<= 0 .cse49))) (and (< v_idx_968 c_ULTIMATE.start_main_p1) .cse45))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (< v_idx_965 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_965)) (<= .cse62 v_idx_965)) (<= .cse63 c_ULTIMATE.start_main_p3) (<= .cse64 c_ULTIMATE.start_main_p4) (<= .cse64 c_ULTIMATE.start_malloc_ptr) (<= .cse61 c_ULTIMATE.start_malloc_ptr) (<= .cse61 c_ULTIMATE.start_main_p4) (<= .cse44 c_ULTIMATE.start_main_p2) (or (< v_idx_962 c_ULTIMATE.start_main_p4) (<= .cse62 v_idx_962) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_962))) (<= .cse65 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_970) 0) (< v_idx_970 c_ULTIMATE.start_main_p2) (<= .cse63 v_idx_970)) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse65 c_ULTIMATE.start_main_p4)))) (forall ((v_idx_995 Int) (v_idx_1004 Int) (v_idx_1002 Int) (v_idx_1000 Int) (v_idx_998 Int) (v_idx_992 Int)) (let ((.cse67 (+ c_ULTIMATE.start_main_p2 1)) (.cse68 (+ c_ULTIMATE.start_main_p2 2)) (.cse70 (+ c_ULTIMATE.start_main_p1 1)) (.cse69 (+ c_ULTIMATE.start_main_p3 1)) (.cse66 (+ c_ULTIMATE.start_main_p4 1)) (.cse87 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_995 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_995)) (<= .cse66 v_idx_995)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (< v_idx_1000 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_1000) 0) (<= .cse67 v_idx_1000)) (<= .cse67 c_ULTIMATE.start_main_p3) (<= .cse68 c_ULTIMATE.start_main_p4) (<= .cse68 c_ULTIMATE.start_malloc_ptr) (<= .cse69 c_ULTIMATE.start_malloc_ptr) (<= .cse69 c_ULTIMATE.start_main_p4) (<= .cse70 c_ULTIMATE.start_main_p2) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_992)) (< v_idx_992 c_ULTIMATE.start_main_p4) (<= .cse66 v_idx_992)) (let ((.cse81 (select |c_#memory_int| v_idx_1004)) (.cse84 (select |c_#memory_int| v_idx_1002))) (let ((.cse73 (<= .cse66 v_idx_1004)) (.cse71 (< v_idx_1004 c_ULTIMATE.start_main_p4)) (.cse76 (<= .cse81 .cse84)) (.cse80 (<= (* 2 .cse81) 0)) (.cse83 (<= .cse81 0)) (.cse75 (<= 0 .cse84)) (.cse77 (<= 0 (* 2 .cse84))) (.cse78 (<= .cse69 v_idx_1002)) (.cse79 (< v_idx_1002 c_ULTIMATE.start_main_p3))) (let ((.cse85 (let ((.cse86 (or (and .cse75 .cse77) .cse78 .cse79))) (or (and .cse86 .cse73) (and .cse71 .cse86) (and (or .cse78 (and .cse75 .cse76 .cse77) .cse79) .cse80 .cse83))))) (or (let ((.cse82 (select |c_#memory_int| v_idx_998))) (and (let ((.cse74 (<= 0 (+ .cse84 .cse82)))) (let ((.cse72 (or (and .cse74 .cse75 .cse77) .cse78 .cse79))) (or (and .cse71 .cse72) (and .cse72 .cse73) (and (or (and .cse74 .cse75 .cse76 .cse77) .cse78 .cse79) .cse80 (<= .cse81 .cse82) .cse83)))) (<= 0 (* 2 .cse82)) (<= 0 .cse82))) (and .cse85 (< v_idx_998 c_ULTIMATE.start_main_p1)) (and (<= .cse70 v_idx_998) .cse85))))) (<= .cse87 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse87 c_ULTIMATE.start_main_p4))))) is different from false [2019-02-15 11:29:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:10,218 INFO L93 Difference]: Finished difference Result 33 states and 92 transitions. [2019-02-15 11:29:10,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:29:10,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-15 11:29:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:10,219 INFO L225 Difference]: With dead ends: 33 [2019-02-15 11:29:10,219 INFO L226 Difference]: Without dead ends: 26 [2019-02-15 11:29:10,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=11, Invalid=7, Unknown=4, NotChecked=20, Total=42 [2019-02-15 11:29:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-15 11:29:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-15 11:29:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 11:29:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 81 transitions. [2019-02-15 11:29:10,251 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 81 transitions. Word has length 5 [2019-02-15 11:29:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:10,251 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 81 transitions. [2019-02-15 11:29:10,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:29:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 81 transitions. [2019-02-15 11:29:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:29:10,252 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:10,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:29:10,252 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-15 11:29:10,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:10,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:10,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:10,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:10,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:10,403 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:29:10,403 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-15 11:29:10,406 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:10,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:35,707 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:29:35,708 INFO L272 AbstractInterpreter]: Visited 5 different actions 57 times. Merged at 3 different actions 13 times. Widened at 3 different actions 9 times. Found 29 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:29:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:35,708 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:29:36,245 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:29:38,547 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-15 11:29:38,548 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:29:38,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:29:38,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2019-02-15 11:29:38,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:29:38,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:29:38,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:29:38,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:29:38,549 INFO L87 Difference]: Start difference. First operand 26 states and 81 transitions. Second operand 3 states. [2019-02-15 11:29:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:42,094 INFO L93 Difference]: Finished difference Result 35 states and 96 transitions. [2019-02-15 11:29:42,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:29:42,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-02-15 11:29:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:42,095 INFO L225 Difference]: With dead ends: 35 [2019-02-15 11:29:42,095 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 11:29:42,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:29:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 11:29:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-02-15 11:29:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 11:29:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 76 transitions. [2019-02-15 11:29:42,141 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 76 transitions. Word has length 5 [2019-02-15 11:29:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:42,141 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 76 transitions. [2019-02-15 11:29:42,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:29:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 76 transitions. [2019-02-15 11:29:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:29:42,142 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:42,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:29:42,142 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:42,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:42,142 INFO L82 PathProgramCache]: Analyzing trace with hash 28817960, now seen corresponding path program 1 times [2019-02-15 11:29:42,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:42,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:42,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:42,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:42,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:42,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:42,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:42,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:29:42,292 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [19] [2019-02-15 11:29:42,293 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:42,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:30:04,669 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:30:04,669 INFO L272 AbstractInterpreter]: Visited 5 different actions 53 times. Merged at 3 different actions 12 times. Widened at 3 different actions 8 times. Found 27 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:30:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:04,669 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:30:05,215 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:30:06,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1235 Int) (v_idx_1244 Int) (v_idx_1232 Int) (v_idx_1242 Int) (v_idx_1240 Int) (v_idx_1238 Int)) (let ((.cse18 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p2 2)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse19 (+ c_ULTIMATE.start_main_p4 1)) (.cse17 (+ c_ULTIMATE.start_main_p1 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse15 (select |c_#memory_int| v_idx_1238)) (.cse14 (select |c_#memory_int| v_idx_1240))) (let ((.cse4 (< v_idx_1240 c_ULTIMATE.start_main_p2)) (.cse5 (<= .cse18 v_idx_1240)) (.cse6 (<= .cse14 0)) (.cse9 (<= .cse14 .cse15)) (.cse13 (<= (* 2 .cse14) 0)) (.cse8 (<= 0 .cse15)) (.cse10 (<= 0 (* 2 .cse15))) (.cse11 (<= .cse17 v_idx_1238)) (.cse12 (< v_idx_1238 c_ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse16 (or (and .cse8 .cse10) .cse11 .cse12))) (or (and .cse16 .cse4) (and .cse16 .cse5) (and .cse6 (or .cse11 .cse12 (and .cse8 .cse9 .cse10)) .cse13))))) (or (and .cse0 (<= .cse1 v_idx_1242)) (and (< v_idx_1242 c_ULTIMATE.start_main_p3) .cse0) (let ((.cse2 (select |c_#memory_int| v_idx_1242))) (and (<= 0 (* 2 .cse2)) (let ((.cse7 (<= 0 (+ .cse15 .cse2)))) (let ((.cse3 (or (and .cse7 .cse8 .cse10) .cse11 .cse12))) (or (and .cse3 .cse4) (and .cse3 .cse5) (and .cse6 (or (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse12) .cse13 (<= .cse14 .cse2))))) (<= 0 .cse2))))))) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1232) 0) (< v_idx_1232 c_ULTIMATE.start_main_p4) (<= .cse19 v_idx_1232)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse18 c_ULTIMATE.start_main_p3) (<= .cse20 c_ULTIMATE.start_main_p4) (or (<= .cse19 v_idx_1244) (= (select |c_#memory_int| v_idx_1244) 0) (< v_idx_1244 c_ULTIMATE.start_main_p4)) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p4) (or (<= .cse19 v_idx_1235) (= (select |c_#valid| v_idx_1235) 1) (< v_idx_1235 c_ULTIMATE.start_main_p4)) (<= .cse17 c_ULTIMATE.start_main_p2) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-15 11:30:07,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1247 Int) (v_idx_1257 Int) (v_idx_1255 Int) (v_idx_1253 Int) (v_idx_1250 Int) (v_idx_1259 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p1 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1247) 0) (< v_idx_1247 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_1247)) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse2 c_ULTIMATE.start_main_p4) (or (< v_idx_1259 c_ULTIMATE.start_main_p4) (= 0 (select |c_#memory_int| v_idx_1259)) (<= .cse0 v_idx_1259)) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p4) (or (<= .cse0 v_idx_1250) (= 1 (select |c_#valid| v_idx_1250)) (< v_idx_1250 c_ULTIMATE.start_main_p4)) (let ((.cse18 (select |c_#memory_int| v_idx_1253)) (.cse9 (select |c_#memory_int| v_idx_1255))) (let ((.cse6 (<= .cse1 v_idx_1255)) (.cse8 (<= (* 2 .cse9) 0)) (.cse17 (<= .cse9 0)) (.cse16 (<= .cse9 .cse18)) (.cse7 (< v_idx_1255 c_ULTIMATE.start_main_p2)) (.cse11 (< v_idx_1253 c_ULTIMATE.start_main_p1)) (.cse12 (<= .cse20 v_idx_1253)) (.cse13 (<= 0 (* 2 .cse18))) (.cse15 (<= 0 .cse18))) (let ((.cse4 (let ((.cse19 (or .cse11 .cse12 (and .cse13 .cse15)))) (or (and .cse19 .cse6) (and .cse8 .cse17 (or .cse11 .cse12 (and .cse13 .cse15 .cse16))) (and .cse7 .cse19))))) (or (and (< v_idx_1257 c_ULTIMATE.start_main_p3) .cse4) (let ((.cse10 (select |c_#memory_int| v_idx_1257))) (and (let ((.cse14 (<= 0 (+ .cse18 .cse10)))) (let ((.cse5 (or (and .cse13 .cse14 .cse15) .cse11 .cse12))) (or (and .cse5 .cse6) (and .cse7 .cse5) (and .cse8 (<= .cse9 .cse10) (or .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16)) .cse17)))) (<= 0 (* 2 .cse10)) (<= 0 .cse10))) (and .cse4 (<= .cse3 v_idx_1257)))))) (<= .cse20 c_ULTIMATE.start_main_p2) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-15 11:30:07,218 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-15 11:30:07,219 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:30:07,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:30:07,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-02-15 11:30:07,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:30:07,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:30:07,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:30:07,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-15 11:30:07,220 INFO L87 Difference]: Start difference. First operand 25 states and 76 transitions. Second operand 5 states. [2019-02-15 11:30:09,215 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_1235 Int) (v_idx_1244 Int) (v_idx_1232 Int) (v_idx_1242 Int) (v_idx_1240 Int) (v_idx_1238 Int)) (let ((.cse18 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p2 2)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse19 (+ c_ULTIMATE.start_main_p4 1)) (.cse17 (+ c_ULTIMATE.start_main_p1 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse15 (select |c_#memory_int| v_idx_1238)) (.cse14 (select |c_#memory_int| v_idx_1240))) (let ((.cse4 (< v_idx_1240 c_ULTIMATE.start_main_p2)) (.cse5 (<= .cse18 v_idx_1240)) (.cse6 (<= .cse14 0)) (.cse9 (<= .cse14 .cse15)) (.cse13 (<= (* 2 .cse14) 0)) (.cse8 (<= 0 .cse15)) (.cse10 (<= 0 (* 2 .cse15))) (.cse11 (<= .cse17 v_idx_1238)) (.cse12 (< v_idx_1238 c_ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse16 (or (and .cse8 .cse10) .cse11 .cse12))) (or (and .cse16 .cse4) (and .cse16 .cse5) (and .cse6 (or .cse11 .cse12 (and .cse8 .cse9 .cse10)) .cse13))))) (or (and .cse0 (<= .cse1 v_idx_1242)) (and (< v_idx_1242 c_ULTIMATE.start_main_p3) .cse0) (let ((.cse2 (select |c_#memory_int| v_idx_1242))) (and (<= 0 (* 2 .cse2)) (let ((.cse7 (<= 0 (+ .cse15 .cse2)))) (let ((.cse3 (or (and .cse7 .cse8 .cse10) .cse11 .cse12))) (or (and .cse3 .cse4) (and .cse3 .cse5) (and .cse6 (or (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse12) .cse13 (<= .cse14 .cse2))))) (<= 0 .cse2))))))) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1232) 0) (< v_idx_1232 c_ULTIMATE.start_main_p4) (<= .cse19 v_idx_1232)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse18 c_ULTIMATE.start_main_p3) (<= .cse20 c_ULTIMATE.start_main_p4) (or (<= .cse19 v_idx_1244) (= (select |c_#memory_int| v_idx_1244) 0) (< v_idx_1244 c_ULTIMATE.start_main_p4)) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p4) (or (<= .cse19 v_idx_1235) (= (select |c_#valid| v_idx_1235) 1) (< v_idx_1235 c_ULTIMATE.start_main_p4)) (<= .cse17 c_ULTIMATE.start_main_p2) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) (forall ((v_idx_1214 Int) (v_idx_1202 Int) (v_idx_1212 Int) (v_idx_1210 Int) (v_idx_1208 Int) (v_idx_1205 Int)) (let ((.cse22 (+ c_ULTIMATE.start_main_p2 1)) (.cse41 (+ c_ULTIMATE.start_main_p2 2)) (.cse39 (+ c_ULTIMATE.start_main_p3 1)) (.cse42 (+ c_ULTIMATE.start_main_p4 1)) (.cse40 (+ c_ULTIMATE.start_main_p1 1)) (.cse43 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse35 (select |c_#memory_int| v_idx_1208)) (.cse37 (select |c_#memory_int| v_idx_1212))) (let ((.cse30 (<= 0 (+ .cse35 .cse37))) (.cse33 (<= 0 .cse35)) (.cse34 (<= 0 (* 2 .cse35))) (.cse26 (<= .cse40 v_idx_1208)) (.cse36 (< v_idx_1208 c_ULTIMATE.start_main_p1)) (.cse27 (< v_idx_1212 c_ULTIMATE.start_main_p3)) (.cse31 (<= 0 .cse37)) (.cse32 (<= 0 (* 2 .cse37))) (.cse28 (<= .cse39 v_idx_1212))) (let ((.cse23 (let ((.cse38 (or .cse27 (and .cse31 .cse32) .cse28))) (or (and (or .cse27 (and .cse30 .cse31 .cse32) .cse28) .cse33 .cse34) (and .cse26 .cse38) (and .cse36 .cse38))))) (or (and (<= .cse22 v_idx_1210) .cse23) (and .cse23 (< v_idx_1210 c_ULTIMATE.start_main_p2)) (let ((.cse24 (select |c_#memory_int| v_idx_1210))) (and (<= (* 2 .cse24) 0) (<= .cse24 0) (let ((.cse29 (<= .cse24 .cse37))) (let ((.cse25 (or .cse27 .cse28 (and .cse29 .cse31 .cse32)))) (or (and .cse25 .cse26) (and (or .cse27 .cse28 (and .cse29 .cse30 .cse31 .cse32)) .cse33 .cse34 (<= .cse24 .cse35)) (and .cse25 .cse36)))))))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse22 c_ULTIMATE.start_main_p3) (<= .cse41 c_ULTIMATE.start_main_p4) (<= .cse41 c_ULTIMATE.start_malloc_ptr) (<= .cse39 c_ULTIMATE.start_malloc_ptr) (<= .cse39 c_ULTIMATE.start_main_p4) (or (<= .cse42 v_idx_1202) (< v_idx_1202 c_ULTIMATE.start_main_p4) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1202) 0)) (or (<= .cse42 v_idx_1214) (= 0 (select |c_#memory_int| v_idx_1214)) (< v_idx_1214 c_ULTIMATE.start_main_p4)) (or (= (select |c_#valid| v_idx_1205) 1) (<= .cse42 v_idx_1205) (< v_idx_1205 c_ULTIMATE.start_main_p4)) (<= .cse40 c_ULTIMATE.start_main_p2) (<= .cse43 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse43 c_ULTIMATE.start_main_p4)))) (forall ((v_idx_1247 Int) (v_idx_1257 Int) (v_idx_1255 Int) (v_idx_1253 Int) (v_idx_1250 Int) (v_idx_1259 Int)) (let ((.cse46 (+ c_ULTIMATE.start_main_p2 2)) (.cse44 (+ c_ULTIMATE.start_main_p4 1)) (.cse47 (+ c_ULTIMATE.start_main_p3 1)) (.cse45 (+ c_ULTIMATE.start_main_p2 1)) (.cse64 (+ c_ULTIMATE.start_main_p1 1)) (.cse65 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1247) 0) (< v_idx_1247 c_ULTIMATE.start_main_p4) (<= .cse44 v_idx_1247)) (<= .cse45 c_ULTIMATE.start_main_p3) (<= .cse46 c_ULTIMATE.start_main_p4) (or (< v_idx_1259 c_ULTIMATE.start_main_p4) (= 0 (select |c_#memory_int| v_idx_1259)) (<= .cse44 v_idx_1259)) (<= .cse46 c_ULTIMATE.start_malloc_ptr) (<= .cse47 c_ULTIMATE.start_malloc_ptr) (<= .cse47 c_ULTIMATE.start_main_p4) (or (<= .cse44 v_idx_1250) (= 1 (select |c_#valid| v_idx_1250)) (< v_idx_1250 c_ULTIMATE.start_main_p4)) (let ((.cse62 (select |c_#memory_int| v_idx_1253)) (.cse53 (select |c_#memory_int| v_idx_1255))) (let ((.cse50 (<= .cse45 v_idx_1255)) (.cse52 (<= (* 2 .cse53) 0)) (.cse61 (<= .cse53 0)) (.cse60 (<= .cse53 .cse62)) (.cse51 (< v_idx_1255 c_ULTIMATE.start_main_p2)) (.cse55 (< v_idx_1253 c_ULTIMATE.start_main_p1)) (.cse56 (<= .cse64 v_idx_1253)) (.cse57 (<= 0 (* 2 .cse62))) (.cse59 (<= 0 .cse62))) (let ((.cse48 (let ((.cse63 (or .cse55 .cse56 (and .cse57 .cse59)))) (or (and .cse63 .cse50) (and .cse52 .cse61 (or .cse55 .cse56 (and .cse57 .cse59 .cse60))) (and .cse51 .cse63))))) (or (and (< v_idx_1257 c_ULTIMATE.start_main_p3) .cse48) (let ((.cse54 (select |c_#memory_int| v_idx_1257))) (and (let ((.cse58 (<= 0 (+ .cse62 .cse54)))) (let ((.cse49 (or (and .cse57 .cse58 .cse59) .cse55 .cse56))) (or (and .cse49 .cse50) (and .cse51 .cse49) (and .cse52 (<= .cse53 .cse54) (or .cse55 .cse56 (and .cse57 .cse58 .cse59 .cse60)) .cse61)))) (<= 0 (* 2 .cse54)) (<= 0 .cse54))) (and .cse48 (<= .cse47 v_idx_1257)))))) (<= .cse64 c_ULTIMATE.start_main_p2) (<= .cse65 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse65 c_ULTIMATE.start_main_p4))))) is different from false [2019-02-15 11:30:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:30:25,905 INFO L93 Difference]: Finished difference Result 30 states and 94 transitions. [2019-02-15 11:30:25,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:30:25,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-15 11:30:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:30:25,905 INFO L225 Difference]: With dead ends: 30 [2019-02-15 11:30:25,906 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 11:30:25,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-15 11:30:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 11:30:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-15 11:30:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 11:30:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 93 transitions. [2019-02-15 11:30:25,975 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 93 transitions. Word has length 5 [2019-02-15 11:30:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:30:25,975 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 93 transitions. [2019-02-15 11:30:25,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:30:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 93 transitions. [2019-02-15 11:30:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:30:25,976 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:30:25,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:30:25,976 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:30:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash 902468826, now seen corresponding path program 1 times [2019-02-15 11:30:25,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:30:25,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:25,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:25,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:25,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:30:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:26,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:26,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:30:26,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:30:26,152 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-15 11:30:26,153 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:30:26,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:17,300 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:31:17,300 INFO L272 AbstractInterpreter]: Visited 6 different actions 101 times. Merged at 4 different actions 19 times. Widened at 4 different actions 15 times. Found 61 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:31:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:17,300 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:31:18,184 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:31:26,872 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1400 Int) (v_idx_1397 Int) (v_idx_1409 Int) (v_idx_1407 Int) (v_idx_1405 Int) (v_idx_1403 Int)) (let ((.cse31 (+ c_ULTIMATE.start_main_p2 1)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 2)) (.cse30 (+ c_ULTIMATE.start_main_p3 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse33 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (< v_idx_1400 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1400)) (<= .cse0 v_idx_1400)) (let ((.cse25 (select |c_#memory_int| v_idx_1407)) (.cse26 (select |c_#memory_int| v_idx_1405)) (.cse17 (select |c_#memory_int| v_idx_1409))) (let ((.cse19 (<= (* 2 .cse17) 0)) (.cse6 (<= (+ .cse17 .cse26) 0)) (.cse11 (<= .cse17 .cse25)) (.cse20 (<= .cse17 0)) (.cse23 (<= .cse0 v_idx_1409)) (.cse21 (< v_idx_1409 c_ULTIMATE.start_main_p4)) (.cse9 (<= .cse26 .cse25)) (.cse5 (<= (* 2 .cse26) 0)) (.cse15 (<= .cse26 0)) (.cse16 (< v_idx_1405 c_ULTIMATE.start_main_p2)) (.cse4 (<= .cse31 v_idx_1405)) (.cse13 (< v_idx_1407 c_ULTIMATE.start_main_p3)) (.cse14 (<= .cse30 v_idx_1407)) (.cse8 (<= 0 (* 2 .cse25))) (.cse10 (<= 0 .cse25))) (let ((.cse1 (let ((.cse28 (let ((.cse29 (or .cse13 .cse14 (and .cse8 .cse10)))) (or (and (or .cse13 (and .cse8 .cse9 .cse10) .cse14) .cse5 .cse15) (and .cse16 .cse29) (and .cse4 .cse29))))) (or (and .cse19 (let ((.cse27 (or .cse13 (and .cse8 .cse10 .cse11) .cse14))) (or (and .cse27 .cse4) (and (or (and .cse8 .cse9 .cse10 .cse11) .cse13 .cse14) .cse5 .cse6 .cse15) (and .cse27 .cse16))) .cse20) (and .cse28 .cse23) (and .cse21 .cse28))))) (or (and .cse1 (< v_idx_1403 c_ULTIMATE.start_main_p1)) (and .cse1 (<= .cse2 v_idx_1403)) (let ((.cse18 (select |c_#memory_int| v_idx_1403))) (and (let ((.cse7 (<= .cse26 .cse18)) (.cse12 (<= 0 (+ .cse25 .cse18)))) (let ((.cse22 (let ((.cse24 (or .cse13 (and .cse8 .cse10 .cse12) .cse14))) (or (and .cse24 .cse16) (and .cse24 .cse4) (and .cse5 .cse7 .cse15 (or .cse13 (and .cse8 .cse9 .cse10 .cse12) .cse14)))))) (or (and (let ((.cse3 (or .cse13 (and .cse8 .cse10 .cse11 .cse12) .cse14))) (or (and .cse3 .cse4) (and .cse5 .cse6 .cse7 (or (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) .cse15) (and .cse16 .cse3))) (<= .cse17 .cse18) .cse19 .cse20) (and .cse21 .cse22) (and .cse23 .cse22)))) (<= 0 (* 2 .cse18)) (<= 0 .cse18))))))) (<= .cse31 c_ULTIMATE.start_main_p3) (<= .cse32 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1397)) (< v_idx_1397 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_1397)) (<= .cse32 c_ULTIMATE.start_malloc_ptr) (<= .cse30 c_ULTIMATE.start_malloc_ptr) (<= .cse30 c_ULTIMATE.start_main_p4) (<= .cse2 c_ULTIMATE.start_main_p2) (<= .cse33 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse33 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-15 11:31:26,887 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-02-15 11:31:26,888 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:31:26,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:31:26,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2019-02-15 11:31:26,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:31:26,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:31:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:31:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-15 11:31:26,889 INFO L87 Difference]: Start difference. First operand 29 states and 93 transitions. Second operand 4 states. [2019-02-15 11:31:28,608 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_1345 Int) (v_idx_1343 Int) (v_idx_1340 Int) (v_idx_1349 Int) (v_idx_1337 Int) (v_idx_1347 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p4 1)) (.cse33 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse0 c_ULTIMATE.start_main_p3) (<= .cse1 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1337)) (< v_idx_1337 c_ULTIMATE.start_main_p4) (<= .cse2 v_idx_1337)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p4) (let ((.cse28 (select |c_#memory_int| v_idx_1345)) (.cse29 (select |c_#memory_int| v_idx_1349)) (.cse24 (select |c_#memory_int| v_idx_1347))) (let ((.cse14 (<= .cse29 .cse24)) (.cse15 (<= .cse28 .cse24)) (.cse25 (<= 0 .cse24)) (.cse26 (<= 0 (* 2 .cse24))) (.cse9 (< v_idx_1347 c_ULTIMATE.start_main_p3)) (.cse8 (<= .cse3 v_idx_1347)) (.cse23 (<= .cse2 v_idx_1349)) (.cse13 (<= (* 2 .cse29) 0)) (.cse17 (<= (+ .cse28 .cse29) 0)) (.cse22 (<= .cse29 0)) (.cse11 (< v_idx_1349 c_ULTIMATE.start_main_p4)) (.cse20 (<= .cse0 v_idx_1345)) (.cse16 (<= (* 2 .cse28) 0)) (.cse19 (<= .cse28 0)) (.cse21 (< v_idx_1345 c_ULTIMATE.start_main_p2))) (let ((.cse4 (let ((.cse31 (let ((.cse32 (or .cse20 (and .cse16 .cse19) .cse21))) (or (and .cse32 .cse23) (and .cse13 (or (and .cse16 .cse17 .cse19) .cse20 .cse21) .cse22) (and .cse32 .cse11))))) (or (and (let ((.cse30 (or (and .cse15 .cse16 .cse19) .cse20 .cse21))) (or (and .cse30 .cse23) (and (or (and .cse15 .cse16 .cse17 .cse19) .cse20 .cse21) .cse13 .cse14 .cse22) (and .cse30 .cse11))) .cse25 .cse26) (and .cse9 .cse31) (and .cse8 .cse31))))) (or (and .cse4 (<= .cse5 v_idx_1343)) (and .cse4 (< v_idx_1343 c_ULTIMATE.start_main_p1)) (let ((.cse6 (select |c_#memory_int| v_idx_1343))) (and (<= 0 .cse6) (<= 0 (* 2 .cse6)) (let ((.cse12 (<= .cse29 .cse6)) (.cse18 (<= .cse28 .cse6))) (let ((.cse7 (let ((.cse27 (or .cse20 (and .cse16 .cse18 .cse19) .cse21))) (or (and .cse27 .cse11) (and .cse12 .cse13 (or (and .cse16 .cse17 .cse18 .cse19) .cse20 .cse21) .cse22) (and .cse27 .cse23))))) (or (and .cse7 .cse8) (and .cse7 .cse9) (and (let ((.cse10 (or .cse20 (and .cse15 .cse16 .cse18 .cse19) .cse21))) (or (and .cse10 .cse11) (and .cse12 .cse13 .cse14 (or (and .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse21) .cse22) (and .cse10 .cse23))) (<= 0 (+ .cse24 .cse6)) .cse25 .cse26)))))))))) (<= .cse5 c_ULTIMATE.start_main_p2) (or (< v_idx_1340 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1340)) (<= .cse2 v_idx_1340)) (<= .cse33 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse33 c_ULTIMATE.start_main_p4)))) (forall ((v_idx_1400 Int) (v_idx_1397 Int) (v_idx_1409 Int) (v_idx_1407 Int) (v_idx_1405 Int) (v_idx_1403 Int)) (let ((.cse65 (+ c_ULTIMATE.start_main_p2 1)) (.cse34 (+ c_ULTIMATE.start_main_p4 1)) (.cse66 (+ c_ULTIMATE.start_main_p2 2)) (.cse64 (+ c_ULTIMATE.start_main_p3 1)) (.cse36 (+ c_ULTIMATE.start_main_p1 1)) (.cse67 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (< v_idx_1400 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1400)) (<= .cse34 v_idx_1400)) (let ((.cse59 (select |c_#memory_int| v_idx_1407)) (.cse60 (select |c_#memory_int| v_idx_1405)) (.cse51 (select |c_#memory_int| v_idx_1409))) (let ((.cse53 (<= (* 2 .cse51) 0)) (.cse40 (<= (+ .cse51 .cse60) 0)) (.cse45 (<= .cse51 .cse59)) (.cse54 (<= .cse51 0)) (.cse57 (<= .cse34 v_idx_1409)) (.cse55 (< v_idx_1409 c_ULTIMATE.start_main_p4)) (.cse43 (<= .cse60 .cse59)) (.cse39 (<= (* 2 .cse60) 0)) (.cse49 (<= .cse60 0)) (.cse50 (< v_idx_1405 c_ULTIMATE.start_main_p2)) (.cse38 (<= .cse65 v_idx_1405)) (.cse47 (< v_idx_1407 c_ULTIMATE.start_main_p3)) (.cse48 (<= .cse64 v_idx_1407)) (.cse42 (<= 0 (* 2 .cse59))) (.cse44 (<= 0 .cse59))) (let ((.cse35 (let ((.cse62 (let ((.cse63 (or .cse47 .cse48 (and .cse42 .cse44)))) (or (and (or .cse47 (and .cse42 .cse43 .cse44) .cse48) .cse39 .cse49) (and .cse50 .cse63) (and .cse38 .cse63))))) (or (and .cse53 (let ((.cse61 (or .cse47 (and .cse42 .cse44 .cse45) .cse48))) (or (and .cse61 .cse38) (and (or (and .cse42 .cse43 .cse44 .cse45) .cse47 .cse48) .cse39 .cse40 .cse49) (and .cse61 .cse50))) .cse54) (and .cse62 .cse57) (and .cse55 .cse62))))) (or (and .cse35 (< v_idx_1403 c_ULTIMATE.start_main_p1)) (and .cse35 (<= .cse36 v_idx_1403)) (let ((.cse52 (select |c_#memory_int| v_idx_1403))) (and (let ((.cse41 (<= .cse60 .cse52)) (.cse46 (<= 0 (+ .cse59 .cse52)))) (let ((.cse56 (let ((.cse58 (or .cse47 (and .cse42 .cse44 .cse46) .cse48))) (or (and .cse58 .cse50) (and .cse58 .cse38) (and .cse39 .cse41 .cse49 (or .cse47 (and .cse42 .cse43 .cse44 .cse46) .cse48)))))) (or (and (let ((.cse37 (or .cse47 (and .cse42 .cse44 .cse45 .cse46) .cse48))) (or (and .cse37 .cse38) (and .cse39 .cse40 .cse41 (or (and .cse42 .cse43 .cse44 .cse45 .cse46) .cse47 .cse48) .cse49) (and .cse50 .cse37))) (<= .cse51 .cse52) .cse53 .cse54) (and .cse55 .cse56) (and .cse57 .cse56)))) (<= 0 (* 2 .cse52)) (<= 0 .cse52))))))) (<= .cse65 c_ULTIMATE.start_main_p3) (<= .cse66 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1397)) (< v_idx_1397 c_ULTIMATE.start_main_p4) (<= .cse34 v_idx_1397)) (<= .cse66 c_ULTIMATE.start_malloc_ptr) (<= .cse64 c_ULTIMATE.start_malloc_ptr) (<= .cse64 c_ULTIMATE.start_main_p4) (<= .cse36 c_ULTIMATE.start_main_p2) (<= .cse67 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse67 c_ULTIMATE.start_main_p4))))) is different from false [2019-02-15 11:31:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:39,585 INFO L93 Difference]: Finished difference Result 29 states and 93 transitions. [2019-02-15 11:31:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:31:39,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-15 11:31:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:39,585 INFO L225 Difference]: With dead ends: 29 [2019-02-15 11:31:39,585 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 11:31:39,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-15 11:31:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 11:31:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 11:31:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 11:31:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 11:31:39,586 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-15 11:31:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:39,587 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 11:31:39,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:31:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 11:31:39,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 11:31:39,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 11:31:43,018 WARN L181 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 219 DAG size of output: 124 [2019-02-15 11:31:43,020 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-15 11:31:43,020 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-02-15 11:31:43,020 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-02-15 11:31:43,021 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-02-15 11:31:43,021 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-02-15 11:31:43,021 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-02-15 11:31:43,021 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-02-15 11:31:43,021 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (forall ((v_idx_1400 Int) (v_idx_1397 Int) (v_idx_1409 Int) (v_idx_1407 Int) (v_idx_1405 Int) (v_idx_1403 Int)) (let ((.cse31 (+ ULTIMATE.start_main_p2 1)) (.cse0 (+ ULTIMATE.start_main_p4 1)) (.cse32 (+ ULTIMATE.start_main_p2 2)) (.cse30 (+ ULTIMATE.start_main_p3 1)) (.cse2 (+ ULTIMATE.start_main_p1 1)) (.cse33 (+ ULTIMATE.start_main_p1 3))) (and (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p4) (or (< v_idx_1400 ULTIMATE.start_main_p4) (= 1 (select |#valid| v_idx_1400)) (<= .cse0 v_idx_1400)) (let ((.cse25 (select |#memory_int| v_idx_1407)) (.cse26 (select |#memory_int| v_idx_1405)) (.cse17 (select |#memory_int| v_idx_1409))) (let ((.cse19 (<= (* 2 .cse17) 0)) (.cse6 (<= (+ .cse17 .cse26) 0)) (.cse11 (<= .cse17 .cse25)) (.cse20 (<= .cse17 0)) (.cse23 (<= .cse0 v_idx_1409)) (.cse21 (< v_idx_1409 ULTIMATE.start_main_p4)) (.cse9 (<= .cse26 .cse25)) (.cse5 (<= (* 2 .cse26) 0)) (.cse15 (<= .cse26 0)) (.cse16 (< v_idx_1405 ULTIMATE.start_main_p2)) (.cse4 (<= .cse31 v_idx_1405)) (.cse13 (< v_idx_1407 ULTIMATE.start_main_p3)) (.cse14 (<= .cse30 v_idx_1407)) (.cse8 (<= 0 (* 2 .cse25))) (.cse10 (<= 0 .cse25))) (let ((.cse1 (let ((.cse28 (let ((.cse29 (or .cse13 .cse14 (and .cse8 .cse10)))) (or (and (or .cse13 (and .cse8 .cse9 .cse10) .cse14) .cse5 .cse15) (and .cse16 .cse29) (and .cse4 .cse29))))) (or (and .cse19 (let ((.cse27 (or .cse13 (and .cse8 .cse10 .cse11) .cse14))) (or (and .cse27 .cse4) (and (or (and .cse8 .cse9 .cse10 .cse11) .cse13 .cse14) .cse5 .cse6 .cse15) (and .cse27 .cse16))) .cse20) (and .cse28 .cse23) (and .cse21 .cse28))))) (or (and .cse1 (< v_idx_1403 ULTIMATE.start_main_p1)) (and .cse1 (<= .cse2 v_idx_1403)) (let ((.cse18 (select |#memory_int| v_idx_1403))) (and (let ((.cse7 (<= .cse26 .cse18)) (.cse12 (<= 0 (+ .cse25 .cse18)))) (let ((.cse22 (let ((.cse24 (or .cse13 (and .cse8 .cse10 .cse12) .cse14))) (or (and .cse24 .cse16) (and .cse24 .cse4) (and .cse5 .cse7 .cse15 (or .cse13 (and .cse8 .cse9 .cse10 .cse12) .cse14)))))) (or (and (let ((.cse3 (or .cse13 (and .cse8 .cse10 .cse11 .cse12) .cse14))) (or (and .cse3 .cse4) (and .cse5 .cse6 .cse7 (or (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) .cse15) (and .cse16 .cse3))) (<= .cse17 .cse18) .cse19 .cse20) (and .cse21 .cse22) (and .cse23 .cse22)))) (<= 0 (* 2 .cse18)) (<= 0 .cse18))))))) (<= .cse31 ULTIMATE.start_main_p3) (<= .cse32 ULTIMATE.start_main_p4) (or (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_1397)) (< v_idx_1397 ULTIMATE.start_main_p4) (<= .cse0 v_idx_1397)) (<= .cse32 ULTIMATE.start_malloc_ptr) (<= .cse30 ULTIMATE.start_malloc_ptr) (<= .cse30 ULTIMATE.start_main_p4) (<= .cse2 ULTIMATE.start_main_p2) (<= .cse33 ULTIMATE.start_malloc_ptr) (<= ULTIMATE.start_main_p4 ULTIMATE.start_malloc_ptr) (<= .cse33 ULTIMATE.start_main_p4)))) [2019-02-15 11:31:43,021 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-15 11:31:43,021 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-02-15 11:31:43,021 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-02-15 11:31:43,044 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:31:43 BoogieIcfgContainer [2019-02-15 11:31:43,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 11:31:43,045 INFO L168 Benchmark]: Toolchain (without parser) took 428727.69 ms. Allocated memory was 140.0 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 107.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 696.5 MB. Max. memory is 7.1 GB. [2019-02-15 11:31:43,046 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:31:43,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.32 ms. Allocated memory is still 140.0 MB. Free memory was 107.0 MB in the beginning and 104.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-15 11:31:43,047 INFO L168 Benchmark]: Boogie Preprocessor took 22.93 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 103.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:31:43,048 INFO L168 Benchmark]: RCFGBuilder took 449.34 ms. Allocated memory is still 140.0 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-02-15 11:31:43,049 INFO L168 Benchmark]: TraceAbstraction took 428194.25 ms. Allocated memory was 140.0 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 93.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 682.2 MB. Max. memory is 7.1 GB. [2019-02-15 11:31:43,053 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.32 ms. Allocated memory is still 140.0 MB. Free memory was 107.0 MB in the beginning and 104.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.93 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 103.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 449.34 ms. Allocated memory is still 140.0 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 428194.25 ms. Allocated memory was 140.0 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 93.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 682.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (forall v_idx_1400 : int, v_idx_1397 : int, v_idx_1409 : int, v_idx_1407 : int, v_idx_1405 : int, v_idx_1403 : int :: ((((((((((((p1 + 2 <= p3 && ptr <= p4) && ((v_idx_1400 < p4 || 1 == #valid[v_idx_1400]) || p4 + 1 <= v_idx_1400)) && (((((((2 * #memory_int[v_idx_1409] <= 0 && (((((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1407])) || p3 + 1 <= v_idx_1407) && p2 + 1 <= v_idx_1405) || ((((((((0 <= 2 * #memory_int[v_idx_1407] && #memory_int[v_idx_1405] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407]) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1407]) || v_idx_1407 < p3) || p3 + 1 <= v_idx_1407) && 2 * #memory_int[v_idx_1405] <= 0) && #memory_int[v_idx_1409] + #memory_int[v_idx_1405] <= 0) && #memory_int[v_idx_1405] <= 0)) || (((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1407])) || p3 + 1 <= v_idx_1407) && v_idx_1405 < p2))) && #memory_int[v_idx_1409] <= 0) || (((((((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && #memory_int[v_idx_1405] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407])) || p3 + 1 <= v_idx_1407) && 2 * #memory_int[v_idx_1405] <= 0) && #memory_int[v_idx_1405] <= 0) || (v_idx_1405 < p2 && ((v_idx_1407 < p3 || p3 + 1 <= v_idx_1407) || (0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407])))) || (p2 + 1 <= v_idx_1405 && ((v_idx_1407 < p3 || p3 + 1 <= v_idx_1407) || (0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407])))) && p4 + 1 <= v_idx_1409)) || (v_idx_1409 < p4 && ((((((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && #memory_int[v_idx_1405] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407])) || p3 + 1 <= v_idx_1407) && 2 * #memory_int[v_idx_1405] <= 0) && #memory_int[v_idx_1405] <= 0) || (v_idx_1405 < p2 && ((v_idx_1407 < p3 || p3 + 1 <= v_idx_1407) || (0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407])))) || (p2 + 1 <= v_idx_1405 && ((v_idx_1407 < p3 || p3 + 1 <= v_idx_1407) || (0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407])))))) && v_idx_1403 < p1) || (((((2 * #memory_int[v_idx_1409] <= 0 && (((((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1407])) || p3 + 1 <= v_idx_1407) && p2 + 1 <= v_idx_1405) || ((((((((0 <= 2 * #memory_int[v_idx_1407] && #memory_int[v_idx_1405] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407]) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1407]) || v_idx_1407 < p3) || p3 + 1 <= v_idx_1407) && 2 * #memory_int[v_idx_1405] <= 0) && #memory_int[v_idx_1409] + #memory_int[v_idx_1405] <= 0) && #memory_int[v_idx_1405] <= 0)) || (((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1407])) || p3 + 1 <= v_idx_1407) && v_idx_1405 < p2))) && #memory_int[v_idx_1409] <= 0) || (((((((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && #memory_int[v_idx_1405] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407])) || p3 + 1 <= v_idx_1407) && 2 * #memory_int[v_idx_1405] <= 0) && #memory_int[v_idx_1405] <= 0) || (v_idx_1405 < p2 && ((v_idx_1407 < p3 || p3 + 1 <= v_idx_1407) || (0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407])))) || (p2 + 1 <= v_idx_1405 && ((v_idx_1407 < p3 || p3 + 1 <= v_idx_1407) || (0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407])))) && p4 + 1 <= v_idx_1409)) || (v_idx_1409 < p4 && ((((((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && #memory_int[v_idx_1405] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407])) || p3 + 1 <= v_idx_1407) && 2 * #memory_int[v_idx_1405] <= 0) && #memory_int[v_idx_1405] <= 0) || (v_idx_1405 < p2 && ((v_idx_1407 < p3 || p3 + 1 <= v_idx_1407) || (0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407])))) || (p2 + 1 <= v_idx_1405 && ((v_idx_1407 < p3 || p3 + 1 <= v_idx_1407) || (0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407])))))) && p1 + 1 <= v_idx_1403)) || ((((((((((((v_idx_1407 < p3 || (((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407] + #memory_int[v_idx_1403])) || p3 + 1 <= v_idx_1407) && p2 + 1 <= v_idx_1405) || ((((2 * #memory_int[v_idx_1405] <= 0 && #memory_int[v_idx_1409] + #memory_int[v_idx_1405] <= 0) && #memory_int[v_idx_1405] <= #memory_int[v_idx_1403]) && ((((((0 <= 2 * #memory_int[v_idx_1407] && #memory_int[v_idx_1405] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407]) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407] + #memory_int[v_idx_1403]) || v_idx_1407 < p3) || p3 + 1 <= v_idx_1407)) && #memory_int[v_idx_1405] <= 0)) || (v_idx_1405 < p2 && ((v_idx_1407 < p3 || (((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407] + #memory_int[v_idx_1403])) || p3 + 1 <= v_idx_1407))) && #memory_int[v_idx_1409] <= #memory_int[v_idx_1403]) && 2 * #memory_int[v_idx_1409] <= 0) && #memory_int[v_idx_1409] <= 0) || (v_idx_1409 < p4 && (((((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407] + #memory_int[v_idx_1403])) || p3 + 1 <= v_idx_1407) && v_idx_1405 < p2) || (((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407] + #memory_int[v_idx_1403])) || p3 + 1 <= v_idx_1407) && p2 + 1 <= v_idx_1405)) || (((2 * #memory_int[v_idx_1405] <= 0 && #memory_int[v_idx_1405] <= #memory_int[v_idx_1403]) && #memory_int[v_idx_1405] <= 0) && ((v_idx_1407 < p3 || (((0 <= 2 * #memory_int[v_idx_1407] && #memory_int[v_idx_1405] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407] + #memory_int[v_idx_1403])) || p3 + 1 <= v_idx_1407))))) || (p4 + 1 <= v_idx_1409 && (((((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407] + #memory_int[v_idx_1403])) || p3 + 1 <= v_idx_1407) && v_idx_1405 < p2) || (((v_idx_1407 < p3 || ((0 <= 2 * #memory_int[v_idx_1407] && 0 <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407] + #memory_int[v_idx_1403])) || p3 + 1 <= v_idx_1407) && p2 + 1 <= v_idx_1405)) || (((2 * #memory_int[v_idx_1405] <= 0 && #memory_int[v_idx_1405] <= #memory_int[v_idx_1403]) && #memory_int[v_idx_1405] <= 0) && ((v_idx_1407 < p3 || (((0 <= 2 * #memory_int[v_idx_1407] && #memory_int[v_idx_1405] <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407]) && 0 <= #memory_int[v_idx_1407] + #memory_int[v_idx_1403])) || p3 + 1 <= v_idx_1407))))) && 0 <= 2 * #memory_int[v_idx_1403]) && 0 <= #memory_int[v_idx_1403]))) && p2 + 1 <= p3) && p2 + 2 <= p4) && ((0 == old(malloc_old_#valid)[v_idx_1397] || v_idx_1397 < p4) || p4 + 1 <= v_idx_1397)) && p2 + 2 <= ptr) && p3 + 1 <= ptr) && p3 + 1 <= p4) && p1 + 1 <= p2) && p1 + 3 <= ptr) && p4 <= ptr) && p1 + 3 <= p4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 428.1s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 134.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 90 SDtfs, 38 SDslu, 1 SDs, 0 SdLazy, 90 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 25 SemanticMatches, 30 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 255.3s AbstIntTime, 15 AbstIntIterations, 15 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 21 NumberOfFragments, 1249 HoareAnnotationTreeSize, 1 FomulaSimplifications, 117821 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1246 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 2155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...