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-a9d37a5-m [2019-02-28 10:52:25,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:52:25,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:52:25,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:52:25,432 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:52:25,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:52:25,435 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:52:25,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:52:25,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:52:25,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:52:25,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:52:25,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:52:25,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:52:25,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:52:25,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:52:25,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:52:25,445 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:52:25,447 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:52:25,449 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:52:25,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:52:25,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:52:25,453 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:52:25,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:52:25,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:52:25,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:52:25,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:52:25,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:52:25,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:52:25,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:52:25,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:52:25,462 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:52:25,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:52:25,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:52:25,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:52:25,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:52:25,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:52:25,465 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-28 10:52:25,479 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:52:25,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:52:25,481 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:52:25,481 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:52:25,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:52:25,481 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:52:25,481 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:52:25,482 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:52:25,482 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:52:25,482 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:52:25,482 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:52:25,482 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:52:25,483 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:52:25,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:52:25,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:52:25,484 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:52:25,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:52:25,485 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:52:25,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:52:25,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:52:25,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:52:25,486 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:52:25,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:52:25,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:52:25,487 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:52:25,488 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:52:25,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:52:25,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:52:25,489 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:52:25,489 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:52:25,489 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:52:25,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:52:25,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:52:25,490 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:52:25,490 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:52:25,490 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:52:25,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:52:25,490 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:52:25,491 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:52:25,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:52:25,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:52:25,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:52:25,574 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:52:25,575 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:52:25,575 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-28 10:52:25,576 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-02-28 10:52:25,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:52:25,616 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:52:25,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:52:25,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:52:25,617 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:52:25,633 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 28.02 10:52:25" (1/1) ... [2019-02-28 10:52:25,645 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 28.02 10:52:25" (1/1) ... [2019-02-28 10:52:25,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:52:25,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:52:25,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:52:25,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:52:25,683 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 28.02 10:52:25" (1/1) ... [2019-02-28 10:52:25,683 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 28.02 10:52:25" (1/1) ... [2019-02-28 10:52:25,684 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 28.02 10:52:25" (1/1) ... [2019-02-28 10:52:25,685 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 28.02 10:52:25" (1/1) ... [2019-02-28 10:52:25,688 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 28.02 10:52:25" (1/1) ... [2019-02-28 10:52:25,691 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 28.02 10:52:25" (1/1) ... [2019-02-28 10:52:25,692 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 28.02 10:52:25" (1/1) ... [2019-02-28 10:52:25,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:52:25,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:52:25,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:52:25,695 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:52:25,696 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 28.02 10:52:25" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:52:25,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:52:25,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:52:26,156 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:52:26,157 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-28 10:52:26,158 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:52:26 BoogieIcfgContainer [2019-02-28 10:52:26,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:52:26,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:52:26,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:52:26,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:52:26,165 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 28.02 10:52:25" (1/2) ... [2019-02-28 10:52:26,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa6d961 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:52:26, skipping insertion in model container [2019-02-28 10:52:26,166 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 28.02 10:52:26" (2/2) ... [2019-02-28 10:52:26,169 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-02-28 10:52:26,180 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:52:26,188 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-28 10:52:26,205 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-28 10:52:26,237 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:52:26,238 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:52:26,238 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:52:26,238 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:52:26,238 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:52:26,238 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:52:26,238 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:52:26,239 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:52:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-28 10:52:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:52:26,259 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:26,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:52:26,263 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-28 10:52:26,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:26,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:26,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:26,483 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-28 10:52:26,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:52:26,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:52:26,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:26,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:26,501 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-28 10:52:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:26,724 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-28 10:52:26,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:26,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:52:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:26,740 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:52:26,740 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:52:26,743 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-28 10:52:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:52:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-28 10:52:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:52:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-28 10:52:26,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-28 10:52:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:26,785 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-28 10:52:26,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-28 10:52:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:26,786 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:26,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:26,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:26,788 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-28 10:52:26,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:26,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:26,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:26,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:26,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:26,946 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-28 10:52:26,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:26,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:26,948 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:26,950 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-28 10:52:27,000 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:27,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:36,863 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:36,865 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-28 10:52:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:36,871 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:37,225 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:37,589 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 10:52:37,589 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:37,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:37,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 10:52:37,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:37,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:37,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:37,597 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 3 states. [2019-02-28 10:52:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:39,869 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2019-02-28 10:52:39,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:39,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:52:39,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:39,870 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:52:39,870 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:52:39,871 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-28 10:52:39,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:52:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-28 10:52:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:52:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2019-02-28 10:52:39,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 3 [2019-02-28 10:52:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:39,876 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2019-02-28 10:52:39,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2019-02-28 10:52:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:39,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:39,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:39,877 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-28 10:52:39,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:39,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:39,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:39,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:39,946 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-28 10:52:39,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:39,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:39,947 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:39,947 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-28 10:52:39,952 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:39,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:44,710 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:44,710 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-28 10:52:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:44,711 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:44,963 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:45,500 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 10:52:45,501 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:45,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:45,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 10:52:45,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:45,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:45,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:45,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:45,502 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2019-02-28 10:52:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:49,559 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2019-02-28 10:52:49,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:49,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:52:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:49,560 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:52:49,560 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:52:49,560 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-28 10:52:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:52:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 10:52:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:52:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2019-02-28 10:52:49,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 3 [2019-02-28 10:52:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:49,566 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 24 transitions. [2019-02-28 10:52:49,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 24 transitions. [2019-02-28 10:52:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:49,567 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:49,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:49,567 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:49,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:49,567 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-28 10:52:49,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:49,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:49,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:49,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:49,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:49,642 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-28 10:52:49,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:49,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:49,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:49,642 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-28 10:52:49,647 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:49,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:54,157 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:54,158 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-28 10:52:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:54,158 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:54,356 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:55,038 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 10:52:55,038 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:55,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:55,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 10:52:55,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:55,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:55,039 INFO L87 Difference]: Start difference. First operand 12 states and 24 transitions. Second operand 3 states. [2019-02-28 10:52:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:58,149 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2019-02-28 10:52:58,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:58,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:52:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:58,150 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:52:58,151 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:52:58,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:52:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-28 10:52:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:52:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2019-02-28 10:52:58,158 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 3 [2019-02-28 10:52:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:58,158 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 28 transitions. [2019-02-28 10:52:58,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2019-02-28 10:52:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:58,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:58,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:58,159 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:58,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:58,160 INFO L82 PathProgramCache]: Analyzing trace with hash 30244, now seen corresponding path program 1 times [2019-02-28 10:52:58,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:58,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:58,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:58,311 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-02-28 10:52:58,315 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-28 10:52:58,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:58,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:58,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:58,316 INFO L207 CegarAbsIntRunner]: [0], [14], [19] [2019-02-28 10:52:58,317 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:58,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:03,268 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:53:03,268 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-28 10:53:03,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:03,269 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:53:03,485 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:53:04,071 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 10:53:04,071 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:53:04,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:53:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 10:53:04,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:53:04,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:53:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:53:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:53:04,072 INFO L87 Difference]: Start difference. First operand 13 states and 28 transitions. Second operand 3 states. [2019-02-28 10:53:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:10,820 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-28 10:53:10,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:53:10,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:53:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:10,821 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:53:10,821 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:53:10,822 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-28 10:53:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:53:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-28 10:53:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:53:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-02-28 10:53:10,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 32 transitions. Word has length 3 [2019-02-28 10:53:10,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:10,828 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 32 transitions. [2019-02-28 10:53:10,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:53:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 32 transitions. [2019-02-28 10:53:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:53:10,829 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:10,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:53:10,829 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:10,829 INFO L82 PathProgramCache]: Analyzing trace with hash 939102, now seen corresponding path program 1 times [2019-02-28 10:53:10,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:10,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:10,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:10,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:10,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:10,920 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-28 10:53:10,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:10,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:10,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:53:10,921 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-28 10:53:10,922 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:10,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:21,610 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:53:21,610 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-28 10:53:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:21,611 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:53:22,039 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:53:22,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_290 Int) (v_idx_295 Int) (v_idx_293 Int) (v_idx_287 Int) (v_idx_299 Int) (v_idx_297 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p2 2)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_287 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_287) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_287))) (or (< v_idx_297 c_ULTIMATE.start_main_p3) (<= .cse1 v_idx_297) (= 0 (select |c_#memory_int| v_idx_297))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (<= .cse2 v_idx_295) (= 0 (select |c_#memory_int| v_idx_295)) (< v_idx_295 c_ULTIMATE.start_main_p2)) (<= .cse2 c_ULTIMATE.start_main_p3) (<= .cse3 c_ULTIMATE.start_main_p4) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p4) (or (<= .cse0 v_idx_290) (= 1 (select |c_#valid| v_idx_290)) (< v_idx_290 c_ULTIMATE.start_main_p4)) (<= .cse4 c_ULTIMATE.start_main_p2) (let ((.cse7 (select |c_#memory_int| v_idx_299))) (let ((.cse8 (<= .cse7 0)) (.cse9 (<= (* 2 .cse7) 0)) (.cse6 (< v_idx_299 c_ULTIMATE.start_main_p4)) (.cse10 (<= .cse0 v_idx_299))) (let ((.cse11 (or (and .cse8 .cse9) .cse6 .cse10))) (or (let ((.cse5 (select |c_#memory_int| v_idx_293))) (and (<= 0 .cse5) (or .cse6 (and (<= .cse7 .cse5) .cse8 .cse9) .cse10) (<= 0 (* 2 .cse5)))) (and (< v_idx_293 c_ULTIMATE.start_main_p1) .cse11) (and .cse11 (<= .cse4 v_idx_293)))))) (<= .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-28 10:53:22,973 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:53:22,974 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:53:22,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:53:22,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-28 10:53:22,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:53:22,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:53:22,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:53:22,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-28 10:53:22,975 INFO L87 Difference]: Start difference. First operand 14 states and 32 transitions. Second operand 4 states. [2019-02-28 10:53:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:28,836 INFO L93 Difference]: Finished difference Result 22 states and 43 transitions. [2019-02-28 10:53:28,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:53:28,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:53:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:28,837 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:53:28,837 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:53:28,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-28 10:53:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:53:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-02-28 10:53:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:53:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2019-02-28 10:53:28,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 4 [2019-02-28 10:53:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:28,844 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 28 transitions. [2019-02-28 10:53:28,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:53:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2019-02-28 10:53:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:53:28,844 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:28,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:53:28,844 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-28 10:53:28,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:28,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:28,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:28,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:28,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:29,067 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-28 10:53:29,253 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-02-28 10:53:29,260 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-28 10:53:29,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:29,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:29,261 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:53:29,261 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-28 10:53:29,262 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:29,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:42,632 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:53:42,632 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-28 10:53:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:42,632 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:53:42,930 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:53:43,495 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:53:43,495 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:53:43,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:53:43,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-28 10:53:43,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:53:43,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:53:43,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:53:43,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:53:43,496 INFO L87 Difference]: Start difference. First operand 13 states and 28 transitions. Second operand 3 states. [2019-02-28 10:53:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:45,360 INFO L93 Difference]: Finished difference Result 22 states and 43 transitions. [2019-02-28 10:53:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:53:45,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:53:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:45,360 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:53:45,360 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:53:45,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:53:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:53:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-02-28 10:53:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:53:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-02-28 10:53:45,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 32 transitions. Word has length 4 [2019-02-28 10:53:45,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:45,369 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 32 transitions. [2019-02-28 10:53:45,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:53:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 32 transitions. [2019-02-28 10:53:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:53:45,370 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:45,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:53:45,370 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-28 10:53:45,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:45,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:45,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:45,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:45,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:45,495 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-28 10:53:45,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:45,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:45,495 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:53:45,496 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-28 10:53:45,497 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:45,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:57,558 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:53:57,558 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-28 10:53:57,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:57,559 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:53:57,865 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:53:58,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_467 Int) (v_idx_479 Int) (v_idx_477 Int) (v_idx_470 Int) (v_idx_475 Int) (v_idx_473 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 2)) (.cse3 (+ c_ULTIMATE.start_main_p1 1)) (.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 3)) (.cse4 (+ c_ULTIMATE.start_main_p4 1)) (.cse2 (+ c_ULTIMATE.start_main_p3 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) (or (< v_idx_473 c_ULTIMATE.start_main_p1) (<= .cse3 v_idx_473) (= (select |c_#memory_int| v_idx_473) 0)) (or (<= .cse4 v_idx_470) (< v_idx_470 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_470))) (<= .cse2 c_ULTIMATE.start_main_p4) (or (< v_idx_467 c_ULTIMATE.start_main_p4) (<= .cse4 v_idx_467) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_467) 0)) (<= .cse3 c_ULTIMATE.start_main_p2) (or (< v_idx_475 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_475) 0) (<= .cse0 v_idx_475)) (<= .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_477))) (let ((.cse8 (<= 0 .cse9)) (.cse10 (<= 0 (* 2 .cse9))) (.cse11 (< v_idx_477 c_ULTIMATE.start_main_p3)) (.cse12 (<= .cse2 v_idx_477))) (let ((.cse6 (or (and .cse8 .cse10) .cse11 .cse12))) (or (and .cse6 (<= .cse4 v_idx_479)) (let ((.cse7 (select |c_#memory_int| v_idx_479))) (and (<= (* 2 .cse7) 0) (or (and .cse8 (<= .cse7 .cse9) .cse10) .cse11 .cse12) (<= .cse7 0))) (and (< v_idx_479 c_ULTIMATE.start_main_p4) .cse6)))))))) is different from false [2019-02-28 10:53:58,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_500 Int) (v_idx_505 Int) (v_idx_503 Int) (v_idx_509 Int) (v_idx_507 Int) (v_idx_497 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse4 (+ c_ULTIMATE.start_main_p3 1)) (.cse3 (+ 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_497) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_497) 0) (< v_idx_497 c_ULTIMATE.start_main_p4)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse2 c_ULTIMATE.start_main_p4) (or (<= .cse3 v_idx_503) (= 0 (select |c_#memory_int| v_idx_503)) (< v_idx_503 c_ULTIMATE.start_main_p1)) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (or (<= .cse0 v_idx_500) (= (select |c_#valid| v_idx_500) 1) (< v_idx_500 c_ULTIMATE.start_main_p4)) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (<= .cse4 c_ULTIMATE.start_main_p4) (or (<= .cse1 v_idx_505) (= 0 (select |c_#memory_int| v_idx_505)) (< v_idx_505 c_ULTIMATE.start_main_p2)) (let ((.cse7 (select |c_#memory_int| v_idx_507))) (let ((.cse9 (<= .cse4 v_idx_507)) (.cse6 (<= 0 (* 2 .cse7))) (.cse8 (<= 0 .cse7)) (.cse10 (< v_idx_507 c_ULTIMATE.start_main_p3))) (let ((.cse11 (or .cse9 (and .cse6 .cse8) .cse10))) (or (let ((.cse5 (select |c_#memory_int| v_idx_509))) (and (<= .cse5 0) (or (and .cse6 (<= .cse5 .cse7) .cse8) .cse9 .cse10) (<= (* 2 .cse5) 0))) (and (< v_idx_509 c_ULTIMATE.start_main_p4) .cse11) (and .cse11 (<= .cse0 v_idx_509)))))) (<= .cse3 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-28 10:53:58,550 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:53:58,550 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:53:58,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:53:58,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-02-28 10:53:58,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:53:58,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:53:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:53:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 10:53:58,552 INFO L87 Difference]: Start difference. First operand 14 states and 32 transitions. Second operand 5 states. [2019-02-28 10:54:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:06,776 INFO L93 Difference]: Finished difference Result 18 states and 40 transitions. [2019-02-28 10:54:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:54:06,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-28 10:54:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:06,778 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:54:06,778 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:54:06,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 10:54:06,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:54:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-28 10:54:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:54:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2019-02-28 10:54:06,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 38 transitions. Word has length 4 [2019-02-28 10:54:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:06,790 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 38 transitions. [2019-02-28 10:54:06,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:54:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 38 transitions. [2019-02-28 10:54:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:54:06,790 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:06,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:54:06,791 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-02-28 10:54:06,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:06,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:06,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:06,888 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-28 10:54:06,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:06,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:06,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:54:06,889 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-02-28 10:54:06,889 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:06,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:17,820 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:54:17,820 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-28 10:54:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:17,820 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:54:18,107 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:54:18,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_578 Int) (v_idx_575 Int) (v_idx_580 Int) (v_idx_584 Int) (v_idx_582 Int) (v_idx_572 Int)) (let ((.cse9 (+ c_ULTIMATE.start_main_p2 1)) (.cse10 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse8 (+ c_ULTIMATE.start_main_p1 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 3)) (.cse11 (+ c_ULTIMATE.start_main_p4 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_582 c_ULTIMATE.start_main_p3) (<= .cse0 v_idx_582) (= (select |c_#memory_int| v_idx_582) 0)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (let ((.cse5 (select |c_#memory_int| v_idx_580))) (let ((.cse4 (<= .cse5 0)) (.cse6 (<= (* 2 .cse5) 0)) (.cse2 (<= .cse9 v_idx_580)) (.cse3 (< v_idx_580 c_ULTIMATE.start_main_p2))) (let ((.cse7 (or (and .cse4 .cse6) .cse2 .cse3))) (or (let ((.cse1 (select |c_#memory_int| v_idx_578))) (and (<= 0 .cse1) (<= 0 (* 2 .cse1)) (or .cse2 .cse3 (and .cse4 (<= .cse5 .cse1) .cse6)))) (and (< v_idx_578 c_ULTIMATE.start_main_p1) .cse7) (and (<= .cse8 v_idx_578) .cse7))))) (<= .cse9 c_ULTIMATE.start_main_p3) (<= .cse10 c_ULTIMATE.start_main_p4) (<= .cse10 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p4) (or (< v_idx_584 c_ULTIMATE.start_main_p4) (<= .cse11 v_idx_584) (= (select |c_#memory_int| v_idx_584) 0)) (<= .cse8 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 (= 1 (select |c_#valid| v_idx_575)) (<= .cse11 v_idx_575) (< v_idx_575 c_ULTIMATE.start_main_p4)) (or (<= .cse11 v_idx_572) (< v_idx_572 c_ULTIMATE.start_main_p4) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_572)))))) is different from false [2019-02-28 10:54:19,106 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:54:19,107 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:54:19,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:54:19,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-28 10:54:19,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:54:19,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:54:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:54:19,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-28 10:54:19,108 INFO L87 Difference]: Start difference. First operand 16 states and 38 transitions. Second operand 4 states. [2019-02-28 10:54:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:25,121 INFO L93 Difference]: Finished difference Result 26 states and 57 transitions. [2019-02-28 10:54:25,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:54:25,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:54:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:25,122 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:54:25,122 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:54:25,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-28 10:54:25,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:54:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-28 10:54:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:54:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 50 transitions. [2019-02-28 10:54:25,135 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 50 transitions. Word has length 4 [2019-02-28 10:54:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:25,135 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 50 transitions. [2019-02-28 10:54:25,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:54:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 50 transitions. [2019-02-28 10:54:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:54:25,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:25,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:54:25,136 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:25,136 INFO L82 PathProgramCache]: Analyzing trace with hash 929740, now seen corresponding path program 1 times [2019-02-28 10:54:25,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:25,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:25,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:25,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:25,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:25,278 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-28 10:54:25,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:25,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:25,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:54:25,278 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [19] [2019-02-28 10:54:25,279 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:25,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:37,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:54:37,371 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-28 10:54:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:37,371 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:54:37,642 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:54:38,786 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:54:38,787 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:54:38,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:54:38,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-28 10:54:38,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:54:38,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:54:38,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:54:38,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:54:38,788 INFO L87 Difference]: Start difference. First operand 19 states and 50 transitions. Second operand 3 states. [2019-02-28 10:54:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:43,113 INFO L93 Difference]: Finished difference Result 27 states and 61 transitions. [2019-02-28 10:54:43,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:54:43,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:54:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:43,114 INFO L225 Difference]: With dead ends: 27 [2019-02-28 10:54:43,114 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:54:43,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:54:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:54:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-28 10:54:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:54:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2019-02-28 10:54:43,126 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 54 transitions. Word has length 4 [2019-02-28 10:54:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:43,127 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 54 transitions. [2019-02-28 10:54:43,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:54:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 54 transitions. [2019-02-28 10:54:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:54:43,127 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:43,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:54:43,128 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-28 10:54:43,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:43,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:43,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:43,251 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-28 10:54:43,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:43,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:43,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:54:43,252 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-28 10:54:43,253 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:43,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:54,022 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:54:54,023 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-28 10:54:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:54,023 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:54:54,315 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:54:54,594 WARN L838 $PredicateComparison]: unable to prove that (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)))) is different from false [2019-02-28 10:54:54,877 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)) (.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse11 (+ c_ULTIMATE.start_main_p3 1)) (.cse1 (+ 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_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) (let ((.cse5 (select |c_#memory_int| v_idx_760))) (let ((.cse7 (<= .cse5 0)) (.cse8 (<= (* 2 .cse5) 0)) (.cse4 (< v_idx_760 c_ULTIMATE.start_main_p2)) (.cse9 (<= .cse2 v_idx_760))) (let ((.cse10 (or (and .cse7 .cse8) .cse4 .cse9))) (or (let ((.cse6 (select |c_#memory_int| v_idx_762))) (and (or .cse4 (and (<= .cse5 .cse6) .cse7 .cse8) .cse9) (<= 0 .cse6) (<= 0 (* 2 .cse6)))) (and (< v_idx_762 c_ULTIMATE.start_main_p3) .cse10) (and (<= .cse11 v_idx_762) .cse10))))) (or (< v_idx_764 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_764) 0) (<= .cse0 v_idx_764)) (<= .cse11 c_ULTIMATE.start_malloc_ptr) (<= .cse11 c_ULTIMATE.start_main_p4) (<= .cse1 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-28 10:54:55,172 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:54:55,172 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:54:55,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:54:55,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-02-28 10:54:55,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:54:55,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:54:55,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:54:55,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 10:54:55,173 INFO L87 Difference]: Start difference. First operand 20 states and 54 transitions. Second operand 5 states. [2019-02-28 10:54:56,170 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_775 Int) (v_idx_773 Int) (v_idx_779 Int) (v_idx_777 Int) (v_idx_767 Int) (v_idx_770 Int)) (let ((.cse8 (+ c_ULTIMATE.start_main_p2 1)) (.cse10 (+ 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)) (.cse9 (+ c_ULTIMATE.start_main_p4 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse4 (select |c_#memory_int| v_idx_775))) (let ((.cse3 (<= .cse8 v_idx_775)) (.cse7 (< v_idx_775 c_ULTIMATE.start_main_p2)) (.cse5 (<= (* 2 .cse4) 0)) (.cse6 (<= .cse4 0))) (let ((.cse0 (or .cse3 .cse7 (and .cse5 .cse6)))) (or (and .cse0 (<= .cse1 v_idx_777)) (and .cse0 (< v_idx_777 c_ULTIMATE.start_main_p3)) (let ((.cse2 (select |c_#memory_int| v_idx_777))) (and (<= 0 .cse2) (<= 0 (* 2 .cse2)) (or .cse3 (and (<= .cse4 .cse2) .cse5 .cse6) .cse7))))))) (or (<= .cse9 v_idx_767) (< v_idx_767 c_ULTIMATE.start_main_p4) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_767))) (or (<= .cse9 v_idx_770) (= 1 (select |c_#valid| v_idx_770)) (< v_idx_770 c_ULTIMATE.start_main_p4)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse8 c_ULTIMATE.start_main_p3) (<= .cse10 c_ULTIMATE.start_main_p4) (<= .cse10 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p4) (or (< v_idx_773 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_773) 0) (<= .cse11 v_idx_773)) (<= .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 (< v_idx_779 c_ULTIMATE.start_main_p4) (<= .cse9 v_idx_779) (= (select |c_#memory_int| v_idx_779) 0))))) (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 ((.cse15 (+ c_ULTIMATE.start_main_p2 2)) (.cse13 (+ c_ULTIMATE.start_main_p4 1)) (.cse14 (+ c_ULTIMATE.start_main_p2 1)) (.cse16 (+ c_ULTIMATE.start_main_p3 1)) (.cse17 (+ c_ULTIMATE.start_main_p1 1)) (.cse25 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (<= .cse13 v_idx_749) (< v_idx_749 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_749) 0)) (or (<= .cse13 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) (<= .cse14 c_ULTIMATE.start_main_p3) (<= .cse15 c_ULTIMATE.start_main_p4) (<= .cse15 c_ULTIMATE.start_malloc_ptr) (<= .cse16 c_ULTIMATE.start_malloc_ptr) (<= .cse16 c_ULTIMATE.start_main_p4) (or (<= .cse13 v_idx_737) (< v_idx_737 c_ULTIMATE.start_main_p4) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_737) 0)) (or (<= .cse17 v_idx_743) (= (select |c_#memory_int| v_idx_743) 0) (< v_idx_743 c_ULTIMATE.start_main_p1)) (let ((.cse24 (select |c_#memory_int| v_idx_747))) (let ((.cse20 (<= .cse16 v_idx_747)) (.cse21 (< v_idx_747 c_ULTIMATE.start_main_p3)) (.cse22 (<= 0 .cse24)) (.cse23 (<= 0 (* 2 .cse24)))) (let ((.cse18 (or .cse20 .cse21 (and .cse22 .cse23)))) (or (and (< v_idx_745 c_ULTIMATE.start_main_p2) .cse18) (let ((.cse19 (select |c_#memory_int| v_idx_745))) (and (<= (* 2 .cse19) 0) (or .cse20 .cse21 (and .cse22 .cse23 (<= .cse19 .cse24))) (<= .cse19 0))) (and (<= .cse14 v_idx_745) .cse18))))) (<= .cse17 c_ULTIMATE.start_main_p2) (<= .cse25 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse25 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 ((.cse29 (+ c_ULTIMATE.start_main_p2 2)) (.cse28 (+ c_ULTIMATE.start_main_p2 1)) (.cse26 (+ c_ULTIMATE.start_main_p4 1)) (.cse37 (+ c_ULTIMATE.start_main_p3 1)) (.cse27 (+ c_ULTIMATE.start_main_p1 1)) (.cse38 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (<= .cse26 v_idx_752) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_752)) (< v_idx_752 c_ULTIMATE.start_main_p4)) (or (<= .cse26 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 (<= .cse27 v_idx_758) (< v_idx_758 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_758) 0)) (<= .cse28 c_ULTIMATE.start_main_p3) (<= .cse29 c_ULTIMATE.start_main_p4) (<= .cse29 c_ULTIMATE.start_malloc_ptr) (let ((.cse31 (select |c_#memory_int| v_idx_760))) (let ((.cse33 (<= .cse31 0)) (.cse34 (<= (* 2 .cse31) 0)) (.cse30 (< v_idx_760 c_ULTIMATE.start_main_p2)) (.cse35 (<= .cse28 v_idx_760))) (let ((.cse36 (or (and .cse33 .cse34) .cse30 .cse35))) (or (let ((.cse32 (select |c_#memory_int| v_idx_762))) (and (or .cse30 (and (<= .cse31 .cse32) .cse33 .cse34) .cse35) (<= 0 .cse32) (<= 0 (* 2 .cse32)))) (and (< v_idx_762 c_ULTIMATE.start_main_p3) .cse36) (and (<= .cse37 v_idx_762) .cse36))))) (or (< v_idx_764 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_764) 0) (<= .cse26 v_idx_764)) (<= .cse37 c_ULTIMATE.start_malloc_ptr) (<= .cse37 c_ULTIMATE.start_main_p4) (<= .cse27 c_ULTIMATE.start_main_p2) (<= .cse38 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse38 c_ULTIMATE.start_main_p4))))) is different from false [2019-02-28 10:55:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:55:19,471 INFO L93 Difference]: Finished difference Result 28 states and 65 transitions. [2019-02-28 10:55:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:55:19,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-28 10:55:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:55:19,472 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:55:19,473 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:55:19,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-28 10:55:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:55:19,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-28 10:55:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:55:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2019-02-28 10:55:19,489 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 58 transitions. Word has length 4 [2019-02-28 10:55:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:55:19,490 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 58 transitions. [2019-02-28 10:55:19,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:55:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 58 transitions. [2019-02-28 10:55:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:55:19,491 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:55:19,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:55:19,491 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:55:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:55:19,491 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-02-28 10:55:19,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:55:19,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:19,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:55:19,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:19,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:55:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:55:19,659 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-28 10:55:19,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:19,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:55:19,660 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:55:19,660 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-28 10:55:19,661 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:55:19,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:55:39,402 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:55:39,402 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-28 10:55:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:55:39,403 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:55:39,766 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:55:41,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_863 Int) (v_idx_867 Int) (v_idx_857 Int) (v_idx_865 Int) (v_idx_869 Int) (v_idx_860 Int)) (let ((.cse16 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse18 (+ c_ULTIMATE.start_main_p4 1)) (.cse19 (+ 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) (or (< v_idx_867 c_ULTIMATE.start_main_p3) (<= .cse0 v_idx_867) (= (select |c_#memory_int| v_idx_867) 0)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (let ((.cse14 (select |c_#memory_int| v_idx_869)) (.cse12 (select |c_#memory_int| v_idx_863))) (let ((.cse2 (< v_idx_863 c_ULTIMATE.start_main_p1)) (.cse4 (<= 0 (* 2 .cse12))) (.cse5 (<= 0 .cse12)) (.cse7 (<= .cse14 .cse12)) (.cse13 (<= .cse19 v_idx_863)) (.cse8 (<= (* 2 .cse14) 0)) (.cse10 (<= .cse14 0)) (.cse6 (<= .cse18 v_idx_869)) (.cse11 (< v_idx_869 c_ULTIMATE.start_main_p4))) (let ((.cse15 (let ((.cse17 (or (and .cse8 .cse10) .cse6 .cse11))) (or (and .cse17 .cse2) (and .cse4 .cse5 (or .cse6 .cse11 (and .cse7 .cse8 .cse10))) (and .cse13 .cse17))))) (or (let ((.cse1 (select |c_#memory_int| v_idx_865))) (and (<= .cse1 0) (<= (* 2 .cse1) 0) (let ((.cse9 (<= (+ .cse14 .cse1) 0))) (let ((.cse3 (or .cse6 .cse11 (and .cse8 .cse9 .cse10)))) (or (and .cse2 .cse3) (and .cse4 .cse5 (or .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11) (<= .cse1 .cse12)) (and .cse13 .cse3)))))) (and (< v_idx_865 c_ULTIMATE.start_main_p2) .cse15) (and (<= .cse16 v_idx_865) .cse15))))) (<= .cse16 c_ULTIMATE.start_main_p3) (<= .cse20 c_ULTIMATE.start_main_p4) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (<= .cse18 v_idx_860) (= (select |c_#valid| v_idx_860) 1) (< v_idx_860 c_ULTIMATE.start_main_p4)) (<= .cse0 c_ULTIMATE.start_main_p4) (or (<= .cse18 v_idx_857) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_857) 0) (< v_idx_857 c_ULTIMATE.start_main_p4)) (<= .cse19 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-28 10:55:43,187 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-28 10:55:43,188 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:55:43,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:55:43,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2019-02-28 10:55:43,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:55:43,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:55:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:55:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-28 10:55:43,189 INFO L87 Difference]: Start difference. First operand 21 states and 58 transitions. Second operand 4 states. [2019-02-28 10:55:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:55:47,595 INFO L93 Difference]: Finished difference Result 29 states and 69 transitions. [2019-02-28 10:55:47,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:55:47,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:55:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:55:47,596 INFO L225 Difference]: With dead ends: 29 [2019-02-28 10:55:47,596 INFO L226 Difference]: Without dead ends: 22 [2019-02-28 10:55:47,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-28 10:55:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-28 10:55:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-02-28 10:55:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:55:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 50 transitions. [2019-02-28 10:55:47,617 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 50 transitions. Word has length 5 [2019-02-28 10:55:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:55:47,617 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 50 transitions. [2019-02-28 10:55:47,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:55:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 50 transitions. [2019-02-28 10:55:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:55:47,618 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:55:47,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:55:47,618 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:55:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:55:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash 29112026, now seen corresponding path program 1 times [2019-02-28 10:55:47,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:55:47,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:47,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:55:47,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:47,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:55:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:55:47,783 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-28 10:55:47,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:47,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:55:47,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:55:47,784 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-28 10:55:47,785 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:55:47,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:56:09,586 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:56:09,587 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-28 10:56:09,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:56:09,587 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:56:09,958 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:56:10,899 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)) (.cse19 (+ c_ULTIMATE.start_main_p3 1)) (.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p1 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 3)) (.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) (let ((.cse17 (select |c_#memory_int| v_idx_987)) (.cse7 (select |c_#memory_int| v_idx_983))) (let ((.cse16 (<= .cse20 v_idx_983)) (.cse14 (< v_idx_983 c_ULTIMATE.start_main_p1)) (.cse10 (<= 0 (+ .cse17 .cse7))) (.cse5 (<= 0 (* 2 .cse7))) (.cse6 (<= 0 .cse7)) (.cse12 (<= .cse19 v_idx_987)) (.cse13 (< v_idx_987 c_ULTIMATE.start_main_p3)) (.cse8 (<= 0 .cse17)) (.cse9 (<= 0 (* 2 .cse17)))) (let ((.cse2 (let ((.cse18 (or .cse12 .cse13 (and .cse8 .cse9)))) (or (and .cse18 .cse16) (and .cse18 .cse14) (and (or .cse12 .cse13 (and .cse8 .cse9 .cse10)) .cse5 .cse6))))) (or (and (< v_idx_989 c_ULTIMATE.start_main_p4) .cse2) (and .cse2 (<= .cse3 v_idx_989)) (let ((.cse4 (select |c_#memory_int| v_idx_989))) (and (<= (* 2 .cse4) 0) (let ((.cse11 (<= .cse4 .cse17))) (let ((.cse15 (or .cse12 .cse13 (and .cse8 .cse9 .cse11)))) (or (and .cse5 .cse6 (<= .cse4 .cse7) (or (and .cse8 .cse9 .cse10 .cse11) .cse12 .cse13)) (and .cse14 .cse15) (and .cse16 .cse15)))) (<= .cse4 0))))))) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (<= .cse19 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)) (<= .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) (or (<= .cse3 v_idx_980) (= (select |c_#valid| v_idx_980) 1) (< v_idx_980 c_ULTIMATE.start_main_p4))))) is different from false [2019-02-28 10:56:11,321 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)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse20 (+ c_ULTIMATE.start_main_p1 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) (let ((.cse17 (select |c_#memory_int| v_idx_1002)) (.cse14 (select |c_#memory_int| v_idx_998))) (let ((.cse16 (<= .cse20 v_idx_998)) (.cse12 (<= 0 (* 2 .cse14))) (.cse6 (<= 0 (+ .cse17 .cse14))) (.cse15 (<= 0 .cse14)) (.cse5 (< v_idx_998 c_ULTIMATE.start_main_p1)) (.cse7 (<= 0 .cse17)) (.cse9 (<= 0 (* 2 .cse17))) (.cse10 (<= .cse3 v_idx_1002)) (.cse11 (< v_idx_1002 c_ULTIMATE.start_main_p3))) (let ((.cse18 (let ((.cse19 (or (and .cse7 .cse9) .cse10 .cse11))) (or (and .cse16 .cse19) (and .cse12 (or (and .cse6 .cse7 .cse9) .cse10 .cse11) .cse15) (and .cse19 .cse5))))) (or (let ((.cse13 (select |c_#memory_int| v_idx_1004))) (and (let ((.cse8 (<= .cse13 .cse17))) (let ((.cse4 (or .cse10 (and .cse7 .cse8 .cse9) .cse11))) (or (and .cse4 .cse5) (and (or (and .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) .cse12 (<= .cse13 .cse14) .cse15) (and .cse16 .cse4)))) (<= (* 2 .cse13) 0) (<= .cse13 0))) (and .cse18 (< v_idx_1004 c_ULTIMATE.start_main_p4)) (and .cse18 (<= .cse0 v_idx_1004)))))) (<= .cse20 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)) (<= .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-28 10:56:11,924 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-28 10:56:11,924 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:56:11,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:56:11,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-02-28 10:56:11,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:56:11,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:56:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:56:11,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 10:56:11,926 INFO L87 Difference]: Start difference. First operand 19 states and 50 transitions. Second operand 5 states. [2019-02-28 10:56:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:56:22,837 INFO L93 Difference]: Finished difference Result 28 states and 65 transitions. [2019-02-28 10:56:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:56:22,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 10:56:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:56:22,838 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:56:22,838 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:56:22,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 10:56:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:56:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2019-02-28 10:56:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:56:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-28 10:56:22,856 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 5 [2019-02-28 10:56:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:56:22,856 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-28 10:56:22,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:56:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-28 10:56:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:56:22,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:56:22,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:56:22,857 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:56:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:56:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-28 10:56:22,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:56:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:56:22,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:56:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:56:22,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:56:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:56:23,064 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-28 10:56:23,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:56:23,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:56:23,065 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:56:23,065 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-28 10:56:23,067 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:56:23,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:56:42,329 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:56:42,329 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-28 10:56:42,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:56:42,330 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:56:42,716 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:56:43,956 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1103 Int) (v_idx_1100 Int) (v_idx_1097 Int) (v_idx_1109 Int) (v_idx_1107 Int) (v_idx_1105 Int)) (let ((.cse18 (+ c_ULTIMATE.start_main_p2 1)) (.cse19 (+ c_ULTIMATE.start_main_p2 2)) (.cse17 (+ c_ULTIMATE.start_main_p3 1)) (.cse1 (+ c_ULTIMATE.start_main_p4 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) (let ((.cse15 (select |c_#memory_int| v_idx_1107)) (.cse13 (select |c_#memory_int| v_idx_1105))) (let ((.cse4 (<= .cse13 0)) (.cse11 (<= (* 2 .cse13) 0)) (.cse9 (<= .cse13 .cse15)) (.cse3 (<= .cse18 v_idx_1105)) (.cse14 (< v_idx_1105 c_ULTIMATE.start_main_p2)) (.cse5 (<= .cse17 v_idx_1107)) (.cse6 (< v_idx_1107 c_ULTIMATE.start_main_p3)) (.cse8 (<= 0 (* 2 .cse15))) (.cse10 (<= 0 .cse15))) (let ((.cse0 (let ((.cse16 (or .cse5 .cse6 (and .cse8 .cse10)))) (or (and .cse4 .cse11 (or (and .cse8 .cse9 .cse10) .cse5 .cse6)) (and .cse16 .cse3) (and .cse14 .cse16))))) (or (and .cse0 (<= .cse1 v_idx_1109)) (let ((.cse12 (select |c_#memory_int| v_idx_1109))) (and (let ((.cse7 (<= .cse12 .cse15))) (let ((.cse2 (or .cse5 .cse6 (and .cse7 .cse8 .cse10)))) (or (and .cse2 .cse3) (and .cse4 (or .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) .cse11 (<= (+ .cse12 .cse13) 0)) (and .cse2 .cse14)))) (<= .cse12 0) (<= (* 2 .cse12) 0))) (and .cse0 (< v_idx_1109 c_ULTIMATE.start_main_p4)))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse18 c_ULTIMATE.start_main_p3) (<= .cse19 c_ULTIMATE.start_main_p4) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_1100 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1100)) (<= .cse1 v_idx_1100)) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (<= .cse17 c_ULTIMATE.start_main_p4) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1097) 0) (< v_idx_1097 c_ULTIMATE.start_main_p4) (<= .cse1 v_idx_1097)) (<= .cse20 c_ULTIMATE.start_main_p2) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_1103) 0) (<= .cse20 v_idx_1103) (< v_idx_1103 c_ULTIMATE.start_main_p1)) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-28 10:56:44,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1115 Int) (v_idx_1124 Int) (v_idx_1112 Int) (v_idx_1122 Int) (v_idx_1120 Int) (v_idx_1118 Int)) (let ((.cse18 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p2 2)) (.cse19 (+ c_ULTIMATE.start_main_p3 1)) (.cse16 (+ c_ULTIMATE.start_main_p4 1)) (.cse0 (+ 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 (< v_idx_1118 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_1118) (= (select |c_#memory_int| v_idx_1118) 0)) (let ((.cse15 (select |c_#memory_int| v_idx_1120)) (.cse3 (select |c_#memory_int| v_idx_1122))) (let ((.cse12 (<= .cse19 v_idx_1122)) (.cse4 (<= 0 .cse3)) (.cse11 (<= 0 (* 2 .cse3))) (.cse7 (<= .cse15 .cse3)) (.cse14 (< v_idx_1122 c_ULTIMATE.start_main_p3)) (.cse8 (<= .cse15 0)) (.cse9 (<= (* 2 .cse15) 0)) (.cse5 (<= .cse18 v_idx_1120)) (.cse6 (< v_idx_1120 c_ULTIMATE.start_main_p2))) (let ((.cse1 (let ((.cse17 (or (and .cse8 .cse9) .cse5 .cse6))) (or (and .cse12 .cse17) (and .cse4 .cse11 (or .cse5 .cse6 (and .cse7 .cse8 .cse9))) (and .cse14 .cse17))))) (or (and .cse1 (< v_idx_1124 c_ULTIMATE.start_main_p4)) (let ((.cse2 (select |c_#memory_int| v_idx_1124))) (and (<= .cse2 0) (let ((.cse10 (<= (+ .cse15 .cse2) 0))) (let ((.cse13 (or (and .cse8 .cse9 .cse10) .cse5 .cse6))) (or (and (<= .cse2 .cse3) .cse4 (or .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) .cse11) (and .cse12 .cse13) (and .cse14 .cse13)))) (<= (* 2 .cse2) 0))) (and (<= .cse16 v_idx_1124) .cse1))))) (<= .cse18 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 (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1112)) (<= .cse16 v_idx_1112) (< v_idx_1112 c_ULTIMATE.start_main_p4)) (or (= (select |c_#valid| v_idx_1115) 1) (<= .cse16 v_idx_1115) (< v_idx_1115 c_ULTIMATE.start_main_p4)) (<= .cse0 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-28 10:56:44,666 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-28 10:56:44,667 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:56:44,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:56:44,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-02-28 10:56:44,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:56:44,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:56:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:56:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 10:56:44,668 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 5 states. [2019-02-28 10:56:46,439 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_1103 Int) (v_idx_1100 Int) (v_idx_1097 Int) (v_idx_1109 Int) (v_idx_1107 Int) (v_idx_1105 Int)) (let ((.cse18 (+ c_ULTIMATE.start_main_p2 1)) (.cse19 (+ c_ULTIMATE.start_main_p2 2)) (.cse17 (+ c_ULTIMATE.start_main_p3 1)) (.cse1 (+ c_ULTIMATE.start_main_p4 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) (let ((.cse15 (select |c_#memory_int| v_idx_1107)) (.cse13 (select |c_#memory_int| v_idx_1105))) (let ((.cse4 (<= .cse13 0)) (.cse11 (<= (* 2 .cse13) 0)) (.cse9 (<= .cse13 .cse15)) (.cse3 (<= .cse18 v_idx_1105)) (.cse14 (< v_idx_1105 c_ULTIMATE.start_main_p2)) (.cse5 (<= .cse17 v_idx_1107)) (.cse6 (< v_idx_1107 c_ULTIMATE.start_main_p3)) (.cse8 (<= 0 (* 2 .cse15))) (.cse10 (<= 0 .cse15))) (let ((.cse0 (let ((.cse16 (or .cse5 .cse6 (and .cse8 .cse10)))) (or (and .cse4 .cse11 (or (and .cse8 .cse9 .cse10) .cse5 .cse6)) (and .cse16 .cse3) (and .cse14 .cse16))))) (or (and .cse0 (<= .cse1 v_idx_1109)) (let ((.cse12 (select |c_#memory_int| v_idx_1109))) (and (let ((.cse7 (<= .cse12 .cse15))) (let ((.cse2 (or .cse5 .cse6 (and .cse7 .cse8 .cse10)))) (or (and .cse2 .cse3) (and .cse4 (or .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) .cse11 (<= (+ .cse12 .cse13) 0)) (and .cse2 .cse14)))) (<= .cse12 0) (<= (* 2 .cse12) 0))) (and .cse0 (< v_idx_1109 c_ULTIMATE.start_main_p4)))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse18 c_ULTIMATE.start_main_p3) (<= .cse19 c_ULTIMATE.start_main_p4) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_1100 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1100)) (<= .cse1 v_idx_1100)) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (<= .cse17 c_ULTIMATE.start_main_p4) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1097) 0) (< v_idx_1097 c_ULTIMATE.start_main_p4) (<= .cse1 v_idx_1097)) (<= .cse20 c_ULTIMATE.start_main_p2) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_1103) 0) (<= .cse20 v_idx_1103) (< v_idx_1103 c_ULTIMATE.start_main_p1)) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) (forall ((v_idx_1088 Int) (v_idx_1085 Int) (v_idx_1094 Int) (v_idx_1082 Int) (v_idx_1092 Int) (v_idx_1090 Int)) (let ((.cse39 (+ c_ULTIMATE.start_main_p2 1)) (.cse41 (+ c_ULTIMATE.start_main_p2 2)) (.cse37 (+ c_ULTIMATE.start_main_p3 1)) (.cse40 (+ c_ULTIMATE.start_main_p4 1)) (.cse42 (+ 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 ((.cse25 (select |c_#memory_int| v_idx_1094)) (.cse35 (select |c_#memory_int| v_idx_1090))) (let ((.cse23 (<= .cse40 v_idx_1094)) (.cse34 (< v_idx_1094 c_ULTIMATE.start_main_p4)) (.cse33 (<= (+ .cse25 .cse35) 0)) (.cse26 (<= .cse25 0)) (.cse27 (<= (* 2 .cse25) 0)) (.cse28 (< v_idx_1090 c_ULTIMATE.start_main_p2)) (.cse31 (<= (* 2 .cse35) 0)) (.cse32 (<= .cse35 0)) (.cse29 (<= .cse39 v_idx_1090))) (let ((.cse36 (let ((.cse38 (or .cse28 (and .cse31 .cse32) .cse29))) (or (and .cse23 .cse38) (and .cse38 .cse34) (and (or .cse28 .cse29 (and .cse31 .cse32 .cse33)) .cse26 .cse27))))) (or (let ((.cse22 (select |c_#memory_int| v_idx_1092))) (and (<= 0 .cse22) (<= 0 (* 2 .cse22)) (let ((.cse30 (<= .cse35 .cse22))) (let ((.cse24 (or .cse28 (and .cse30 .cse31 .cse32) .cse29))) (or (and .cse23 .cse24) (and (<= .cse25 .cse22) .cse26 .cse27 (or .cse28 .cse29 (and .cse30 .cse31 .cse32 .cse33))) (and .cse24 .cse34)))))) (and .cse36 (< v_idx_1092 c_ULTIMATE.start_main_p3)) (and (<= .cse37 v_idx_1092) .cse36))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (<= .cse40 v_idx_1085) (= (select |c_#valid| v_idx_1085) 1) (< v_idx_1085 c_ULTIMATE.start_main_p4)) (<= .cse39 c_ULTIMATE.start_main_p3) (<= .cse41 c_ULTIMATE.start_main_p4) (<= .cse41 c_ULTIMATE.start_malloc_ptr) (<= .cse37 c_ULTIMATE.start_malloc_ptr) (or (<= .cse42 v_idx_1088) (= (select |c_#memory_int| v_idx_1088) 0) (< v_idx_1088 c_ULTIMATE.start_main_p1)) (<= .cse37 c_ULTIMATE.start_main_p4) (or (<= .cse40 v_idx_1082) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1082)) (< v_idx_1082 c_ULTIMATE.start_main_p4)) (<= .cse42 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_1115 Int) (v_idx_1124 Int) (v_idx_1112 Int) (v_idx_1122 Int) (v_idx_1120 Int) (v_idx_1118 Int)) (let ((.cse62 (+ c_ULTIMATE.start_main_p2 1)) (.cse64 (+ c_ULTIMATE.start_main_p2 2)) (.cse63 (+ c_ULTIMATE.start_main_p3 1)) (.cse60 (+ c_ULTIMATE.start_main_p4 1)) (.cse44 (+ 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 (< v_idx_1118 c_ULTIMATE.start_main_p1) (<= .cse44 v_idx_1118) (= (select |c_#memory_int| v_idx_1118) 0)) (let ((.cse59 (select |c_#memory_int| v_idx_1120)) (.cse47 (select |c_#memory_int| v_idx_1122))) (let ((.cse56 (<= .cse63 v_idx_1122)) (.cse48 (<= 0 .cse47)) (.cse55 (<= 0 (* 2 .cse47))) (.cse51 (<= .cse59 .cse47)) (.cse58 (< v_idx_1122 c_ULTIMATE.start_main_p3)) (.cse52 (<= .cse59 0)) (.cse53 (<= (* 2 .cse59) 0)) (.cse49 (<= .cse62 v_idx_1120)) (.cse50 (< v_idx_1120 c_ULTIMATE.start_main_p2))) (let ((.cse45 (let ((.cse61 (or (and .cse52 .cse53) .cse49 .cse50))) (or (and .cse56 .cse61) (and .cse48 .cse55 (or .cse49 .cse50 (and .cse51 .cse52 .cse53))) (and .cse58 .cse61))))) (or (and .cse45 (< v_idx_1124 c_ULTIMATE.start_main_p4)) (let ((.cse46 (select |c_#memory_int| v_idx_1124))) (and (<= .cse46 0) (let ((.cse54 (<= (+ .cse59 .cse46) 0))) (let ((.cse57 (or (and .cse52 .cse53 .cse54) .cse49 .cse50))) (or (and (<= .cse46 .cse47) .cse48 (or .cse49 .cse50 (and .cse51 .cse52 .cse53 .cse54)) .cse55) (and .cse56 .cse57) (and .cse58 .cse57)))) (<= (* 2 .cse46) 0))) (and (<= .cse60 v_idx_1124) .cse45))))) (<= .cse62 c_ULTIMATE.start_main_p3) (<= .cse64 c_ULTIMATE.start_main_p4) (<= .cse64 c_ULTIMATE.start_malloc_ptr) (<= .cse63 c_ULTIMATE.start_malloc_ptr) (<= .cse63 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1112)) (<= .cse60 v_idx_1112) (< v_idx_1112 c_ULTIMATE.start_main_p4)) (or (= (select |c_#valid| v_idx_1115) 1) (<= .cse60 v_idx_1115) (< v_idx_1115 c_ULTIMATE.start_main_p4)) (<= .cse44 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-28 10:56:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:56:58,757 INFO L93 Difference]: Finished difference Result 27 states and 63 transitions. [2019-02-28 10:56:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:56:58,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 10:56:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:56:58,758 INFO L225 Difference]: With dead ends: 27 [2019-02-28 10:56:58,758 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:56:58,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-28 10:56:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:56:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2019-02-28 10:56:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:56:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-28 10:56:58,782 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 5 [2019-02-28 10:56:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:56:58,782 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-28 10:56:58,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:56:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-28 10:56:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:56:58,782 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:56:58,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:56:58,783 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:56:58,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:56:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash 28817960, now seen corresponding path program 1 times [2019-02-28 10:56:58,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:56:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:56:58,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:56:58,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:56:58,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:56:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:56:59,031 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-02-28 10:56:59,096 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-28 10:56:59,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:56:59,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:56:59,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:56:59,097 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [19] [2019-02-28 10:56:59,098 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:56:59,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:57:18,744 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:57:18,744 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-28 10:57:18,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:57:18,744 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:57:19,104 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:57:19,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1225 Int) (v_idx_1223 Int) (v_idx_1220 Int) (v_idx_1229 Int) (v_idx_1217 Int) (v_idx_1227 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse5 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (<= .cse0 v_idx_1217) (< v_idx_1217 c_ULTIMATE.start_main_p4) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1217) 0)) (or (= 1 (select |c_#valid| v_idx_1220)) (< v_idx_1220 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_1220)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (< v_idx_1229 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_1229) 0) (<= .cse0 v_idx_1229)) (<= .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) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse5 c_ULTIMATE.start_main_p4) (let ((.cse16 (select |c_#memory_int| v_idx_1225)) (.cse19 (select |c_#memory_int| v_idx_1223))) (let ((.cse7 (<= .cse1 v_idx_1225)) (.cse9 (< v_idx_1225 c_ULTIMATE.start_main_p2)) (.cse13 (<= .cse16 .cse19)) (.cse17 (<= (* 2 .cse16) 0)) (.cse18 (<= .cse16 0)) (.cse14 (< v_idx_1223 c_ULTIMATE.start_main_p1)) (.cse10 (<= 0 .cse19)) (.cse11 (<= 0 (* 2 .cse19))) (.cse15 (<= .cse4 v_idx_1223))) (let ((.cse20 (let ((.cse21 (or .cse14 (and .cse10 .cse11) .cse15))) (or (and .cse7 .cse21) (and .cse21 .cse9) (and (or .cse14 (and .cse10 .cse11 .cse13) .cse15) .cse17 .cse18))))) (or (let ((.cse6 (select |c_#memory_int| v_idx_1227))) (and (<= 0 (* 2 .cse6)) (let ((.cse12 (<= 0 (+ .cse19 .cse6)))) (let ((.cse8 (or .cse14 (and .cse10 .cse11 .cse12) .cse15))) (or (and .cse7 .cse8) (and .cse9 .cse8) (and (or (and .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (<= .cse16 .cse6) .cse17 .cse18)))) (<= 0 .cse6))) (and (<= .cse3 v_idx_1227) .cse20) (and (< v_idx_1227 c_ULTIMATE.start_main_p3) .cse20)))))))) is different from false [2019-02-28 10:57:20,349 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 ((.cse17 (+ 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)) (.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_1240)) (.cse3 (select |c_#memory_int| v_idx_1238))) (let ((.cse13 (<= .cse18 v_idx_1238)) (.cse14 (< v_idx_1238 c_ULTIMATE.start_main_p1)) (.cse4 (<= 0 .cse3)) (.cse8 (<= .cse15 .cse3)) (.cse5 (<= 0 (* 2 .cse3))) (.cse7 (<= .cse15 0)) (.cse9 (<= (* 2 .cse15) 0)) (.cse6 (< v_idx_1240 c_ULTIMATE.start_main_p2)) (.cse11 (<= .cse17 v_idx_1240))) (let ((.cse0 (let ((.cse16 (or (and .cse7 .cse9) .cse6 .cse11))) (or (and .cse16 .cse13) (and .cse16 .cse14) (and .cse4 (or .cse6 (and .cse7 .cse8 .cse9) .cse11) .cse5))))) (or (and .cse0 (<= .cse1 v_idx_1242)) (let ((.cse2 (select |c_#memory_int| v_idx_1242))) (and (<= 0 (* 2 .cse2)) (let ((.cse10 (<= .cse15 .cse2))) (let ((.cse12 (or (and .cse7 .cse9 .cse10) .cse6 .cse11))) (or (and (<= 0 (+ .cse3 .cse2)) .cse4 .cse5 (or .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11)) (and .cse12 .cse13) (and .cse12 .cse14)))) (<= 0 .cse2))) (and (< v_idx_1242 c_ULTIMATE.start_main_p3) .cse0))))) (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) (<= .cse17 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)) (<= .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-28 10:57:20,738 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)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse19 (+ 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 ((.cse17 (select |c_#memory_int| v_idx_1255)) (.cse6 (select |c_#memory_int| v_idx_1257))) (let ((.cse5 (<= .cse3 v_idx_1257)) (.cse16 (< v_idx_1257 c_ULTIMATE.start_main_p3)) (.cse11 (<= .cse17 .cse6)) (.cse8 (<= 0 (* 2 .cse6))) (.cse15 (<= 0 .cse6)) (.cse9 (< v_idx_1255 c_ULTIMATE.start_main_p2)) (.cse10 (<= (* 2 .cse17) 0)) (.cse12 (<= .cse17 0)) (.cse14 (<= .cse1 v_idx_1255))) (let ((.cse18 (let ((.cse20 (or .cse9 (and .cse10 .cse12) .cse14))) (or (and .cse5 .cse20) (and .cse16 .cse20) (and (or .cse9 (and .cse10 .cse11 .cse12) .cse14) .cse8 .cse15))))) (or (let ((.cse7 (select |c_#memory_int| v_idx_1253))) (and (let ((.cse13 (<= .cse17 .cse7))) (let ((.cse4 (or .cse9 (and .cse10 .cse12 .cse13) .cse14))) (or (and .cse4 .cse5) (and (<= 0 (+ .cse6 .cse7)) .cse8 (or .cse9 (and .cse10 .cse11 .cse12 .cse13) .cse14) .cse15) (and .cse16 .cse4)))) (<= 0 (* 2 .cse7)) (<= 0 .cse7))) (and .cse18 (<= .cse19 v_idx_1253)) (and .cse18 (< v_idx_1253 c_ULTIMATE.start_main_p1)))))) (<= .cse19 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-28 10:57:20,746 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-28 10:57:20,747 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:57:20,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:57:20,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2019-02-28 10:57:20,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:57:20,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:57:20,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:57:20,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-28 10:57:20,748 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-28 10:57:22,452 WARN L838 $PredicateComparison]: unable to prove that (and (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 ((.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse19 (+ c_ULTIMATE.start_main_p2 2)) (.cse17 (+ c_ULTIMATE.start_main_p3 1)) (.cse20 (+ c_ULTIMATE.start_main_p4 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 ((.cse13 (select |c_#memory_int| v_idx_1208)) (.cse15 (select |c_#memory_int| v_idx_1212))) (let ((.cse8 (<= 0 (+ .cse13 .cse15))) (.cse11 (<= 0 .cse13)) (.cse12 (<= 0 (* 2 .cse13))) (.cse4 (<= .cse18 v_idx_1208)) (.cse14 (< v_idx_1208 c_ULTIMATE.start_main_p1)) (.cse5 (< v_idx_1212 c_ULTIMATE.start_main_p3)) (.cse9 (<= 0 .cse15)) (.cse10 (<= 0 (* 2 .cse15))) (.cse6 (<= .cse17 v_idx_1212))) (let ((.cse1 (let ((.cse16 (or .cse5 (and .cse9 .cse10) .cse6))) (or (and (or .cse5 (and .cse8 .cse9 .cse10) .cse6) .cse11 .cse12) (and .cse4 .cse16) (and .cse14 .cse16))))) (or (and (<= .cse0 v_idx_1210) .cse1) (and .cse1 (< v_idx_1210 c_ULTIMATE.start_main_p2)) (let ((.cse2 (select |c_#memory_int| v_idx_1210))) (and (<= (* 2 .cse2) 0) (<= .cse2 0) (let ((.cse7 (<= .cse2 .cse15))) (let ((.cse3 (or .cse5 .cse6 (and .cse7 .cse9 .cse10)))) (or (and .cse3 .cse4) (and (or .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) .cse11 .cse12 (<= .cse2 .cse13)) (and .cse3 .cse14)))))))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse0 c_ULTIMATE.start_main_p3) (<= .cse19 c_ULTIMATE.start_main_p4) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (<= .cse17 c_ULTIMATE.start_main_p4) (or (<= .cse20 v_idx_1202) (< v_idx_1202 c_ULTIMATE.start_main_p4) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1202) 0)) (or (<= .cse20 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) (<= .cse20 v_idx_1205) (< v_idx_1205 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_1225 Int) (v_idx_1223 Int) (v_idx_1220 Int) (v_idx_1229 Int) (v_idx_1217 Int) (v_idx_1227 Int)) (let ((.cse22 (+ c_ULTIMATE.start_main_p4 1)) (.cse24 (+ c_ULTIMATE.start_main_p2 2)) (.cse27 (+ c_ULTIMATE.start_main_p1 3)) (.cse25 (+ c_ULTIMATE.start_main_p3 1)) (.cse26 (+ c_ULTIMATE.start_main_p1 1)) (.cse23 (+ c_ULTIMATE.start_main_p2 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (<= .cse22 v_idx_1217) (< v_idx_1217 c_ULTIMATE.start_main_p4) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1217) 0)) (or (= 1 (select |c_#valid| v_idx_1220)) (< v_idx_1220 c_ULTIMATE.start_main_p4) (<= .cse22 v_idx_1220)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (< v_idx_1229 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_1229) 0) (<= .cse22 v_idx_1229)) (<= .cse23 c_ULTIMATE.start_main_p3) (<= .cse24 c_ULTIMATE.start_main_p4) (<= .cse24 c_ULTIMATE.start_malloc_ptr) (<= .cse25 c_ULTIMATE.start_malloc_ptr) (<= .cse25 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) (let ((.cse38 (select |c_#memory_int| v_idx_1225)) (.cse41 (select |c_#memory_int| v_idx_1223))) (let ((.cse29 (<= .cse23 v_idx_1225)) (.cse31 (< v_idx_1225 c_ULTIMATE.start_main_p2)) (.cse35 (<= .cse38 .cse41)) (.cse39 (<= (* 2 .cse38) 0)) (.cse40 (<= .cse38 0)) (.cse36 (< v_idx_1223 c_ULTIMATE.start_main_p1)) (.cse32 (<= 0 .cse41)) (.cse33 (<= 0 (* 2 .cse41))) (.cse37 (<= .cse26 v_idx_1223))) (let ((.cse42 (let ((.cse43 (or .cse36 (and .cse32 .cse33) .cse37))) (or (and .cse29 .cse43) (and .cse43 .cse31) (and (or .cse36 (and .cse32 .cse33 .cse35) .cse37) .cse39 .cse40))))) (or (let ((.cse28 (select |c_#memory_int| v_idx_1227))) (and (<= 0 (* 2 .cse28)) (let ((.cse34 (<= 0 (+ .cse41 .cse28)))) (let ((.cse30 (or .cse36 (and .cse32 .cse33 .cse34) .cse37))) (or (and .cse29 .cse30) (and .cse31 .cse30) (and (or (and .cse32 .cse33 .cse34 .cse35) .cse36 .cse37) (<= .cse38 .cse28) .cse39 .cse40)))) (<= 0 .cse28))) (and (<= .cse25 v_idx_1227) .cse42) (and (< v_idx_1227 c_ULTIMATE.start_main_p3) .cse42)))))))) (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 ((.cse61 (+ c_ULTIMATE.start_main_p2 1)) (.cse64 (+ c_ULTIMATE.start_main_p2 2)) (.cse45 (+ c_ULTIMATE.start_main_p3 1)) (.cse63 (+ c_ULTIMATE.start_main_p4 1)) (.cse62 (+ 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) (let ((.cse59 (select |c_#memory_int| v_idx_1240)) (.cse47 (select |c_#memory_int| v_idx_1238))) (let ((.cse57 (<= .cse62 v_idx_1238)) (.cse58 (< v_idx_1238 c_ULTIMATE.start_main_p1)) (.cse48 (<= 0 .cse47)) (.cse52 (<= .cse59 .cse47)) (.cse49 (<= 0 (* 2 .cse47))) (.cse51 (<= .cse59 0)) (.cse53 (<= (* 2 .cse59) 0)) (.cse50 (< v_idx_1240 c_ULTIMATE.start_main_p2)) (.cse55 (<= .cse61 v_idx_1240))) (let ((.cse44 (let ((.cse60 (or (and .cse51 .cse53) .cse50 .cse55))) (or (and .cse60 .cse57) (and .cse60 .cse58) (and .cse48 (or .cse50 (and .cse51 .cse52 .cse53) .cse55) .cse49))))) (or (and .cse44 (<= .cse45 v_idx_1242)) (let ((.cse46 (select |c_#memory_int| v_idx_1242))) (and (<= 0 (* 2 .cse46)) (let ((.cse54 (<= .cse59 .cse46))) (let ((.cse56 (or (and .cse51 .cse53 .cse54) .cse50 .cse55))) (or (and (<= 0 (+ .cse47 .cse46)) .cse48 .cse49 (or .cse50 (and .cse51 .cse52 .cse53 .cse54) .cse55)) (and .cse56 .cse57) (and .cse56 .cse58)))) (<= 0 .cse46))) (and (< v_idx_1242 c_ULTIMATE.start_main_p3) .cse44))))) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1232) 0) (< v_idx_1232 c_ULTIMATE.start_main_p4) (<= .cse63 v_idx_1232)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse61 c_ULTIMATE.start_main_p3) (<= .cse64 c_ULTIMATE.start_main_p4) (or (<= .cse63 v_idx_1244) (= (select |c_#memory_int| v_idx_1244) 0) (< v_idx_1244 c_ULTIMATE.start_main_p4)) (<= .cse64 c_ULTIMATE.start_malloc_ptr) (<= .cse45 c_ULTIMATE.start_malloc_ptr) (<= .cse45 c_ULTIMATE.start_main_p4) (or (<= .cse63 v_idx_1235) (= (select |c_#valid| v_idx_1235) 1) (< v_idx_1235 c_ULTIMATE.start_main_p4)) (<= .cse62 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)))) (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 ((.cse68 (+ c_ULTIMATE.start_main_p2 2)) (.cse66 (+ c_ULTIMATE.start_main_p4 1)) (.cse67 (+ c_ULTIMATE.start_main_p2 1)) (.cse69 (+ c_ULTIMATE.start_main_p3 1)) (.cse85 (+ c_ULTIMATE.start_main_p1 1)) (.cse87 (+ 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) (<= .cse66 v_idx_1247)) (<= .cse67 c_ULTIMATE.start_main_p3) (<= .cse68 c_ULTIMATE.start_main_p4) (or (< v_idx_1259 c_ULTIMATE.start_main_p4) (= 0 (select |c_#memory_int| v_idx_1259)) (<= .cse66 v_idx_1259)) (<= .cse68 c_ULTIMATE.start_malloc_ptr) (<= .cse69 c_ULTIMATE.start_malloc_ptr) (<= .cse69 c_ULTIMATE.start_main_p4) (or (<= .cse66 v_idx_1250) (= 1 (select |c_#valid| v_idx_1250)) (< v_idx_1250 c_ULTIMATE.start_main_p4)) (let ((.cse83 (select |c_#memory_int| v_idx_1255)) (.cse72 (select |c_#memory_int| v_idx_1257))) (let ((.cse71 (<= .cse69 v_idx_1257)) (.cse82 (< v_idx_1257 c_ULTIMATE.start_main_p3)) (.cse77 (<= .cse83 .cse72)) (.cse74 (<= 0 (* 2 .cse72))) (.cse81 (<= 0 .cse72)) (.cse75 (< v_idx_1255 c_ULTIMATE.start_main_p2)) (.cse76 (<= (* 2 .cse83) 0)) (.cse78 (<= .cse83 0)) (.cse80 (<= .cse67 v_idx_1255))) (let ((.cse84 (let ((.cse86 (or .cse75 (and .cse76 .cse78) .cse80))) (or (and .cse71 .cse86) (and .cse82 .cse86) (and (or .cse75 (and .cse76 .cse77 .cse78) .cse80) .cse74 .cse81))))) (or (let ((.cse73 (select |c_#memory_int| v_idx_1253))) (and (let ((.cse79 (<= .cse83 .cse73))) (let ((.cse70 (or .cse75 (and .cse76 .cse78 .cse79) .cse80))) (or (and .cse70 .cse71) (and (<= 0 (+ .cse72 .cse73)) .cse74 (or .cse75 (and .cse76 .cse77 .cse78 .cse79) .cse80) .cse81) (and .cse82 .cse70)))) (<= 0 (* 2 .cse73)) (<= 0 .cse73))) (and .cse84 (<= .cse85 v_idx_1253)) (and .cse84 (< v_idx_1253 c_ULTIMATE.start_main_p1)))))) (<= .cse85 c_ULTIMATE.start_main_p2) (<= .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-28 10:57:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:57:59,904 INFO L93 Difference]: Finished difference Result 31 states and 79 transitions. [2019-02-28 10:57:59,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:57:59,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-28 10:57:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:57:59,905 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:57:59,905 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:57:59,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=11, Invalid=7, Unknown=4, NotChecked=20, Total=42 [2019-02-28 10:57:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:57:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-28 10:57:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:57:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 72 transitions. [2019-02-28 10:57:59,959 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 72 transitions. Word has length 5 [2019-02-28 10:57:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:57:59,959 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 72 transitions. [2019-02-28 10:57:59,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:57:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 72 transitions. [2019-02-28 10:57:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:57:59,960 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:57:59,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:57:59,961 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:57:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:57:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash 902468826, now seen corresponding path program 1 times [2019-02-28 10:57:59,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:57:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:57:59,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:57:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:57:59,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:57:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:58:00,152 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-28 10:58:00,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:58:00,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:58:00,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:58:00,152 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-28 10:58:00,153 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:58:00,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:58:30,361 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:58:30,361 INFO L272 AbstractInterpreter]: Visited 6 different actions 86 times. Merged at 4 different actions 16 times. Widened at 4 different actions 12 times. Found 52 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:58:30,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:58:30,362 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:58:30,821 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:58:31,433 WARN L838 $PredicateComparison]: unable to prove that (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 ((.cse25 (+ c_ULTIMATE.start_main_p2 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 2)) (.cse31 (+ c_ULTIMATE.start_main_p3 1)) (.cse29 (+ c_ULTIMATE.start_main_p1 1)) (.cse30 (+ 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) (let ((.cse22 (select |c_#memory_int| v_idx_1343)) (.cse23 (select |c_#memory_int| v_idx_1349)) (.cse3 (select |c_#memory_int| v_idx_1347))) (let ((.cse1 (< v_idx_1347 c_ULTIMATE.start_main_p3)) (.cse20 (<= .cse31 v_idx_1347)) (.cse4 (<= 0 .cse3)) (.cse14 (<= .cse23 .cse3)) (.cse11 (<= 0 (+ .cse3 .cse22))) (.cse19 (<= 0 (* 2 .cse3))) (.cse18 (<= .cse30 v_idx_1349)) (.cse10 (<= .cse23 .cse22)) (.cse13 (<= (* 2 .cse23) 0)) (.cse15 (<= .cse23 0)) (.cse16 (< v_idx_1349 c_ULTIMATE.start_main_p4)) (.cse6 (<= .cse29 v_idx_1343)) (.cse7 (<= 0 .cse22)) (.cse8 (<= 0 (* 2 .cse22))) (.cse12 (< v_idx_1343 c_ULTIMATE.start_main_p1))) (let ((.cse24 (let ((.cse26 (let ((.cse28 (or .cse6 (and .cse7 .cse8) .cse12))) (or (and .cse28 .cse18) (and (or .cse6 (and .cse7 .cse8 .cse10) .cse12) .cse13 .cse15) (and .cse16 .cse28))))) (or (and .cse26 .cse1) (and .cse26 .cse20) (and .cse4 (let ((.cse27 (or .cse6 (and .cse7 .cse8 .cse11) .cse12))) (or (and .cse27 .cse18) (and (or .cse6 (and .cse7 .cse8 .cse10 .cse11) .cse12) .cse13 .cse14 .cse15) (and .cse16 .cse27))) .cse19))))) (or (let ((.cse0 (select |c_#memory_int| v_idx_1345))) (and (<= (* 2 .cse0) 0) (let ((.cse5 (<= (+ .cse0 .cse23) 0)) (.cse9 (<= .cse0 .cse22))) (let ((.cse2 (let ((.cse21 (or .cse6 (and .cse7 .cse8 .cse9) .cse12))) (or (and .cse5 .cse13 (or .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse12) .cse15) (and .cse16 .cse21) (and .cse21 .cse18))))) (or (and .cse1 .cse2) (and (<= .cse0 .cse3) .cse4 (let ((.cse17 (or .cse6 (and .cse7 .cse8 .cse9 .cse11) .cse12))) (or (and .cse5 (or .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) .cse13 .cse14 .cse15) (and .cse16 .cse17) (and .cse17 .cse18))) .cse19) (and .cse20 .cse2)))) (<= .cse0 0))) (and .cse24 (<= .cse25 v_idx_1345)) (and .cse24 (< v_idx_1345 c_ULTIMATE.start_main_p2)))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse25 c_ULTIMATE.start_main_p3) (<= .cse32 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) (<= .cse30 v_idx_1337)) (<= .cse32 c_ULTIMATE.start_malloc_ptr) (<= .cse31 c_ULTIMATE.start_malloc_ptr) (<= .cse31 c_ULTIMATE.start_main_p4) (<= .cse29 c_ULTIMATE.start_main_p2) (or (< v_idx_1340 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1340)) (<= .cse30 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)))) is different from false [2019-02-28 10:58:32,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1355 Int) (v_idx_1364 Int) (v_idx_1352 Int) (v_idx_1362 Int) (v_idx_1360 Int) (v_idx_1358 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse25 (+ c_ULTIMATE.start_main_p2 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 2)) (.cse30 (+ c_ULTIMATE.start_main_p3 1)) (.cse31 (+ 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) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1352)) (< v_idx_1352 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_1352)) (let ((.cse19 (select |c_#memory_int| v_idx_1362)) (.cse23 (select |c_#memory_int| v_idx_1364)) (.cse24 (select |c_#memory_int| v_idx_1358))) (let ((.cse10 (<= .cse23 .cse24)) (.cse17 (<= 0 (+ .cse19 .cse24))) (.cse8 (<= 0 (* 2 .cse24))) (.cse16 (<= 0 .cse24)) (.cse6 (< v_idx_1358 c_ULTIMATE.start_main_p1)) (.cse18 (<= .cse31 v_idx_1358)) (.cse15 (< v_idx_1364 c_ULTIMATE.start_main_p4)) (.cse13 (<= .cse23 .cse19)) (.cse12 (<= .cse23 0)) (.cse14 (<= (* 2 .cse23) 0)) (.cse9 (<= .cse0 v_idx_1364)) (.cse21 (< v_idx_1362 c_ULTIMATE.start_main_p3)) (.cse4 (<= 0 (* 2 .cse19))) (.cse20 (<= 0 .cse19)) (.cse3 (<= .cse30 v_idx_1362))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (or .cse21 (and .cse4 .cse20) .cse3))) (or (and .cse29 .cse15) (and (or .cse21 .cse3 (and .cse4 .cse13 .cse20)) .cse12 .cse14) (and .cse29 .cse9))))) (or (and (let ((.cse27 (or (and .cse4 .cse17 .cse20) .cse21 .cse3))) (or (and (or .cse21 .cse3 (and .cse4 .cse13 .cse17 .cse20)) .cse10 .cse12 .cse14) (and .cse9 .cse27) (and .cse27 .cse15))) .cse8 .cse16) (and .cse6 .cse28) (and .cse18 .cse28))))) (or (let ((.cse1 (select |c_#memory_int| v_idx_1360))) (and (<= (* 2 .cse1) 0) (let ((.cse7 (<= .cse1 .cse24)) (.cse11 (<= (+ .cse1 .cse23) 0))) (let ((.cse2 (let ((.cse22 (or (and .cse11 .cse12 .cse14) .cse9 .cse15))) (or (and .cse6 .cse22) (and .cse18 .cse22) (and .cse7 .cse8 .cse16 (or .cse9 (and .cse10 .cse11 .cse12 .cse14) .cse15)))))) (or (and .cse2 .cse3) (and .cse4 (let ((.cse5 (or .cse9 (and .cse11 .cse12 .cse13 .cse14) .cse15))) (or (and .cse5 .cse6) (and .cse7 .cse8 (or .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) .cse16 .cse17) (and .cse18 .cse5))) (<= .cse1 .cse19) .cse20) (and .cse21 .cse2)))) (<= .cse1 0))) (and (<= .cse25 v_idx_1360) .cse26) (and (< v_idx_1360 c_ULTIMATE.start_main_p2) .cse26))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (= (select |c_#valid| v_idx_1355) 1) (< v_idx_1355 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_1355)) (<= .cse25 c_ULTIMATE.start_main_p3) (<= .cse32 c_ULTIMATE.start_main_p4) (<= .cse32 c_ULTIMATE.start_malloc_ptr) (<= .cse30 c_ULTIMATE.start_malloc_ptr) (<= .cse30 c_ULTIMATE.start_main_p4) (<= .cse31 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-28 10:58:32,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1379 Int) (v_idx_1367 Int) (v_idx_1377 Int) (v_idx_1375 Int) (v_idx_1373 Int) (v_idx_1370 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse30 (+ c_ULTIMATE.start_main_p2 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 2)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse31 (+ 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) (or (< v_idx_1370 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1370)) (<= .cse0 v_idx_1370)) (or (<= .cse0 v_idx_1367) (< v_idx_1367 c_ULTIMATE.start_main_p4) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1367) 0)) (let ((.cse25 (select |c_#memory_int| v_idx_1375)) (.cse4 (select |c_#memory_int| v_idx_1379)) (.cse26 (select |c_#memory_int| v_idx_1373))) (let ((.cse18 (< v_idx_1373 c_ULTIMATE.start_main_p1)) (.cse16 (<= .cse31 v_idx_1373)) (.cse6 (<= 0 (* 2 .cse26))) (.cse5 (<= .cse4 .cse26)) (.cse13 (<= .cse25 .cse26)) (.cse15 (<= 0 .cse26)) (.cse22 (< v_idx_1379 c_ULTIMATE.start_main_p4)) (.cse19 (<= (* 2 .cse4) 0)) (.cse12 (<= (+ .cse4 .cse25) 0)) (.cse20 (<= .cse4 0)) (.cse23 (<= .cse0 v_idx_1379)) (.cse10 (<= .cse25 0)) (.cse14 (<= (* 2 .cse25) 0)) (.cse8 (<= .cse30 v_idx_1375)) (.cse9 (< v_idx_1375 c_ULTIMATE.start_main_p2))) (let ((.cse2 (let ((.cse27 (let ((.cse29 (or (and .cse10 .cse14) .cse8 .cse9))) (or (and .cse29 .cse22) (and .cse19 (or (and .cse10 .cse12 .cse14) .cse8 .cse9) .cse20) (and .cse29 .cse23))))) (or (and .cse18 .cse27) (and .cse16 .cse27) (and .cse6 (let ((.cse28 (or (and .cse10 .cse13 .cse14) .cse8 .cse9))) (or (and .cse19 .cse5 (or .cse8 .cse9 (and .cse10 .cse12 .cse13 .cse14)) .cse20) (and .cse28 .cse22) (and .cse23 .cse28))) .cse15))))) (or (and (<= .cse1 v_idx_1377) .cse2) (let ((.cse3 (select |c_#memory_int| v_idx_1377))) (and (<= 0 .cse3) (<= 0 (* 2 .cse3)) (let ((.cse7 (<= 0 (+ .cse26 .cse3))) (.cse11 (<= .cse25 .cse3))) (let ((.cse21 (let ((.cse24 (or (and .cse10 .cse11 .cse14) .cse8 .cse9))) (or (and .cse16 .cse24) (and .cse18 .cse24) (and (or (and .cse10 .cse11 .cse13 .cse14) .cse8 .cse9) .cse6 .cse7 .cse15))))) (or (and (<= .cse4 .cse3) (let ((.cse17 (or .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse14)))) (or (and .cse5 .cse6 .cse7 (or .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14)) .cse15) (and .cse16 .cse17) (and .cse18 .cse17))) .cse19 .cse20) (and .cse21 .cse22) (and .cse21 .cse23)))))) (and .cse2 (< v_idx_1377 c_ULTIMATE.start_main_p3)))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse30 c_ULTIMATE.start_main_p3) (<= .cse32 c_ULTIMATE.start_main_p4) (<= .cse32 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p4) (<= .cse31 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-28 10:58:35,266 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-02-28 10:58:35,267 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:58:35,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:58:35,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2019-02-28 10:58:35,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:58:35,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:58:35,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:58:35,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-28 10:58:35,268 INFO L87 Difference]: Start difference. First operand 24 states and 72 transitions. Second operand 6 states. [2019-02-28 10:58:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:58:46,130 INFO L93 Difference]: Finished difference Result 24 states and 72 transitions. [2019-02-28 10:58:46,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:58:46,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-28 10:58:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:58:46,131 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:58:46,131 INFO L226 Difference]: Without dead ends: 22 [2019-02-28 10:58:46,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-28 10:58:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-28 10:58:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-28 10:58:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:58:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 70 transitions. [2019-02-28 10:58:46,195 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 70 transitions. Word has length 6 [2019-02-28 10:58:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:58:46,196 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 70 transitions. [2019-02-28 10:58:46,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:58:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 70 transitions. [2019-02-28 10:58:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:58:46,196 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:58:46,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:58:46,197 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:58:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:58:46,197 INFO L82 PathProgramCache]: Analyzing trace with hash -310850340, now seen corresponding path program 1 times [2019-02-28 10:58:46,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:58:46,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:58:46,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:58:46,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:58:46,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:58:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:58:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:58:46,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:58:46,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:58:46,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:58:46,399 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-02-28 10:58:46,400 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:58:46,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:59:55,458 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:59:55,459 INFO L272 AbstractInterpreter]: Visited 8 different actions 145 times. Merged at 6 different actions 53 times. Widened at 4 different actions 18 times. Found 72 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-28 10:59:55,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:59:55,459 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:59:56,135 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:59:56,737 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1520 Int) (v_idx_1529 Int) (v_idx_1517 Int) (v_idx_1527 Int) (v_idx_1525 Int) (v_idx_1523 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 2)) (.cse30 (+ c_ULTIMATE.start_main_p4 1)) (.cse29 (+ c_ULTIMATE.start_main_p3 1)) (.cse31 (+ c_ULTIMATE.start_main_p1 1)) (.cse33 (+ c_ULTIMATE.start_main_p1 3))) (and (let ((.cse24 (select |c_#memory_int| v_idx_1527)) (.cse21 (select |c_#memory_int| v_idx_1529)) (.cse25 (select |c_#memory_int| v_idx_1523))) (let ((.cse9 (< v_idx_1523 c_ULTIMATE.start_main_p1)) (.cse10 (<= 0 (* 2 .cse25))) (.cse18 (<= .cse21 .cse25)) (.cse13 (<= 0 (+ .cse25 .cse24))) (.cse20 (<= 0 .cse25)) (.cse7 (<= .cse31 v_idx_1523)) (.cse5 (<= .cse21 0)) (.cse14 (<= .cse21 .cse24)) (.cse6 (<= (* 2 .cse21) 0)) (.cse4 (<= .cse30 v_idx_1529)) (.cse22 (< v_idx_1529 c_ULTIMATE.start_main_p4)) (.cse11 (<= .cse29 v_idx_1527)) (.cse15 (<= 0 (* 2 .cse24))) (.cse16 (<= 0 .cse24)) (.cse12 (< v_idx_1527 c_ULTIMATE.start_main_p3))) (let ((.cse0 (let ((.cse26 (let ((.cse28 (or .cse11 (and .cse15 .cse16) .cse12))) (or (and .cse5 (or .cse11 (and .cse14 .cse15 .cse16) .cse12) .cse6) (and .cse28 .cse4) (and .cse28 .cse22))))) (or (and .cse9 .cse26) (and .cse10 (let ((.cse27 (or .cse11 (and .cse13 .cse15 .cse16) .cse12))) (or (and .cse27 .cse4) (and .cse27 .cse22) (and .cse18 .cse5 .cse6 (or .cse11 (and .cse13 .cse14 .cse15 .cse16) .cse12)))) .cse20) (and .cse7 .cse26))))) (or (and .cse0 (< v_idx_1525 c_ULTIMATE.start_main_p2)) (and .cse0 (<= .cse1 v_idx_1525)) (let ((.cse2 (select |c_#memory_int| v_idx_1525))) (and (<= (* 2 .cse2) 0) (let ((.cse19 (<= .cse2 .cse25)) (.cse17 (<= .cse2 .cse24))) (let ((.cse3 (let ((.cse23 (or .cse11 (and .cse15 .cse16 .cse17) .cse12))) (or (and .cse7 .cse23) (and .cse23 .cse9) (and .cse10 .cse19 (or (and .cse13 .cse15 .cse16 .cse17) .cse11 .cse12) .cse20))))) (or (and .cse3 .cse4) (and .cse5 .cse6 (let ((.cse8 (or .cse11 .cse12 (and .cse14 .cse15 .cse16 .cse17)))) (or (and .cse7 .cse8) (and .cse9 .cse8) (and .cse10 (or .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17)) .cse18 .cse19 .cse20))) (<= (+ .cse2 .cse21) 0)) (and .cse3 .cse22)))) (<= .cse2 0))))))) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1517)) (<= .cse30 v_idx_1517) (< v_idx_1517 c_ULTIMATE.start_main_p4)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse32 c_ULTIMATE.start_main_p4) (<= .cse32 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_1520 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1520)) (<= .cse30 v_idx_1520)) (<= .cse29 c_ULTIMATE.start_malloc_ptr) (<= .cse29 c_ULTIMATE.start_main_p4) (<= .cse31 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-28 10:59:57,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1544 Int) (v_idx_1532 Int) (v_idx_1542 Int) (v_idx_1540 Int) (v_idx_1538 Int) (v_idx_1535 Int)) (let ((.cse30 (+ c_ULTIMATE.start_main_p2 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 2)) (.cse31 (+ c_ULTIMATE.start_main_p3 1)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse33 (+ c_ULTIMATE.start_main_p1 3))) (and (or (= 1 (select |c_#valid| v_idx_1535)) (< v_idx_1535 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_1535)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse25 (select |c_#memory_int| v_idx_1540)) (.cse19 (select |c_#memory_int| v_idx_1544)) (.cse26 (select |c_#memory_int| v_idx_1542))) (let ((.cse21 (< v_idx_1544 c_ULTIMATE.start_main_p4)) (.cse23 (<= .cse0 v_idx_1544)) (.cse7 (<= .cse19 .cse26)) (.cse11 (<= (+ .cse19 .cse25) 0)) (.cse18 (<= (* 2 .cse19) 0)) (.cse20 (<= .cse19 0)) (.cse17 (<= .cse31 v_idx_1542)) (.cse16 (< v_idx_1542 c_ULTIMATE.start_main_p3)) (.cse9 (<= .cse25 .cse26)) (.cse4 (<= 0 (* 2 .cse26))) (.cse6 (<= 0 .cse26)) (.cse8 (<= .cse30 v_idx_1540)) (.cse12 (<= .cse25 0)) (.cse13 (<= (* 2 .cse25) 0)) (.cse14 (< v_idx_1540 c_ULTIMATE.start_main_p2))) (let ((.cse2 (let ((.cse27 (let ((.cse29 (or .cse8 (and .cse12 .cse13) .cse14))) (or (and .cse29 .cse17) (and .cse29 .cse16) (and (or .cse8 .cse14 (and .cse9 .cse12 .cse13)) .cse4 .cse6))))) (or (and .cse21 .cse27) (and .cse23 .cse27) (and (let ((.cse28 (or .cse8 (and .cse11 .cse12 .cse13) .cse14))) (or (and .cse4 (or .cse8 (and .cse9 .cse11 .cse12 .cse13) .cse14) .cse6 .cse7) (and .cse28 .cse17) (and .cse28 .cse16))) .cse18 .cse20))))) (or (and (<= .cse1 v_idx_1538) .cse2) (let ((.cse3 (select |c_#memory_int| v_idx_1538))) (and (<= 0 .cse3) (<= 0 (* 2 .cse3)) (let ((.cse5 (<= 0 (+ .cse26 .cse3))) (.cse10 (<= .cse25 .cse3))) (let ((.cse22 (let ((.cse24 (or (and .cse10 .cse12 .cse13) .cse8 .cse14))) (or (and .cse4 .cse5 .cse6 (or .cse8 (and .cse9 .cse10 .cse12 .cse13) .cse14)) (and .cse17 .cse24) (and .cse24 .cse16))))) (or (and (let ((.cse15 (or .cse8 (and .cse10 .cse11 .cse12 .cse13) .cse14))) (or (and .cse4 .cse5 .cse6 .cse7 (or .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14)) (and .cse15 .cse16) (and .cse17 .cse15))) .cse18 (<= .cse19 .cse3) .cse20) (and .cse21 .cse22) (and .cse23 .cse22)))))) (and (< v_idx_1538 c_ULTIMATE.start_main_p1) .cse2))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse30 c_ULTIMATE.start_main_p3) (<= .cse32 c_ULTIMATE.start_main_p4) (<= .cse32 c_ULTIMATE.start_malloc_ptr) (<= .cse31 c_ULTIMATE.start_malloc_ptr) (<= .cse31 c_ULTIMATE.start_main_p4) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1532) 0) (<= .cse0 v_idx_1532) (< v_idx_1532 c_ULTIMATE.start_main_p4)) (<= .cse1 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-28 11:00:07,200 INFO L420 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2019-02-28 11:00:07,200 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 11:00:07,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 11:00:07,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2019-02-28 11:00:07,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 11:00:07,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 11:00:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 11:00:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-28 11:00:07,201 INFO L87 Difference]: Start difference. First operand 22 states and 70 transitions. Second operand 5 states. [2019-02-28 11:00:09,407 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_1520 Int) (v_idx_1529 Int) (v_idx_1517 Int) (v_idx_1527 Int) (v_idx_1525 Int) (v_idx_1523 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 2)) (.cse30 (+ c_ULTIMATE.start_main_p4 1)) (.cse29 (+ c_ULTIMATE.start_main_p3 1)) (.cse31 (+ c_ULTIMATE.start_main_p1 1)) (.cse33 (+ c_ULTIMATE.start_main_p1 3))) (and (let ((.cse24 (select |c_#memory_int| v_idx_1527)) (.cse21 (select |c_#memory_int| v_idx_1529)) (.cse25 (select |c_#memory_int| v_idx_1523))) (let ((.cse9 (< v_idx_1523 c_ULTIMATE.start_main_p1)) (.cse10 (<= 0 (* 2 .cse25))) (.cse18 (<= .cse21 .cse25)) (.cse13 (<= 0 (+ .cse25 .cse24))) (.cse20 (<= 0 .cse25)) (.cse7 (<= .cse31 v_idx_1523)) (.cse5 (<= .cse21 0)) (.cse14 (<= .cse21 .cse24)) (.cse6 (<= (* 2 .cse21) 0)) (.cse4 (<= .cse30 v_idx_1529)) (.cse22 (< v_idx_1529 c_ULTIMATE.start_main_p4)) (.cse11 (<= .cse29 v_idx_1527)) (.cse15 (<= 0 (* 2 .cse24))) (.cse16 (<= 0 .cse24)) (.cse12 (< v_idx_1527 c_ULTIMATE.start_main_p3))) (let ((.cse0 (let ((.cse26 (let ((.cse28 (or .cse11 (and .cse15 .cse16) .cse12))) (or (and .cse5 (or .cse11 (and .cse14 .cse15 .cse16) .cse12) .cse6) (and .cse28 .cse4) (and .cse28 .cse22))))) (or (and .cse9 .cse26) (and .cse10 (let ((.cse27 (or .cse11 (and .cse13 .cse15 .cse16) .cse12))) (or (and .cse27 .cse4) (and .cse27 .cse22) (and .cse18 .cse5 .cse6 (or .cse11 (and .cse13 .cse14 .cse15 .cse16) .cse12)))) .cse20) (and .cse7 .cse26))))) (or (and .cse0 (< v_idx_1525 c_ULTIMATE.start_main_p2)) (and .cse0 (<= .cse1 v_idx_1525)) (let ((.cse2 (select |c_#memory_int| v_idx_1525))) (and (<= (* 2 .cse2) 0) (let ((.cse19 (<= .cse2 .cse25)) (.cse17 (<= .cse2 .cse24))) (let ((.cse3 (let ((.cse23 (or .cse11 (and .cse15 .cse16 .cse17) .cse12))) (or (and .cse7 .cse23) (and .cse23 .cse9) (and .cse10 .cse19 (or (and .cse13 .cse15 .cse16 .cse17) .cse11 .cse12) .cse20))))) (or (and .cse3 .cse4) (and .cse5 .cse6 (let ((.cse8 (or .cse11 .cse12 (and .cse14 .cse15 .cse16 .cse17)))) (or (and .cse7 .cse8) (and .cse9 .cse8) (and .cse10 (or .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17)) .cse18 .cse19 .cse20))) (<= (+ .cse2 .cse21) 0)) (and .cse3 .cse22)))) (<= .cse2 0))))))) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1517)) (<= .cse30 v_idx_1517) (< v_idx_1517 c_ULTIMATE.start_main_p4)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse32 c_ULTIMATE.start_main_p4) (<= .cse32 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_1520 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1520)) (<= .cse30 v_idx_1520)) (<= .cse29 c_ULTIMATE.start_malloc_ptr) (<= .cse29 c_ULTIMATE.start_main_p4) (<= .cse31 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)))) (forall ((v_idx_1555 Int) (v_idx_1553 Int) (v_idx_1550 Int) (v_idx_1559 Int) (v_idx_1547 Int) (v_idx_1557 Int)) (let ((.cse36 (+ c_ULTIMATE.start_main_p2 2)) (.cse35 (+ c_ULTIMATE.start_main_p2 1)) (.cse37 (+ c_ULTIMATE.start_main_p3 1)) (.cse34 (+ c_ULTIMATE.start_main_p4 1)) (.cse66 (+ 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) (or (<= .cse34 v_idx_1550) (= (select |c_#valid| v_idx_1550) 1) (< v_idx_1550 c_ULTIMATE.start_main_p4)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse35 c_ULTIMATE.start_main_p3) (<= .cse36 c_ULTIMATE.start_main_p4) (<= .cse36 c_ULTIMATE.start_malloc_ptr) (<= .cse37 c_ULTIMATE.start_malloc_ptr) (<= .cse37 c_ULTIMATE.start_main_p4) (let ((.cse60 (select |c_#memory_int| v_idx_1559)) (.cse61 (select |c_#memory_int| v_idx_1557)) (.cse44 (select |c_#memory_int| v_idx_1553))) (let ((.cse39 (< v_idx_1553 c_ULTIMATE.start_main_p1)) (.cse42 (<= 0 .cse44)) (.cse43 (<= 0 (* 2 .cse44))) (.cse55 (<= 0 (+ .cse44 .cse61))) (.cse52 (<= .cse60 .cse44)) (.cse41 (<= .cse66 v_idx_1553)) (.cse47 (< v_idx_1557 c_ULTIMATE.start_main_p3)) (.cse45 (<= .cse37 v_idx_1557)) (.cse53 (<= .cse60 .cse61)) (.cse57 (<= 0 (* 2 .cse61))) (.cse58 (<= 0 .cse61)) (.cse48 (< v_idx_1559 c_ULTIMATE.start_main_p4)) (.cse49 (<= .cse60 0)) (.cse51 (<= (* 2 .cse60) 0)) (.cse54 (<= .cse34 v_idx_1559))) (let ((.cse62 (let ((.cse63 (let ((.cse65 (or .cse48 (and .cse49 .cse51) .cse54))) (or (and .cse47 .cse65) (and .cse65 .cse45) (and (or .cse48 (and .cse49 .cse51 .cse53) .cse54) .cse57 .cse58))))) (or (and .cse39 .cse63) (and .cse42 .cse43 (let ((.cse64 (or .cse48 (and .cse49 .cse51 .cse52) .cse54))) (or (and .cse64 .cse47) (and (or .cse48 (and .cse49 .cse51 .cse52 .cse53) .cse54) .cse55 .cse57 .cse58) (and .cse64 .cse45)))) (and .cse63 .cse41))))) (or (let ((.cse38 (select |c_#memory_int| v_idx_1555))) (and (<= (* 2 .cse38) 0) (<= .cse38 0) (let ((.cse56 (<= .cse38 .cse61)) (.cse50 (<= (+ .cse38 .cse60) 0))) (let ((.cse40 (let ((.cse59 (or (and .cse49 .cse50 .cse51) .cse48 .cse54))) (or (and .cse47 .cse59) (and (or .cse48 (and .cse49 .cse50 .cse51 .cse53) .cse54) .cse56 .cse57 .cse58) (and .cse45 .cse59))))) (or (and .cse39 .cse40) (and .cse40 .cse41) (and .cse42 .cse43 (<= .cse38 .cse44) (let ((.cse46 (or .cse48 (and .cse49 .cse50 .cse51 .cse52) .cse54))) (or (and .cse45 .cse46) (and .cse47 .cse46) (and (or .cse48 (and .cse49 .cse50 .cse51 .cse52 .cse53) .cse54) .cse55 .cse56 .cse57 .cse58))))))))) (and .cse62 (<= .cse35 v_idx_1555)) (and .cse62 (< v_idx_1555 c_ULTIMATE.start_main_p2)))))) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1547)) (<= .cse34 v_idx_1547) (< v_idx_1547 c_ULTIMATE.start_main_p4)) (<= .cse66 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)))) (forall ((v_idx_1544 Int) (v_idx_1532 Int) (v_idx_1542 Int) (v_idx_1540 Int) (v_idx_1538 Int) (v_idx_1535 Int)) (let ((.cse98 (+ c_ULTIMATE.start_main_p2 1)) (.cse100 (+ c_ULTIMATE.start_main_p2 2)) (.cse99 (+ c_ULTIMATE.start_main_p3 1)) (.cse68 (+ c_ULTIMATE.start_main_p4 1)) (.cse69 (+ c_ULTIMATE.start_main_p1 1)) (.cse101 (+ c_ULTIMATE.start_main_p1 3))) (and (or (= 1 (select |c_#valid| v_idx_1535)) (< v_idx_1535 c_ULTIMATE.start_main_p4) (<= .cse68 v_idx_1535)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse93 (select |c_#memory_int| v_idx_1540)) (.cse87 (select |c_#memory_int| v_idx_1544)) (.cse94 (select |c_#memory_int| v_idx_1542))) (let ((.cse89 (< v_idx_1544 c_ULTIMATE.start_main_p4)) (.cse91 (<= .cse68 v_idx_1544)) (.cse75 (<= .cse87 .cse94)) (.cse79 (<= (+ .cse87 .cse93) 0)) (.cse86 (<= (* 2 .cse87) 0)) (.cse88 (<= .cse87 0)) (.cse85 (<= .cse99 v_idx_1542)) (.cse84 (< v_idx_1542 c_ULTIMATE.start_main_p3)) (.cse77 (<= .cse93 .cse94)) (.cse72 (<= 0 (* 2 .cse94))) (.cse74 (<= 0 .cse94)) (.cse76 (<= .cse98 v_idx_1540)) (.cse80 (<= .cse93 0)) (.cse81 (<= (* 2 .cse93) 0)) (.cse82 (< v_idx_1540 c_ULTIMATE.start_main_p2))) (let ((.cse70 (let ((.cse95 (let ((.cse97 (or .cse76 (and .cse80 .cse81) .cse82))) (or (and .cse97 .cse85) (and .cse97 .cse84) (and (or .cse76 .cse82 (and .cse77 .cse80 .cse81)) .cse72 .cse74))))) (or (and .cse89 .cse95) (and .cse91 .cse95) (and (let ((.cse96 (or .cse76 (and .cse79 .cse80 .cse81) .cse82))) (or (and .cse72 (or .cse76 (and .cse77 .cse79 .cse80 .cse81) .cse82) .cse74 .cse75) (and .cse96 .cse85) (and .cse96 .cse84))) .cse86 .cse88))))) (or (and (<= .cse69 v_idx_1538) .cse70) (let ((.cse71 (select |c_#memory_int| v_idx_1538))) (and (<= 0 .cse71) (<= 0 (* 2 .cse71)) (let ((.cse73 (<= 0 (+ .cse94 .cse71))) (.cse78 (<= .cse93 .cse71))) (let ((.cse90 (let ((.cse92 (or (and .cse78 .cse80 .cse81) .cse76 .cse82))) (or (and .cse72 .cse73 .cse74 (or .cse76 (and .cse77 .cse78 .cse80 .cse81) .cse82)) (and .cse85 .cse92) (and .cse92 .cse84))))) (or (and (let ((.cse83 (or .cse76 (and .cse78 .cse79 .cse80 .cse81) .cse82))) (or (and .cse72 .cse73 .cse74 .cse75 (or .cse76 (and .cse77 .cse78 .cse79 .cse80 .cse81) .cse82)) (and .cse83 .cse84) (and .cse85 .cse83))) .cse86 (<= .cse87 .cse71) .cse88) (and .cse89 .cse90) (and .cse91 .cse90)))))) (and (< v_idx_1538 c_ULTIMATE.start_main_p1) .cse70))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse98 c_ULTIMATE.start_main_p3) (<= .cse100 c_ULTIMATE.start_main_p4) (<= .cse100 c_ULTIMATE.start_malloc_ptr) (<= .cse99 c_ULTIMATE.start_malloc_ptr) (<= .cse99 c_ULTIMATE.start_main_p4) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1532) 0) (<= .cse68 v_idx_1532) (< v_idx_1532 c_ULTIMATE.start_main_p4)) (<= .cse69 c_ULTIMATE.start_main_p2) (<= .cse101 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse101 c_ULTIMATE.start_main_p4))))) is different from false [2019-02-28 11:00:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 11:00:27,516 INFO L93 Difference]: Finished difference Result 22 states and 70 transitions. [2019-02-28 11:00:27,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 11:00:27,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-28 11:00:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 11:00:27,516 INFO L225 Difference]: With dead ends: 22 [2019-02-28 11:00:27,516 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 11:00:27,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-28 11:00:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 11:00:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 11:00:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 11:00:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 11:00:27,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-02-28 11:00:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 11:00:27,518 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 11:00:27,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 11:00:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 11:00:27,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 11:00:27,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 11:00:37,724 WARN L181 SmtUtils]: Spent 10.13 s on a formula simplification. DAG size of input: 407 DAG size of output: 124 [2019-02-28 11:00:37,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-02-28 11:00:37,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 11:00:37,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-02-28 11:00:37,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-02-28 11:00:37,728 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-02-28 11:00:37,728 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-02-28 11:00:37,729 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (forall ((v_idx_1388 Int) (v_idx_1385 Int) (v_idx_1394 Int) (v_idx_1382 Int) (v_idx_1392 Int) (v_idx_1390 Int)) (let ((.cse29 (+ ULTIMATE.start_main_p2 1)) (.cse32 (+ ULTIMATE.start_main_p2 2)) (.cse1 (+ ULTIMATE.start_main_p3 1)) (.cse30 (+ ULTIMATE.start_main_p4 1)) (.cse31 (+ ULTIMATE.start_main_p1 1)) (.cse33 (+ ULTIMATE.start_main_p1 3))) (and (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (let ((.cse24 (select |#memory_int| v_idx_1390)) (.cse25 (select |#memory_int| v_idx_1394)) (.cse5 (select |#memory_int| v_idx_1388))) (let ((.cse22 (<= .cse31 v_idx_1388)) (.cse21 (< v_idx_1388 ULTIMATE.start_main_p1)) (.cse3 (<= 0 .cse5)) (.cse4 (<= 0 (* 2 .cse5))) (.cse9 (<= .cse25 .cse5)) (.cse11 (<= .cse24 .cse5)) (.cse19 (<= .cse30 v_idx_1394)) (.cse18 (< v_idx_1394 ULTIMATE.start_main_p4)) (.cse6 (<= (* 2 .cse25) 0)) (.cse15 (<= (+ .cse25 .cse24) 0)) (.cse7 (<= .cse25 0)) (.cse10 (< v_idx_1390 ULTIMATE.start_main_p2)) (.cse13 (<= .cse24 0)) (.cse14 (<= (* 2 .cse24) 0)) (.cse16 (<= .cse29 v_idx_1390))) (let ((.cse0 (let ((.cse26 (let ((.cse28 (or .cse10 (and .cse13 .cse14) .cse16))) (or (and .cse28 .cse19) (and .cse28 .cse18) (and .cse6 (or (and .cse13 .cse14 .cse15) .cse10 .cse16) .cse7))))) (or (and .cse22 .cse26) (and .cse21 .cse26) (and .cse3 .cse4 (let ((.cse27 (or .cse10 (and .cse11 .cse13 .cse14) .cse16))) (or (and .cse6 (or .cse10 (and .cse11 .cse13 .cse14 .cse15) .cse16) .cse7 .cse9) (and .cse27 .cse19) (and .cse27 .cse18)))))))) (or (and .cse0 (<= .cse1 v_idx_1392)) (let ((.cse2 (select |#memory_int| v_idx_1392))) (and (<= 0 .cse2) (<= 0 (* 2 .cse2)) (let ((.cse8 (<= .cse25 .cse2)) (.cse12 (<= .cse24 .cse2))) (let ((.cse20 (let ((.cse23 (or (and .cse12 .cse13 .cse14) .cse10 .cse16))) (or (and .cse23 .cse19) (and .cse6 .cse7 (or (and .cse12 .cse13 .cse14 .cse15) .cse10 .cse16) .cse8) (and .cse23 .cse18))))) (or (and .cse3 .cse4 (<= 0 (+ .cse2 .cse5)) (let ((.cse17 (or (and .cse11 .cse12 .cse13 .cse14) .cse10 .cse16))) (or (and .cse6 .cse7 .cse8 .cse9 (or .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse16)) (and .cse17 .cse18) (and .cse17 .cse19)))) (and .cse20 .cse21) (and .cse22 .cse20)))))) (and .cse0 (< v_idx_1392 ULTIMATE.start_main_p3)))))) (or (< v_idx_1385 ULTIMATE.start_main_p4) (<= .cse30 v_idx_1385) (= 1 (select |#valid| v_idx_1385))) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p4) (<= .cse29 ULTIMATE.start_main_p3) (<= .cse32 ULTIMATE.start_main_p4) (<= .cse32 ULTIMATE.start_malloc_ptr) (<= .cse1 ULTIMATE.start_malloc_ptr) (<= .cse1 ULTIMATE.start_main_p4) (or (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_1382)) (<= .cse30 v_idx_1382) (< v_idx_1382 ULTIMATE.start_main_p4)) (<= .cse31 ULTIMATE.start_main_p2) (<= .cse33 ULTIMATE.start_malloc_ptr) (<= ULTIMATE.start_main_p4 ULTIMATE.start_malloc_ptr) (<= .cse33 ULTIMATE.start_main_p4)))) [2019-02-28 11:00:37,729 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 11:00:37,729 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-02-28 11:00:37,730 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-02-28 11:00:37,730 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-02-28 11:00:37,765 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 11:00:37 BoogieIcfgContainer [2019-02-28 11:00:37,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 11:00:37,766 INFO L168 Benchmark]: Toolchain (without parser) took 492151.09 ms. Allocated memory was 140.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 108.0 MB in the beginning and 513.9 MB in the end (delta: -405.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-02-28 11:00:37,767 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 11:00:37,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.11 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-28 11:00:37,769 INFO L168 Benchmark]: Boogie Preprocessor took 22.90 ms. Allocated memory is still 140.5 MB. Free memory was 105.3 MB in the beginning and 104.4 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. [2019-02-28 11:00:37,769 INFO L168 Benchmark]: RCFGBuilder took 464.03 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 93.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-02-28 11:00:37,770 INFO L168 Benchmark]: TraceAbstraction took 491605.99 ms. Allocated memory was 140.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 93.5 MB in the beginning and 513.9 MB in the end (delta: -420.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-02-28 11:00:37,774 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.20 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.11 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.90 ms. Allocated memory is still 140.5 MB. Free memory was 105.3 MB in the beginning and 104.4 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. * RCFGBuilder took 464.03 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 93.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 491605.99 ms. Allocated memory was 140.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 93.5 MB in the beginning and 513.9 MB in the end (delta: -420.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: 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: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: 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_1388 : int, v_idx_1385 : int, v_idx_1394 : int, v_idx_1382 : int, v_idx_1392 : int, v_idx_1390 : int :: ((((((((((((p1 + 2 <= p3 && ((((((p1 + 1 <= v_idx_1388 && (((((v_idx_1390 < p2 || (#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && p4 + 1 <= v_idx_1394) || (((v_idx_1390 < p2 || (#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && v_idx_1394 < p4)) || ((2 * #memory_int[v_idx_1394] <= 0 && ((((#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0) && #memory_int[v_idx_1394] + #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390)) && #memory_int[v_idx_1394] <= 0))) || (v_idx_1388 < p1 && (((((v_idx_1390 < p2 || (#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && p4 + 1 <= v_idx_1394) || (((v_idx_1390 < p2 || (#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && v_idx_1394 < p4)) || ((2 * #memory_int[v_idx_1394] <= 0 && ((((#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0) && #memory_int[v_idx_1394] + #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390)) && #memory_int[v_idx_1394] <= 0)))) || ((0 <= #memory_int[v_idx_1388] && 0 <= 2 * #memory_int[v_idx_1388]) && (((((2 * #memory_int[v_idx_1394] <= 0 && ((v_idx_1390 < p2 || (((#memory_int[v_idx_1390] <= #memory_int[v_idx_1388] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) && #memory_int[v_idx_1394] + #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390)) && #memory_int[v_idx_1394] <= 0) && #memory_int[v_idx_1394] <= #memory_int[v_idx_1388]) || (((v_idx_1390 < p2 || ((#memory_int[v_idx_1390] <= #memory_int[v_idx_1388] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && p4 + 1 <= v_idx_1394)) || (((v_idx_1390 < p2 || ((#memory_int[v_idx_1390] <= #memory_int[v_idx_1388] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && v_idx_1394 < p4)))) && p3 + 1 <= v_idx_1392) || ((0 <= #memory_int[v_idx_1392] && 0 <= 2 * #memory_int[v_idx_1392]) && (((((0 <= #memory_int[v_idx_1388] && 0 <= 2 * #memory_int[v_idx_1388]) && 0 <= #memory_int[v_idx_1392] + #memory_int[v_idx_1388]) && ((((((2 * #memory_int[v_idx_1394] <= 0 && #memory_int[v_idx_1394] <= 0) && #memory_int[v_idx_1394] <= #memory_int[v_idx_1392]) && #memory_int[v_idx_1394] <= #memory_int[v_idx_1388]) && ((v_idx_1390 < p2 || ((((#memory_int[v_idx_1390] <= #memory_int[v_idx_1388] && #memory_int[v_idx_1390] <= #memory_int[v_idx_1392]) && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) && #memory_int[v_idx_1394] + #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390)) || ((((((#memory_int[v_idx_1390] <= #memory_int[v_idx_1388] && #memory_int[v_idx_1390] <= #memory_int[v_idx_1392]) && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390) && v_idx_1394 < p4)) || ((((((#memory_int[v_idx_1390] <= #memory_int[v_idx_1388] && #memory_int[v_idx_1390] <= #memory_int[v_idx_1392]) && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390) && p4 + 1 <= v_idx_1394))) || ((((((((#memory_int[v_idx_1390] <= #memory_int[v_idx_1392] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390) && p4 + 1 <= v_idx_1394) || (((2 * #memory_int[v_idx_1394] <= 0 && #memory_int[v_idx_1394] <= 0) && (((((#memory_int[v_idx_1390] <= #memory_int[v_idx_1392] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) && #memory_int[v_idx_1394] + #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390)) && #memory_int[v_idx_1394] <= #memory_int[v_idx_1392])) || (((((#memory_int[v_idx_1390] <= #memory_int[v_idx_1392] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390) && v_idx_1394 < p4)) && v_idx_1388 < p1)) || (p1 + 1 <= v_idx_1388 && (((((((#memory_int[v_idx_1390] <= #memory_int[v_idx_1392] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390) && p4 + 1 <= v_idx_1394) || (((2 * #memory_int[v_idx_1394] <= 0 && #memory_int[v_idx_1394] <= 0) && (((((#memory_int[v_idx_1390] <= #memory_int[v_idx_1392] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) && #memory_int[v_idx_1394] + #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390)) && #memory_int[v_idx_1394] <= #memory_int[v_idx_1392])) || (((((#memory_int[v_idx_1390] <= #memory_int[v_idx_1392] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390) && v_idx_1394 < p4)))))) || ((((p1 + 1 <= v_idx_1388 && (((((v_idx_1390 < p2 || (#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && p4 + 1 <= v_idx_1394) || (((v_idx_1390 < p2 || (#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && v_idx_1394 < p4)) || ((2 * #memory_int[v_idx_1394] <= 0 && ((((#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0) && #memory_int[v_idx_1394] + #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390)) && #memory_int[v_idx_1394] <= 0))) || (v_idx_1388 < p1 && (((((v_idx_1390 < p2 || (#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && p4 + 1 <= v_idx_1394) || (((v_idx_1390 < p2 || (#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && v_idx_1394 < p4)) || ((2 * #memory_int[v_idx_1394] <= 0 && ((((#memory_int[v_idx_1390] <= 0 && 2 * #memory_int[v_idx_1390] <= 0) && #memory_int[v_idx_1394] + #memory_int[v_idx_1390] <= 0) || v_idx_1390 < p2) || p2 + 1 <= v_idx_1390)) && #memory_int[v_idx_1394] <= 0)))) || ((0 <= #memory_int[v_idx_1388] && 0 <= 2 * #memory_int[v_idx_1388]) && (((((2 * #memory_int[v_idx_1394] <= 0 && ((v_idx_1390 < p2 || (((#memory_int[v_idx_1390] <= #memory_int[v_idx_1388] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0) && #memory_int[v_idx_1394] + #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390)) && #memory_int[v_idx_1394] <= 0) && #memory_int[v_idx_1394] <= #memory_int[v_idx_1388]) || (((v_idx_1390 < p2 || ((#memory_int[v_idx_1390] <= #memory_int[v_idx_1388] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && p4 + 1 <= v_idx_1394)) || (((v_idx_1390 < p2 || ((#memory_int[v_idx_1390] <= #memory_int[v_idx_1388] && #memory_int[v_idx_1390] <= 0) && 2 * #memory_int[v_idx_1390] <= 0)) || p2 + 1 <= v_idx_1390) && v_idx_1394 < p4)))) && v_idx_1392 < p3))) && ((v_idx_1385 < p4 || p4 + 1 <= v_idx_1385) || 1 == #valid[v_idx_1385])) && ptr <= p4) && p2 + 1 <= p3) && p2 + 2 <= p4) && p2 + 2 <= ptr) && p3 + 1 <= ptr) && p3 + 1 <= p4) && ((0 == old(malloc_old_#valid)[v_idx_1382] || p4 + 1 <= v_idx_1382) || v_idx_1382 < 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, 491.5s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 166.7s AutomataDifference, 0.0s DeadEndRemovalTime, 10.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 91 SDtfs, 40 SDslu, 1 SDs, 0 SdLazy, 99 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 25 SemanticMatches, 40 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 273.8s AbstIntTime, 16 AbstIntIterations, 16 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 16 NumberOfFragments, 1245 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181252 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 3744 FormulaSimplificationTreeSizeReductionInter, 10.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 2869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 1/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...