java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 10:06:39,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 10:06:39,467 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 10:06:39,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 10:06:39,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 10:06:39,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 10:06:39,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 10:06:39,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 10:06:39,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 10:06:39,491 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 10:06:39,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 10:06:39,492 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 10:06:39,493 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 10:06:39,494 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 10:06:39,495 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 10:06:39,496 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 10:06:39,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 10:06:39,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 10:06:39,500 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 10:06:39,502 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 10:06:39,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 10:06:39,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 10:06:39,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 10:06:39,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 10:06:39,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 10:06:39,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 10:06:39,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 10:06:39,510 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 10:06:39,511 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 10:06:39,512 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 10:06:39,512 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 10:06:39,513 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 10:06:39,513 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 10:06:39,513 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 10:06:39,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 10:06:39,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 10:06:39,515 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-18 10:06:39,541 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 10:06:39,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 10:06:39,544 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 10:06:39,544 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 10:06:39,544 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 10:06:39,544 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 10:06:39,544 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 10:06:39,545 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 10:06:39,545 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 10:06:39,545 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 10:06:39,545 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 10:06:39,545 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 10:06:39,545 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 10:06:39,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 10:06:39,547 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 10:06:39,549 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 10:06:39,550 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 10:06:39,550 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 10:06:39,550 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 10:06:39,550 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 10:06:39,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 10:06:39,550 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 10:06:39,551 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 10:06:39,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 10:06:39,552 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 10:06:39,553 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 10:06:39,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 10:06:39,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 10:06:39,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 10:06:39,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 10:06:39,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:06:39,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 10:06:39,555 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 10:06:39,555 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 10:06:39,555 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 10:06:39,556 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 10:06:39,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 10:06:39,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 10:06:39,556 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 10:06:39,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 10:06:39,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 10:06:39,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 10:06:39,619 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 10:06:39,620 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 10:06:39,621 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-18 10:06:39,621 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-02-18 10:06:39,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 10:06:39,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 10:06:39,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 10:06:39,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 10:06:39,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 10:06:39,678 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 18.02 10:06:39" (1/1) ... [2019-02-18 10:06:39,689 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 18.02 10:06:39" (1/1) ... [2019-02-18 10:06:39,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 10:06:39,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 10:06:39,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 10:06:39,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 10:06:39,726 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 18.02 10:06:39" (1/1) ... [2019-02-18 10:06:39,727 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 18.02 10:06:39" (1/1) ... [2019-02-18 10:06:39,728 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 18.02 10:06:39" (1/1) ... [2019-02-18 10:06:39,729 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 18.02 10:06:39" (1/1) ... [2019-02-18 10:06:39,733 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 18.02 10:06:39" (1/1) ... [2019-02-18 10:06:39,737 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 18.02 10:06:39" (1/1) ... [2019-02-18 10:06:39,738 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 18.02 10:06:39" (1/1) ... [2019-02-18 10:06:39,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 10:06:39,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 10:06:39,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 10:06:39,740 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 10:06:39,747 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 18.02 10:06:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:06:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 10:06:39,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 10:06:39,994 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 10:06:39,994 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-18 10:06:39,995 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:06:39 BoogieIcfgContainer [2019-02-18 10:06:39,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 10:06:39,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 10:06:39,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 10:06:40,001 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 10:06:40,001 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 18.02 10:06:39" (1/2) ... [2019-02-18 10:06:40,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c42974e and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 10:06:40, skipping insertion in model container [2019-02-18 10:06:40,002 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 18.02 10:06:39" (2/2) ... [2019-02-18 10:06:40,004 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-02-18 10:06:40,011 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 10:06:40,017 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-18 10:06:40,030 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-18 10:06:40,055 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 10:06:40,055 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 10:06:40,056 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 10:06:40,056 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 10:06:40,056 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 10:06:40,056 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 10:06:40,056 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 10:06:40,057 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 10:06:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-18 10:06:40,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 10:06:40,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:40,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 10:06:40,077 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-18 10:06:40,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:40,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:40,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:40,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:40,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:40,296 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-18 10:06:40,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:06:40,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:06:40,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:40,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:40,331 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-18 10:06:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:40,457 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-18 10:06:40,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:40,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 10:06:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:40,473 INFO L225 Difference]: With dead ends: 21 [2019-02-18 10:06:40,473 INFO L226 Difference]: Without dead ends: 16 [2019-02-18 10:06:40,476 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-18 10:06:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-18 10:06:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-18 10:06:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 10:06:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-18 10:06:40,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-18 10:06:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:40,507 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-18 10:06:40,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-18 10:06:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:40,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:40,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:40,508 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-18 10:06:40,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:40,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:40,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:40,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:40,697 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-18 10:06:40,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:40,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:40,698 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:40,700 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-18 10:06:40,751 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:40,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:49,183 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:06:49,185 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-18 10:06:49,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:49,191 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:06:49,565 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:06:49,893 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:06:49,893 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:06:49,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:06:49,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:06:49,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:49,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:49,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:49,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:49,898 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 3 states. [2019-02-18 10:06:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:52,274 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2019-02-18 10:06:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:52,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:06:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:52,275 INFO L225 Difference]: With dead ends: 18 [2019-02-18 10:06:52,276 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 10:06:52,277 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-18 10:06:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 10:06:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-18 10:06:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 10:06:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2019-02-18 10:06:52,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 3 [2019-02-18 10:06:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:52,281 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2019-02-18 10:06:52,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2019-02-18 10:06:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:52,282 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:52,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:52,282 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:52,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-18 10:06:52,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:52,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:52,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:52,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:52,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:52,378 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-18 10:06:52,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:52,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:52,379 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:52,379 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-18 10:06:52,383 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:52,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:58,794 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:06:58,794 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-18 10:06:58,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:58,795 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:06:59,042 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:06:59,594 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:06:59,594 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:06:59,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:06:59,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:06:59,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:59,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:59,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:59,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:59,596 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2019-02-18 10:07:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:03,953 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2019-02-18 10:07:03,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:03,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:07:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:03,954 INFO L225 Difference]: With dead ends: 19 [2019-02-18 10:07:03,954 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 10:07:03,955 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-18 10:07:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 10:07:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-18 10:07:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 10:07:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2019-02-18 10:07:03,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 3 [2019-02-18 10:07:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:03,960 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 24 transitions. [2019-02-18 10:07:03,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 24 transitions. [2019-02-18 10:07:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:07:03,961 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:03,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:07:03,962 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:03,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:03,962 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-18 10:07:03,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:03,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:03,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:03,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:03,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:04,060 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-18 10:07:04,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:04,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:04,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:07:04,061 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-18 10:07:04,062 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:04,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:11,489 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:07:11,489 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-18 10:07:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:11,490 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:07:11,707 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:07:12,311 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:07:12,312 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:07:12,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:07:12,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:07:12,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:12,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:12,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:12,313 INFO L87 Difference]: Start difference. First operand 12 states and 24 transitions. Second operand 3 states. [2019-02-18 10:07:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:15,533 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2019-02-18 10:07:15,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:15,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:07:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:15,534 INFO L225 Difference]: With dead ends: 20 [2019-02-18 10:07:15,534 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 10:07:15,535 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-18 10:07:15,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 10:07:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-18 10:07:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 10:07:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2019-02-18 10:07:15,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 3 [2019-02-18 10:07:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:15,541 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 28 transitions. [2019-02-18 10:07:15,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2019-02-18 10:07:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:07:15,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:15,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:07:15,542 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash 30244, now seen corresponding path program 1 times [2019-02-18 10:07:15,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:15,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:15,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:15,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:15,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:15,837 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-02-18 10:07:15,842 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-18 10:07:15,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:15,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:15,842 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:07:15,843 INFO L207 CegarAbsIntRunner]: [0], [14], [19] [2019-02-18 10:07:15,844 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:15,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:21,057 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:07:21,057 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-18 10:07:21,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:21,058 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:07:21,285 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:07:21,847 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:07:21,848 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:07:21,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:07:21,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:07:21,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:21,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:21,849 INFO L87 Difference]: Start difference. First operand 13 states and 28 transitions. Second operand 3 states. [2019-02-18 10:07:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:28,642 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-18 10:07:28,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:28,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:07:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:28,643 INFO L225 Difference]: With dead ends: 21 [2019-02-18 10:07:28,643 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 10:07:28,643 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-18 10:07:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 10:07:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-18 10:07:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 10:07:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-02-18 10:07:28,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 32 transitions. Word has length 3 [2019-02-18 10:07:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:28,649 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 32 transitions. [2019-02-18 10:07:28,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 32 transitions. [2019-02-18 10:07:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:28,650 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:28,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:28,650 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:28,651 INFO L82 PathProgramCache]: Analyzing trace with hash 939102, now seen corresponding path program 1 times [2019-02-18 10:07:28,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:28,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:28,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:28,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:28,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:28,738 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-18 10:07:28,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:28,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:28,739 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:28,739 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-18 10:07:28,740 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:28,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:41,394 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:07:41,394 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-18 10:07:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:41,395 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:07:41,761 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:07:42,553 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:07:42,553 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:07:42,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:07:42,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-18 10:07:42,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:42,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:42,554 INFO L87 Difference]: Start difference. First operand 14 states and 32 transitions. Second operand 3 states. [2019-02-18 10:07:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:45,708 INFO L93 Difference]: Finished difference Result 22 states and 43 transitions. [2019-02-18 10:07:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:45,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 10:07:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:45,708 INFO L225 Difference]: With dead ends: 22 [2019-02-18 10:07:45,708 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 10:07:45,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 10:07:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-02-18 10:07:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 10:07:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2019-02-18 10:07:45,716 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 4 [2019-02-18 10:07:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:45,716 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 28 transitions. [2019-02-18 10:07:45,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2019-02-18 10:07:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:45,717 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:45,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:45,717 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:45,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-18 10:07:45,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:45,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:45,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:45,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:46,014 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-02-18 10:07:46,102 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-18 10:07:46,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:46,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:46,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:46,103 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-18 10:07:46,104 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:46,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:01,273 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:08:01,273 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-18 10:08:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:01,274 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:08:01,608 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:08:02,142 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:08:02,143 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:08:02,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:08:02,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-18 10:08:02,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:08:02,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:08:02,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:08:02,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:08:02,144 INFO L87 Difference]: Start difference. First operand 13 states and 28 transitions. Second operand 3 states. [2019-02-18 10:08:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:04,302 INFO L93 Difference]: Finished difference Result 22 states and 43 transitions. [2019-02-18 10:08:04,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:08:04,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 10:08:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:04,303 INFO L225 Difference]: With dead ends: 22 [2019-02-18 10:08:04,303 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 10:08:04,304 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-18 10:08:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 10:08:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-02-18 10:08:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 10:08:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-02-18 10:08:04,312 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 32 transitions. Word has length 4 [2019-02-18 10:08:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:04,312 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 32 transitions. [2019-02-18 10:08:04,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:08:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 32 transitions. [2019-02-18 10:08:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:08:04,313 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:04,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:08:04,313 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-18 10:08:04,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:04,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:04,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:04,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:04,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:04,478 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-18 10:08:04,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:04,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:04,478 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:08:04,479 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-18 10:08:04,480 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:04,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:18,803 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:08:18,803 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-18 10:08:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:18,803 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:08:19,254 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:08:19,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_488 Int) (v_idx_492 Int) (v_idx_482 Int) (v_idx_490 Int) (v_idx_485 Int) (v_idx_494 Int)) (let ((.cse11 (+ c_ULTIMATE.start_main_p2 2)) (.cse10 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse1 (+ 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 (<= .cse0 v_idx_485) (= 1 (select |c_#valid| v_idx_485)) (< v_idx_485 c_ULTIMATE.start_main_p4)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (<= .cse1 v_idx_488) (< v_idx_488 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_488) 0)) (let ((.cse7 (select |c_#memory_int| v_idx_494))) (let ((.cse4 (< v_idx_494 c_ULTIMATE.start_main_p4)) (.cse5 (<= .cse0 v_idx_494)) (.cse6 (<= .cse7 0)) (.cse9 (<= (* 2 .cse7) 0))) (let ((.cse2 (or .cse4 .cse5 (and .cse6 .cse9)))) (or (and (< v_idx_492 c_ULTIMATE.start_main_p3) .cse2) (and (<= .cse3 v_idx_492) .cse2) (let ((.cse8 (select |c_#memory_int| v_idx_492))) (and (or .cse4 .cse5 (and .cse6 (<= .cse7 .cse8) .cse9)) (<= 0 .cse8) (<= 0 (* 2 .cse8)))))))) (<= .cse10 c_ULTIMATE.start_main_p3) (<= .cse11 c_ULTIMATE.start_main_p4) (<= .cse11 c_ULTIMATE.start_malloc_ptr) (or (<= .cse10 v_idx_490) (< v_idx_490 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_490) 0)) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_main_p2) (or (< v_idx_482 c_ULTIMATE.start_main_p4) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_482)) (<= .cse0 v_idx_482)) (<= .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-18 10:08:19,851 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:08:19,851 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:08:19,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:08:19,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-18 10:08:19,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:08:19,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:08:19,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:08:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-18 10:08:19,853 INFO L87 Difference]: Start difference. First operand 14 states and 32 transitions. Second operand 4 states. [2019-02-18 10:08:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:26,104 INFO L93 Difference]: Finished difference Result 16 states and 38 transitions. [2019-02-18 10:08:26,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:08:26,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 10:08:26,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:26,105 INFO L225 Difference]: With dead ends: 16 [2019-02-18 10:08:26,105 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 10:08:26,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-18 10:08:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 10:08:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-18 10:08:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-18 10:08:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2019-02-18 10:08:26,117 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 37 transitions. Word has length 4 [2019-02-18 10:08:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:26,117 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 37 transitions. [2019-02-18 10:08:26,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:08:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 37 transitions. [2019-02-18 10:08:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:08:26,118 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:26,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:08:26,118 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-02-18 10:08:26,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:26,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:26,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:26,210 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-18 10:08:26,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:26,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:26,210 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:08:26,211 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-02-18 10:08:26,211 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:26,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:40,943 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:08:40,943 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-18 10:08:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:40,944 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:08:41,289 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:08:41,837 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-18 10:08:42,250 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:08:42,250 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:08:42,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:08:42,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-18 10:08:42,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:08:42,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:08:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:08:42,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-18 10:08:42,251 INFO L87 Difference]: Start difference. First operand 15 states and 37 transitions. Second operand 4 states. [2019-02-18 10:08:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:49,919 INFO L93 Difference]: Finished difference Result 25 states and 56 transitions. [2019-02-18 10:08:49,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:08:49,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 10:08:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:49,920 INFO L225 Difference]: With dead ends: 25 [2019-02-18 10:08:49,920 INFO L226 Difference]: Without dead ends: 18 [2019-02-18 10:08:49,921 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-18 10:08:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-18 10:08:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-18 10:08:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 10:08:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2019-02-18 10:08:49,932 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 49 transitions. Word has length 4 [2019-02-18 10:08:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:49,932 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 49 transitions. [2019-02-18 10:08:49,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:08:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 49 transitions. [2019-02-18 10:08:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:08:49,933 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:49,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:08:49,933 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:49,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:49,934 INFO L82 PathProgramCache]: Analyzing trace with hash 929740, now seen corresponding path program 1 times [2019-02-18 10:08:49,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:49,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:49,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:49,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:49,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:50,022 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-18 10:08:50,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:50,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:50,023 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:08:50,023 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [19] [2019-02-18 10:08:50,024 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:50,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:02,517 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:09:02,517 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-18 10:09:02,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:02,517 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:09:02,856 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:09:04,007 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:09:04,008 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:09:04,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:09:04,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-18 10:09:04,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:09:04,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:09:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:09:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:09:04,009 INFO L87 Difference]: Start difference. First operand 18 states and 49 transitions. Second operand 3 states. [2019-02-18 10:09:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:10,092 INFO L93 Difference]: Finished difference Result 26 states and 60 transitions. [2019-02-18 10:09:10,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:09:10,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 10:09:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:10,093 INFO L225 Difference]: With dead ends: 26 [2019-02-18 10:09:10,093 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 10:09:10,093 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-18 10:09:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 10:09:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-18 10:09:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-18 10:09:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 53 transitions. [2019-02-18 10:09:10,105 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 53 transitions. Word has length 4 [2019-02-18 10:09:10,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:10,106 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 53 transitions. [2019-02-18 10:09:10,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:09:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 53 transitions. [2019-02-18 10:09:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:09:10,106 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:10,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:09:10,107 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:10,107 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-18 10:09:10,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:10,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:10,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:10,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:10,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:10,209 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-18 10:09:10,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:10,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:10,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:09:10,210 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-18 10:09:10,210 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:10,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:24,869 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:09:24,869 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-18 10:09:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:24,870 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:09:25,346 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:09:25,638 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-18 10:09:25,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_764 Int) (v_idx_762 Int) (v_idx_752 Int) (v_idx_758 Int) (v_idx_755 Int) (v_idx_760 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 3)) (.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse4 (+ c_ULTIMATE.start_main_p3 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (<= .cse0 v_idx_752) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_752)) (< v_idx_752 c_ULTIMATE.start_main_p4)) (or (<= .cse0 v_idx_755) (= (select |c_#valid| v_idx_755) 1) (< v_idx_755 c_ULTIMATE.start_main_p4)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (<= .cse1 v_idx_758) (< v_idx_758 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_758) 0)) (<= .cse2 c_ULTIMATE.start_main_p3) (<= .cse3 c_ULTIMATE.start_main_p4) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_764 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_764) 0) (<= .cse0 v_idx_764)) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (<= .cse4 c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_main_p2) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse5 c_ULTIMATE.start_main_p4) (let ((.cse9 (select |c_#memory_int| v_idx_762))) (let ((.cse7 (<= .cse4 v_idx_762)) (.cse8 (< v_idx_762 c_ULTIMATE.start_main_p3)) (.cse10 (<= 0 .cse9)) (.cse11 (<= 0 (* 2 .cse9)))) (let ((.cse12 (or .cse7 .cse8 (and .cse10 .cse11)))) (or (let ((.cse6 (select |c_#memory_int| v_idx_760))) (and (<= .cse6 0) (or .cse7 .cse8 (and (<= .cse6 .cse9) .cse10 .cse11)) (<= (* 2 .cse6) 0))) (and .cse12 (< v_idx_760 c_ULTIMATE.start_main_p2)) (and .cse12 (<= .cse2 v_idx_760))))))))) is different from false [2019-02-18 10:09:26,234 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:09:26,235 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:09:26,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:09:26,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-02-18 10:09:26,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:09:26,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 10:09:26,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 10:09:26,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-18 10:09:26,236 INFO L87 Difference]: Start difference. First operand 19 states and 53 transitions. Second operand 5 states. [2019-02-18 10:09:27,470 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)) (.cse26 (+ c_ULTIMATE.start_main_p4 1)) (.cse27 (+ c_ULTIMATE.start_main_p1 1)) (.cse31 (+ c_ULTIMATE.start_main_p1 3)) (.cse28 (+ c_ULTIMATE.start_main_p2 1)) (.cse30 (+ c_ULTIMATE.start_main_p3 1))) (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) (or (< v_idx_764 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_764) 0) (<= .cse26 v_idx_764)) (<= .cse30 c_ULTIMATE.start_malloc_ptr) (<= .cse30 c_ULTIMATE.start_main_p4) (<= .cse27 c_ULTIMATE.start_main_p2) (<= .cse31 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse31 c_ULTIMATE.start_main_p4) (let ((.cse35 (select |c_#memory_int| v_idx_762))) (let ((.cse33 (<= .cse30 v_idx_762)) (.cse34 (< v_idx_762 c_ULTIMATE.start_main_p3)) (.cse36 (<= 0 .cse35)) (.cse37 (<= 0 (* 2 .cse35)))) (let ((.cse38 (or .cse33 .cse34 (and .cse36 .cse37)))) (or (let ((.cse32 (select |c_#memory_int| v_idx_760))) (and (<= .cse32 0) (or .cse33 .cse34 (and (<= .cse32 .cse35) .cse36 .cse37)) (<= (* 2 .cse32) 0))) (and .cse38 (< v_idx_760 c_ULTIMATE.start_main_p2)) (and .cse38 (<= .cse28 v_idx_760)))))))))) is different from false [2019-02-18 10:09:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:53,744 INFO L93 Difference]: Finished difference Result 27 states and 64 transitions. [2019-02-18 10:09:53,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:09:53,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-18 10:09:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:53,744 INFO L225 Difference]: With dead ends: 27 [2019-02-18 10:09:53,745 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 10:09:53,745 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-18 10:09:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 10:09:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-18 10:09:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 10:09:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-18 10:09:53,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-18 10:09:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:53,760 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-18 10:09:53,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 10:09:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-18 10:09:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:09:53,761 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:53,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:09:53,761 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:53,761 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-02-18 10:09:53,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:53,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:53,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:53,892 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-18 10:09:53,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:53,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:53,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:09:53,892 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-18 10:09:53,893 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:53,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:10:19,387 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:10:19,387 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-18 10:10:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:19,387 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:10:20,046 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:10:20,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_852 Int) (v_idx_842 Int) (v_idx_850 Int) (v_idx_845 Int) (v_idx_854 Int) (v_idx_848 Int)) (let ((.cse17 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p2 2)) (.cse19 (+ c_ULTIMATE.start_main_p3 1)) (.cse15 (+ 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 ((.cse14 (select |c_#memory_int| v_idx_850)) (.cse2 (select |c_#memory_int| v_idx_848))) (let ((.cse3 (<= 0 (* 2 .cse2))) (.cse4 (<= 0 .cse2)) (.cse9 (<= .cse14 .cse2)) (.cse11 (< v_idx_848 c_ULTIMATE.start_main_p1)) (.cse13 (<= .cse18 v_idx_848)) (.cse5 (< v_idx_850 c_ULTIMATE.start_main_p2)) (.cse7 (<= (* 2 .cse14) 0)) (.cse8 (<= .cse14 0)) (.cse10 (<= .cse17 v_idx_850))) (let ((.cse0 (let ((.cse16 (or .cse5 (and .cse7 .cse8) .cse10))) (or (and .cse3 .cse4 (or .cse5 (and .cse7 .cse8 .cse9) .cse10)) (and .cse11 .cse16) (and .cse13 .cse16))))) (or (and (< v_idx_854 c_ULTIMATE.start_main_p4) .cse0) (let ((.cse1 (select |c_#memory_int| v_idx_854))) (and (<= (* 2 .cse1) 0) (let ((.cse6 (<= (+ .cse14 .cse1) 0))) (let ((.cse12 (or .cse5 (and .cse6 .cse7 .cse8) .cse10))) (or (and (<= .cse1 .cse2) .cse3 .cse4 (or .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10)) (and .cse11 .cse12) (and .cse13 .cse12)))) (<= .cse1 0))) (and (<= .cse15 v_idx_854) .cse0))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_842)) (<= .cse15 v_idx_842) (< v_idx_842 c_ULTIMATE.start_main_p4)) (or (<= .cse19 v_idx_852) (< v_idx_852 c_ULTIMATE.start_main_p3) (= (select |c_#memory_int| v_idx_852) 0)) (<= .cse17 c_ULTIMATE.start_main_p3) (<= .cse20 c_ULTIMATE.start_main_p4) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (<= .cse19 c_ULTIMATE.start_main_p4) (or (< v_idx_845 c_ULTIMATE.start_main_p4) (<= .cse15 v_idx_845) (= 1 (select |c_#valid| v_idx_845))) (<= .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-18 10:10:21,078 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 ((.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ 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_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) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse2 c_ULTIMATE.start_main_p4) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (<= .cse3 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 (<= .cse3 v_idx_857) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_857) 0) (< v_idx_857 c_ULTIMATE.start_main_p4)) (<= .cse4 c_ULTIMATE.start_main_p2) (let ((.cse19 (select |c_#memory_int| v_idx_865)) (.cse9 (select |c_#memory_int| v_idx_869))) (let ((.cse7 (<= .cse3 v_idx_869)) (.cse11 (<= (* 2 .cse9) 0)) (.cse15 (<= (+ .cse9 .cse19) 0)) (.cse18 (<= .cse9 0)) (.cse8 (< v_idx_869 c_ULTIMATE.start_main_p4)) (.cse13 (<= .cse19 0)) (.cse14 (<= (* 2 .cse19) 0)) (.cse12 (< v_idx_865 c_ULTIMATE.start_main_p2)) (.cse17 (<= .cse1 v_idx_865))) (let ((.cse5 (let ((.cse20 (or (and .cse13 .cse14) .cse12 .cse17))) (or (and .cse7 .cse20) (and .cse11 (or .cse12 .cse17 (and .cse13 .cse14 .cse15)) .cse18) (and .cse8 .cse20))))) (or (and (<= .cse4 v_idx_863) .cse5) (let ((.cse10 (select |c_#memory_int| v_idx_863))) (and (let ((.cse16 (<= .cse19 .cse10))) (let ((.cse6 (or .cse12 .cse17 (and .cse13 .cse14 .cse16)))) (or (and .cse6 .cse7) (and .cse6 .cse8) (and (<= .cse9 .cse10) .cse11 (or .cse12 (and .cse13 .cse14 .cse15 .cse16) .cse17) .cse18)))) (<= 0 (* 2 .cse10)) (<= 0 .cse10))) (and .cse5 (< v_idx_863 c_ULTIMATE.start_main_p1)))))) (<= .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-18 10:10:22,051 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-18 10:10:22,051 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:10:22,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:10:22,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-02-18 10:10:22,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:10:22,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 10:10:22,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 10:10:22,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-18 10:10:22,053 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 5 states. [2019-02-18 10:10:23,886 WARN L838 $PredicateComparison]: unable to prove that (and (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 ((.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ 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_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) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse2 c_ULTIMATE.start_main_p4) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (<= .cse3 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 (<= .cse3 v_idx_857) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_857) 0) (< v_idx_857 c_ULTIMATE.start_main_p4)) (<= .cse4 c_ULTIMATE.start_main_p2) (let ((.cse19 (select |c_#memory_int| v_idx_865)) (.cse9 (select |c_#memory_int| v_idx_869))) (let ((.cse7 (<= .cse3 v_idx_869)) (.cse11 (<= (* 2 .cse9) 0)) (.cse15 (<= (+ .cse9 .cse19) 0)) (.cse18 (<= .cse9 0)) (.cse8 (< v_idx_869 c_ULTIMATE.start_main_p4)) (.cse13 (<= .cse19 0)) (.cse14 (<= (* 2 .cse19) 0)) (.cse12 (< v_idx_865 c_ULTIMATE.start_main_p2)) (.cse17 (<= .cse1 v_idx_865))) (let ((.cse5 (let ((.cse20 (or (and .cse13 .cse14) .cse12 .cse17))) (or (and .cse7 .cse20) (and .cse11 (or .cse12 .cse17 (and .cse13 .cse14 .cse15)) .cse18) (and .cse8 .cse20))))) (or (and (<= .cse4 v_idx_863) .cse5) (let ((.cse10 (select |c_#memory_int| v_idx_863))) (and (let ((.cse16 (<= .cse19 .cse10))) (let ((.cse6 (or .cse12 .cse17 (and .cse13 .cse14 .cse16)))) (or (and .cse6 .cse7) (and .cse6 .cse8) (and (<= .cse9 .cse10) .cse11 (or .cse12 (and .cse13 .cse14 .cse15 .cse16) .cse17) .cse18)))) (<= 0 (* 2 .cse10)) (<= 0 .cse10))) (and .cse5 (< v_idx_863 c_ULTIMATE.start_main_p1)))))) (<= .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_875 Int) (v_idx_872 Int) (v_idx_884 Int) (v_idx_878 Int) (v_idx_882 Int) (v_idx_880 Int)) (let ((.cse39 (+ c_ULTIMATE.start_main_p2 1)) (.cse42 (+ c_ULTIMATE.start_main_p2 2)) (.cse41 (+ c_ULTIMATE.start_main_p3 1)) (.cse40 (+ c_ULTIMATE.start_main_p4 1)) (.cse23 (+ 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 ((.cse37 (select |c_#memory_int| v_idx_880)) (.cse35 (select |c_#memory_int| v_idx_884))) (let ((.cse34 (<= .cse35 0)) (.cse32 (<= (+ .cse37 .cse35) 0)) (.cse36 (<= (* 2 .cse35) 0)) (.cse27 (< v_idx_884 c_ULTIMATE.start_main_p4)) (.cse26 (<= .cse40 v_idx_884)) (.cse30 (<= (* 2 .cse37) 0)) (.cse33 (<= .cse37 0)) (.cse28 (< v_idx_880 c_ULTIMATE.start_main_p2)) (.cse29 (<= .cse39 v_idx_880))) (let ((.cse22 (let ((.cse38 (or (and .cse30 .cse33) .cse28 .cse29))) (or (and .cse34 (or (and .cse30 .cse32 .cse33) .cse28 .cse29) .cse36) (and .cse27 .cse38) (and .cse38 .cse26))))) (or (and .cse22 (< v_idx_878 c_ULTIMATE.start_main_p1)) (and .cse22 (<= .cse23 v_idx_878)) (let ((.cse24 (select |c_#memory_int| v_idx_878))) (and (<= 0 (* 2 .cse24)) (<= 0 .cse24) (let ((.cse31 (<= .cse37 .cse24))) (let ((.cse25 (or (and .cse30 .cse31 .cse33) .cse28 .cse29))) (or (and .cse25 .cse26) (and .cse27 .cse25) (and (or .cse28 .cse29 (and .cse30 .cse31 .cse32 .cse33)) .cse34 (<= .cse35 .cse24) .cse36)))))))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (= (select |c_#memory_int| v_idx_882) 0) (< v_idx_882 c_ULTIMATE.start_main_p3) (<= .cse41 v_idx_882)) (<= .cse39 c_ULTIMATE.start_main_p3) (<= .cse42 c_ULTIMATE.start_main_p4) (<= .cse42 c_ULTIMATE.start_malloc_ptr) (<= .cse41 c_ULTIMATE.start_malloc_ptr) (or (= 1 (select |c_#valid| v_idx_875)) (< v_idx_875 c_ULTIMATE.start_main_p4) (<= .cse40 v_idx_875)) (<= .cse41 c_ULTIMATE.start_main_p4) (or (<= .cse40 v_idx_872) (< v_idx_872 c_ULTIMATE.start_main_p4) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_872))) (<= .cse23 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_852 Int) (v_idx_842 Int) (v_idx_850 Int) (v_idx_845 Int) (v_idx_854 Int) (v_idx_848 Int)) (let ((.cse61 (+ c_ULTIMATE.start_main_p2 1)) (.cse64 (+ c_ULTIMATE.start_main_p2 2)) (.cse63 (+ c_ULTIMATE.start_main_p3 1)) (.cse59 (+ 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 ((.cse58 (select |c_#memory_int| v_idx_850)) (.cse46 (select |c_#memory_int| v_idx_848))) (let ((.cse47 (<= 0 (* 2 .cse46))) (.cse48 (<= 0 .cse46)) (.cse53 (<= .cse58 .cse46)) (.cse55 (< v_idx_848 c_ULTIMATE.start_main_p1)) (.cse57 (<= .cse62 v_idx_848)) (.cse49 (< v_idx_850 c_ULTIMATE.start_main_p2)) (.cse51 (<= (* 2 .cse58) 0)) (.cse52 (<= .cse58 0)) (.cse54 (<= .cse61 v_idx_850))) (let ((.cse44 (let ((.cse60 (or .cse49 (and .cse51 .cse52) .cse54))) (or (and .cse47 .cse48 (or .cse49 (and .cse51 .cse52 .cse53) .cse54)) (and .cse55 .cse60) (and .cse57 .cse60))))) (or (and (< v_idx_854 c_ULTIMATE.start_main_p4) .cse44) (let ((.cse45 (select |c_#memory_int| v_idx_854))) (and (<= (* 2 .cse45) 0) (let ((.cse50 (<= (+ .cse58 .cse45) 0))) (let ((.cse56 (or .cse49 (and .cse50 .cse51 .cse52) .cse54))) (or (and (<= .cse45 .cse46) .cse47 .cse48 (or .cse49 (and .cse50 .cse51 .cse52 .cse53) .cse54)) (and .cse55 .cse56) (and .cse57 .cse56)))) (<= .cse45 0))) (and (<= .cse59 v_idx_854) .cse44))))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_842)) (<= .cse59 v_idx_842) (< v_idx_842 c_ULTIMATE.start_main_p4)) (or (<= .cse63 v_idx_852) (< v_idx_852 c_ULTIMATE.start_main_p3) (= (select |c_#memory_int| v_idx_852) 0)) (<= .cse61 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 (< v_idx_845 c_ULTIMATE.start_main_p4) (<= .cse59 v_idx_845) (= 1 (select |c_#valid| v_idx_845))) (<= .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))))) is different from false [2019-02-18 10:10:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:10:40,750 INFO L93 Difference]: Finished difference Result 26 states and 67 transitions. [2019-02-18 10:10:40,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:10:40,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-18 10:10:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:10:40,751 INFO L225 Difference]: With dead ends: 26 [2019-02-18 10:10:40,751 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 10:10:40,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-18 10:10:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 10:10:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-18 10:10:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 10:10:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 64 transitions. [2019-02-18 10:10:40,780 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 64 transitions. Word has length 5 [2019-02-18 10:10:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:10:40,781 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 64 transitions. [2019-02-18 10:10:40,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 10:10:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 64 transitions. [2019-02-18 10:10:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:10:40,781 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:10:40,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:10:40,782 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:10:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash 29112026, now seen corresponding path program 1 times [2019-02-18 10:10:40,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:10:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:40,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:10:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:40,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:10:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:10:40,921 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-18 10:10:40,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:40,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:10:40,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:10:40,922 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-18 10:10:40,923 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:10:40,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:11:10,562 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:11:10,563 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-18 10:11:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:10,563 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:11:11,220 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:11:11,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_962 Int) (v_idx_974 Int) (v_idx_972 Int) (v_idx_965 Int) (v_idx_968 Int) (v_idx_970 Int)) (let ((.cse20 (+ c_ULTIMATE.start_main_p2 2)) (.cse15 (+ c_ULTIMATE.start_main_p3 1)) (.cse18 (+ c_ULTIMATE.start_main_p1 1)) (.cse17 (+ c_ULTIMATE.start_main_p4 1)) (.cse19 (+ c_ULTIMATE.start_main_p2 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 3))) (and (let ((.cse13 (select |c_#memory_int| v_idx_974)) (.cse12 (select |c_#memory_int| v_idx_968))) (let ((.cse4 (<= 0 (* 2 .cse12))) (.cse11 (<= 0 .cse12)) (.cse5 (<= .cse13 .cse12)) (.cse3 (< v_idx_968 c_ULTIMATE.start_main_p1)) (.cse2 (<= .cse18 v_idx_968)) (.cse7 (<= (* 2 .cse13) 0)) (.cse8 (<= .cse13 0)) (.cse9 (<= .cse17 v_idx_974)) (.cse10 (< v_idx_974 c_ULTIMATE.start_main_p4))) (let ((.cse14 (let ((.cse16 (or (and .cse7 .cse8) .cse9 .cse10))) (or (and .cse4 .cse11 (or .cse9 .cse10 (and .cse5 .cse7 .cse8))) (and .cse3 .cse16) (and .cse2 .cse16))))) (or (let ((.cse0 (select |c_#memory_int| v_idx_972))) (and (<= 0 .cse0) (let ((.cse6 (<= .cse13 .cse0))) (let ((.cse1 (or (and .cse6 .cse7 .cse8) .cse9 .cse10))) (or (and .cse1 .cse2) (and .cse1 .cse3) (and .cse4 (or (and .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) .cse11 (<= 0 (+ .cse12 .cse0)))))) (<= 0 (* 2 .cse0)))) (and .cse14 (< v_idx_972 c_ULTIMATE.start_main_p3)) (and .cse14 (<= .cse15 v_idx_972)))))) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (or (< v_idx_965 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_965)) (<= .cse17 v_idx_965)) (<= .cse19 c_ULTIMATE.start_main_p3) (<= .cse20 c_ULTIMATE.start_main_p4) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse15 c_ULTIMATE.start_malloc_ptr) (<= .cse15 c_ULTIMATE.start_main_p4) (<= .cse18 c_ULTIMATE.start_main_p2) (or (< v_idx_962 c_ULTIMATE.start_main_p4) (<= .cse17 v_idx_962) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_962))) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_970) 0) (< v_idx_970 c_ULTIMATE.start_main_p2) (<= .cse19 v_idx_970)) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-18 10:11:12,131 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-18 10:11:12,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1015 Int) (v_idx_1013 Int) (v_idx_1010 Int) (v_idx_1019 Int) (v_idx_1007 Int) (v_idx_1017 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 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 (<= .cse0 v_idx_1007) (< v_idx_1007 c_ULTIMATE.start_main_p4) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1007))) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse2 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_#memory_int| v_idx_1015)) (< v_idx_1015 c_ULTIMATE.start_main_p2) (<= .cse1 v_idx_1015)) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_1010 c_ULTIMATE.start_main_p4) (= 1 (select |c_#valid| v_idx_1010)) (<= .cse0 v_idx_1010)) (<= .cse3 c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p2) (let ((.cse19 (select |c_#memory_int| v_idx_1013)) (.cse7 (select |c_#memory_int| v_idx_1017))) (let ((.cse18 (<= .cse3 v_idx_1017)) (.cse8 (<= 0 .cse7)) (.cse9 (<= 0 (* 2 .cse7))) (.cse15 (<= 0 (+ .cse7 .cse19))) (.cse17 (< v_idx_1017 c_ULTIMATE.start_main_p3)) (.cse10 (< v_idx_1013 c_ULTIMATE.start_main_p1)) (.cse11 (<= .cse4 v_idx_1013)) (.cse13 (<= 0 .cse19)) (.cse14 (<= 0 (* 2 .cse19)))) (let ((.cse5 (let ((.cse20 (or .cse10 .cse11 (and .cse13 .cse14)))) (or (and .cse18 .cse20) (and .cse8 .cse9 (or .cse10 .cse11 (and .cse13 .cse14 .cse15))) (and .cse20 .cse17))))) (or (and .cse5 (< v_idx_1019 c_ULTIMATE.start_main_p4)) (and .cse5 (<= .cse0 v_idx_1019)) (let ((.cse6 (select |c_#memory_int| v_idx_1019))) (and (<= (* 2 .cse6) 0) (let ((.cse12 (<= .cse6 .cse19))) (let ((.cse16 (or .cse10 .cse11 (and .cse12 .cse13 .cse14)))) (or (and (<= .cse6 .cse7) .cse8 .cse9 (or .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15))) (and .cse16 .cse17) (and .cse18 .cse16)))) (<= .cse6 0))))))) (<= .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-18 10:11:12,551 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-18 10:11:12,552 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:11:12,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:11:12,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2019-02-18 10:11:12,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:11:12,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:11:12,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:11:12,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-18 10:11:12,553 INFO L87 Difference]: Start difference. First operand 23 states and 64 transitions. Second operand 6 states. [2019-02-18 10:11:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:11:36,599 INFO L93 Difference]: Finished difference Result 27 states and 72 transitions. [2019-02-18 10:11:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:11:36,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-18 10:11:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:11:36,600 INFO L225 Difference]: With dead ends: 27 [2019-02-18 10:11:36,600 INFO L226 Difference]: Without dead ends: 25 [2019-02-18 10:11:36,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-18 10:11:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-18 10:11:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-02-18 10:11:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 10:11:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2019-02-18 10:11:36,638 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 65 transitions. Word has length 5 [2019-02-18 10:11:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:11:36,638 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 65 transitions. [2019-02-18 10:11:36,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:11:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 65 transitions. [2019-02-18 10:11:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:11:36,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:11:36,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:11:36,640 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:11:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:36,640 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-18 10:11:36,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:11:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:36,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:11:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:36,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:11:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:11:36,816 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-18 10:11:36,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:36,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:11:36,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:11:36,817 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-18 10:11:36,817 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:11:36,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:12:08,102 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:12:08,102 INFO L272 AbstractInterpreter]: Visited 5 different actions 61 times. Merged at 3 different actions 14 times. Widened at 3 different actions 10 times. Found 31 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:12:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:12:08,102 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:12:08,698 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:12:10,638 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-18 10:12:10,638 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:12:10,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:12:10,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2019-02-18 10:12:10,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:12:10,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:12:10,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:12:10,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:12:10,639 INFO L87 Difference]: Start difference. First operand 24 states and 65 transitions. Second operand 3 states. [2019-02-18 10:12:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:12:14,620 INFO L93 Difference]: Finished difference Result 34 states and 82 transitions. [2019-02-18 10:12:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:12:14,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-02-18 10:12:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:12:14,621 INFO L225 Difference]: With dead ends: 34 [2019-02-18 10:12:14,622 INFO L226 Difference]: Without dead ends: 26 [2019-02-18 10:12:14,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:12:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-18 10:12:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-18 10:12:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 10:12:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 69 transitions. [2019-02-18 10:12:14,652 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 69 transitions. Word has length 5 [2019-02-18 10:12:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:12:14,653 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 69 transitions. [2019-02-18 10:12:14,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:12:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 69 transitions. [2019-02-18 10:12:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:12:14,653 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:12:14,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:12:14,654 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:12:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:12:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash 28817960, now seen corresponding path program 1 times [2019-02-18 10:12:14,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:12:14,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:12:14,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:12:14,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:12:14,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:12:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:12:14,801 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-18 10:12:14,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:12:14,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:12:14,802 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:12:14,802 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [19] [2019-02-18 10:12:14,803 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:12:14,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:12:42,052 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:12:42,052 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-18 10:12:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:12:42,052 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:12:42,619 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:12:42,991 WARN L838 $PredicateComparison]: unable to prove that (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 ((.cse1 (+ c_ULTIMATE.start_main_p2 2)) (.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse2 (+ c_ULTIMATE.start_main_p3 1)) (.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse4 (+ 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) (<= .cse0 c_ULTIMATE.start_main_p3) (<= .cse1 c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_main_p4) (or (<= .cse3 v_idx_1202) (< v_idx_1202 c_ULTIMATE.start_main_p4) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1202) 0)) (or (<= .cse3 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) (<= .cse3 v_idx_1205) (< v_idx_1205 c_ULTIMATE.start_main_p4)) (<= .cse4 c_ULTIMATE.start_main_p2) (let ((.cse18 (select |c_#memory_int| v_idx_1210)) (.cse8 (select |c_#memory_int| v_idx_1208))) (let ((.cse9 (<= 0 .cse8)) (.cse10 (<= 0 (* 2 .cse8))) (.cse15 (<= .cse18 .cse8)) (.cse7 (< v_idx_1208 c_ULTIMATE.start_main_p1)) (.cse17 (<= .cse4 v_idx_1208)) (.cse11 (<= .cse0 v_idx_1210)) (.cse13 (<= (* 2 .cse18) 0)) (.cse14 (<= .cse18 0)) (.cse16 (< v_idx_1210 c_ULTIMATE.start_main_p2))) (let ((.cse19 (let ((.cse20 (or .cse11 (and .cse13 .cse14) .cse16))) (or (and .cse9 .cse10 (or .cse11 (and .cse13 .cse14 .cse15) .cse16)) (and .cse20 .cse7) (and .cse20 .cse17))))) (or (let ((.cse5 (select |c_#memory_int| v_idx_1212))) (and (<= 0 .cse5) (<= 0 (* 2 .cse5)) (let ((.cse12 (<= .cse18 .cse5))) (let ((.cse6 (or .cse11 (and .cse12 .cse13 .cse14) .cse16))) (or (and .cse6 .cse7) (and (<= 0 (+ .cse8 .cse5)) .cse9 .cse10 (or .cse11 (and .cse12 .cse13 .cse14 .cse15) .cse16)) (and .cse6 .cse17)))))) (and (< v_idx_1212 c_ULTIMATE.start_main_p3) .cse19) (and .cse19 (<= .cse2 v_idx_1212)))))) (<= .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-18 10:12:43,376 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)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 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) (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) (let ((.cse18 (select |c_#memory_int| v_idx_1223)) (.cse16 (select |c_#memory_int| v_idx_1227))) (let ((.cse8 (<= 0 (* 2 .cse16))) (.cse17 (<= 0 .cse16)) (.cse11 (<= 0 (+ .cse18 .cse16))) (.cse6 (<= .cse3 v_idx_1227)) (.cse7 (< v_idx_1227 c_ULTIMATE.start_main_p3)) (.cse13 (< v_idx_1223 c_ULTIMATE.start_main_p1)) (.cse9 (<= 0 .cse18)) (.cse10 (<= 0 (* 2 .cse18))) (.cse14 (<= .cse20 v_idx_1223))) (let ((.cse4 (let ((.cse19 (or .cse13 (and .cse9 .cse10) .cse14))) (or (and .cse8 .cse17 (or .cse13 (and .cse9 .cse10 .cse11) .cse14)) (and .cse19 .cse6) (and .cse7 .cse19))))) (or (and (<= .cse1 v_idx_1225) .cse4) (and (< v_idx_1225 c_ULTIMATE.start_main_p2) .cse4) (let ((.cse15 (select |c_#memory_int| v_idx_1225))) (and (let ((.cse12 (<= .cse15 .cse18))) (let ((.cse5 (or .cse13 (and .cse9 .cse10 .cse12) .cse14))) (or (and .cse5 .cse6) (and .cse7 .cse5) (and .cse8 (or (and .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) (<= .cse15 .cse16) .cse17)))) (<= (* 2 .cse15) 0) (<= .cse15 0))))))) (<= .cse20 c_ULTIMATE.start_main_p2) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p4)))) is different from false [2019-02-18 10:12:44,439 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-18 10:12:44,440 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:12:44,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:12:44,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-02-18 10:12:44,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:12:44,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 10:12:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 10:12:44,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-18 10:12:44,441 INFO L87 Difference]: Start difference. First operand 25 states and 69 transitions. Second operand 5 states. [2019-02-18 10:12:46,149 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_1235 Int) (v_idx_1244 Int) (v_idx_1232 Int) (v_idx_1242 Int) (v_idx_1240 Int) (v_idx_1238 Int)) (let ((.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)) (.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) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1232) 0) (< v_idx_1232 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_1232)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_main_p3) (<= .cse2 c_ULTIMATE.start_main_p4) (or (<= .cse0 v_idx_1244) (= (select |c_#memory_int| v_idx_1244) 0) (< v_idx_1244 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_1235) (= (select |c_#valid| v_idx_1235) 1) (< v_idx_1235 c_ULTIMATE.start_main_p4)) (let ((.cse17 (select |c_#memory_int| v_idx_1240)) (.cse5 (select |c_#memory_int| v_idx_1242))) (let ((.cse12 (<= .cse17 .cse5)) (.cse6 (<= 0 (* 2 .cse5))) (.cse7 (<= 0 .cse5)) (.cse14 (< v_idx_1242 c_ULTIMATE.start_main_p3)) (.cse16 (<= .cse3 v_idx_1242)) (.cse9 (<= .cse17 0)) (.cse11 (<= (* 2 .cse17) 0)) (.cse8 (< v_idx_1240 c_ULTIMATE.start_main_p2)) (.cse13 (<= .cse1 v_idx_1240))) (let ((.cse19 (let ((.cse20 (or (and .cse9 .cse11) .cse8 .cse13))) (or (and (or (and .cse9 .cse11 .cse12) .cse8 .cse13) .cse6 .cse7) (and .cse14 .cse20) (and .cse20 .cse16))))) (or (let ((.cse4 (select |c_#memory_int| v_idx_1238))) (and (<= 0 .cse4) (<= 0 (* 2 .cse4)) (let ((.cse10 (<= .cse17 .cse4))) (let ((.cse15 (or .cse8 (and .cse9 .cse10 .cse11) .cse13))) (or (and (<= 0 (+ .cse4 .cse5)) .cse6 .cse7 (or .cse8 (and .cse9 .cse10 .cse11 .cse12) .cse13)) (and .cse14 .cse15) (and .cse15 .cse16)))))) (and (<= .cse18 v_idx_1238) .cse19) (and (< v_idx_1238 c_ULTIMATE.start_main_p1) .cse19))))) (<= .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_1214 Int) (v_idx_1202 Int) (v_idx_1212 Int) (v_idx_1210 Int) (v_idx_1208 Int) (v_idx_1205 Int)) (let ((.cse23 (+ c_ULTIMATE.start_main_p2 2)) (.cse25 (+ c_ULTIMATE.start_main_p4 1)) (.cse24 (+ c_ULTIMATE.start_main_p3 1)) (.cse22 (+ c_ULTIMATE.start_main_p2 1)) (.cse26 (+ 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) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= .cse22 c_ULTIMATE.start_main_p3) (<= .cse23 c_ULTIMATE.start_main_p4) (<= .cse23 c_ULTIMATE.start_malloc_ptr) (<= .cse24 c_ULTIMATE.start_malloc_ptr) (<= .cse24 c_ULTIMATE.start_main_p4) (or (<= .cse25 v_idx_1202) (< v_idx_1202 c_ULTIMATE.start_main_p4) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1202) 0)) (or (<= .cse25 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) (<= .cse25 v_idx_1205) (< v_idx_1205 c_ULTIMATE.start_main_p4)) (<= .cse26 c_ULTIMATE.start_main_p2) (let ((.cse40 (select |c_#memory_int| v_idx_1210)) (.cse30 (select |c_#memory_int| v_idx_1208))) (let ((.cse31 (<= 0 .cse30)) (.cse32 (<= 0 (* 2 .cse30))) (.cse37 (<= .cse40 .cse30)) (.cse29 (< v_idx_1208 c_ULTIMATE.start_main_p1)) (.cse39 (<= .cse26 v_idx_1208)) (.cse33 (<= .cse22 v_idx_1210)) (.cse35 (<= (* 2 .cse40) 0)) (.cse36 (<= .cse40 0)) (.cse38 (< v_idx_1210 c_ULTIMATE.start_main_p2))) (let ((.cse41 (let ((.cse42 (or .cse33 (and .cse35 .cse36) .cse38))) (or (and .cse31 .cse32 (or .cse33 (and .cse35 .cse36 .cse37) .cse38)) (and .cse42 .cse29) (and .cse42 .cse39))))) (or (let ((.cse27 (select |c_#memory_int| v_idx_1212))) (and (<= 0 .cse27) (<= 0 (* 2 .cse27)) (let ((.cse34 (<= .cse40 .cse27))) (let ((.cse28 (or .cse33 (and .cse34 .cse35 .cse36) .cse38))) (or (and .cse28 .cse29) (and (<= 0 (+ .cse30 .cse27)) .cse31 .cse32 (or .cse33 (and .cse34 .cse35 .cse36 .cse37) .cse38)) (and .cse28 .cse39)))))) (and (< v_idx_1212 c_ULTIMATE.start_main_p3) .cse41) (and .cse41 (<= .cse24 v_idx_1212)))))) (<= .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_1225 Int) (v_idx_1223 Int) (v_idx_1220 Int) (v_idx_1229 Int) (v_idx_1217 Int) (v_idx_1227 Int)) (let ((.cse44 (+ c_ULTIMATE.start_main_p4 1)) (.cse46 (+ c_ULTIMATE.start_main_p2 2)) (.cse45 (+ c_ULTIMATE.start_main_p2 1)) (.cse47 (+ c_ULTIMATE.start_main_p3 1)) (.cse64 (+ c_ULTIMATE.start_main_p1 1)) (.cse65 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (<= .cse44 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) (<= .cse44 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) (<= .cse44 v_idx_1229)) (<= .cse45 c_ULTIMATE.start_main_p3) (<= .cse46 c_ULTIMATE.start_main_p4) (<= .cse46 c_ULTIMATE.start_malloc_ptr) (<= .cse47 c_ULTIMATE.start_malloc_ptr) (<= .cse47 c_ULTIMATE.start_main_p4) (let ((.cse62 (select |c_#memory_int| v_idx_1223)) (.cse60 (select |c_#memory_int| v_idx_1227))) (let ((.cse52 (<= 0 (* 2 .cse60))) (.cse61 (<= 0 .cse60)) (.cse55 (<= 0 (+ .cse62 .cse60))) (.cse50 (<= .cse47 v_idx_1227)) (.cse51 (< v_idx_1227 c_ULTIMATE.start_main_p3)) (.cse57 (< v_idx_1223 c_ULTIMATE.start_main_p1)) (.cse53 (<= 0 .cse62)) (.cse54 (<= 0 (* 2 .cse62))) (.cse58 (<= .cse64 v_idx_1223))) (let ((.cse48 (let ((.cse63 (or .cse57 (and .cse53 .cse54) .cse58))) (or (and .cse52 .cse61 (or .cse57 (and .cse53 .cse54 .cse55) .cse58)) (and .cse63 .cse50) (and .cse51 .cse63))))) (or (and (<= .cse45 v_idx_1225) .cse48) (and (< v_idx_1225 c_ULTIMATE.start_main_p2) .cse48) (let ((.cse59 (select |c_#memory_int| v_idx_1225))) (and (let ((.cse56 (<= .cse59 .cse62))) (let ((.cse49 (or .cse57 (and .cse53 .cse54 .cse56) .cse58))) (or (and .cse49 .cse50) (and .cse51 .cse49) (and .cse52 (or (and .cse53 .cse54 .cse55 .cse56) .cse57 .cse58) (<= .cse59 .cse60) .cse61)))) (<= (* 2 .cse59) 0) (<= .cse59 0))))))) (<= .cse64 c_ULTIMATE.start_main_p2) (<= .cse65 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (<= .cse65 c_ULTIMATE.start_main_p4))))) is different from false [2019-02-18 10:13:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:13:19,523 INFO L93 Difference]: Finished difference Result 34 states and 84 transitions. [2019-02-18 10:13:19,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:13:19,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-18 10:13:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:13:19,524 INFO L225 Difference]: With dead ends: 34 [2019-02-18 10:13:19,524 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 10:13:19,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-18 10:13:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 10:13:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-18 10:13:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-18 10:13:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 77 transitions. [2019-02-18 10:13:19,566 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 77 transitions. Word has length 5 [2019-02-18 10:13:19,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:19,566 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 77 transitions. [2019-02-18 10:13:19,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 10:13:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 77 transitions. [2019-02-18 10:13:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:13:19,567 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:19,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:13:19,567 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:19,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:19,567 INFO L82 PathProgramCache]: Analyzing trace with hash 902468826, now seen corresponding path program 1 times [2019-02-18 10:13:19,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:19,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:19,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:19,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:19,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:19,815 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-18 10:13:19,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:19,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:13:19,815 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:13:19,815 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-18 10:13:19,816 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:13:19,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:14:02,247 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:14:02,247 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-18 10:14:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:02,247 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:14:03,052 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:14:03,666 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 ((.cse31 (+ c_ULTIMATE.start_main_p2 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 2)) (.cse30 (+ c_ULTIMATE.start_main_p3 1)) (.cse29 (+ c_ULTIMATE.start_main_p1 1)) (.cse25 (+ c_ULTIMATE.start_main_p4 1)) (.cse33 (+ c_ULTIMATE.start_main_p1 3))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (let ((.cse23 (select |c_#memory_int| v_idx_1343)) (.cse24 (select |c_#memory_int| v_idx_1347)) (.cse5 (select |c_#memory_int| v_idx_1345))) (let ((.cse21 (<= .cse31 v_idx_1345)) (.cse4 (<= (* 2 .cse5) 0)) (.cse9 (<= .cse5 .cse24)) (.cse13 (<= .cse5 .cse23)) (.cse20 (<= .cse5 0)) (.cse3 (< v_idx_1345 c_ULTIMATE.start_main_p2)) (.cse6 (< v_idx_1347 c_ULTIMATE.start_main_p3)) (.cse8 (<= .cse30 v_idx_1347)) (.cse17 (<= 0 .cse24)) (.cse15 (<= 0 (+ .cse24 .cse23))) (.cse19 (<= 0 (* 2 .cse24))) (.cse10 (<= .cse29 v_idx_1343)) (.cse11 (<= 0 .cse23)) (.cse12 (<= 0 (* 2 .cse23))) (.cse16 (< v_idx_1343 c_ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse26 (let ((.cse28 (or .cse10 (and .cse11 .cse12) .cse16))) (or (and .cse6 .cse28) (and .cse8 .cse28) (and .cse17 (or .cse10 (and .cse11 .cse12 .cse15) .cse16) .cse19))))) (or (and .cse26 .cse21) (and .cse4 (let ((.cse27 (or .cse10 (and .cse11 .cse12 .cse13) .cse16))) (or (and .cse9 .cse17 (or .cse10 (and .cse11 .cse12 .cse13 .cse15) .cse16) .cse19) (and .cse6 .cse27) (and .cse8 .cse27))) .cse20) (and .cse26 .cse3))))) (or (and .cse0 (< v_idx_1349 c_ULTIMATE.start_main_p4)) (let ((.cse1 (select |c_#memory_int| v_idx_1349))) (and (<= (* 2 .cse1) 0) (let ((.cse18 (<= .cse1 .cse24)) (.cse14 (<= .cse1 .cse23))) (let ((.cse2 (let ((.cse22 (or .cse10 (and .cse11 .cse12 .cse14) .cse16))) (or (and .cse22 .cse6) (and (or .cse10 (and .cse11 .cse12 .cse14 .cse15) .cse16) .cse17 .cse18 .cse19) (and .cse8 .cse22))))) (or (and .cse2 .cse3) (and .cse4 (<= (+ .cse5 .cse1) 0) (let ((.cse7 (or .cse10 (and .cse11 .cse12 .cse13 .cse14) .cse16))) (or (and .cse6 .cse7) (and .cse8 .cse7) (and .cse9 (or .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse16) .cse17 .cse18 .cse19))) .cse20) (and .cse21 .cse2)))) (<= .cse1 0))) (and .cse0 (<= .cse25 v_idx_1349)))))) (<= .cse31 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) (<= .cse25 v_idx_1337)) (<= .cse32 c_ULTIMATE.start_malloc_ptr) (<= .cse30 c_ULTIMATE.start_malloc_ptr) (<= .cse30 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)) (<= .cse25 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-18 10:14:04,290 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)) (.cse2 (+ 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)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (let ((.cse25 (select |c_#memory_int| v_idx_1362)) (.cse18 (select |c_#memory_int| v_idx_1364)) (.cse26 (select |c_#memory_int| v_idx_1358))) (let ((.cse22 (< v_idx_1364 c_ULTIMATE.start_main_p4)) (.cse23 (<= .cse0 v_idx_1364)) (.cse14 (<= .cse18 .cse26)) (.cse10 (<= .cse18 .cse25)) (.cse19 (<= .cse18 0)) (.cse20 (<= (* 2 .cse18) 0)) (.cse17 (< v_idx_1358 c_ULTIMATE.start_main_p1)) (.cse15 (<= 0 (* 2 .cse26))) (.cse11 (<= 0 (+ .cse25 .cse26))) (.cse16 (<= 0 .cse26)) (.cse4 (<= .cse31 v_idx_1358)) (.cse6 (< v_idx_1362 c_ULTIMATE.start_main_p3)) (.cse8 (<= 0 (* 2 .cse25))) (.cse12 (<= 0 .cse25)) (.cse7 (<= .cse30 v_idx_1362))) (let ((.cse1 (let ((.cse27 (let ((.cse29 (or .cse6 (and .cse8 .cse12) .cse7))) (or (and .cse29 .cse17) (and .cse15 (or (and .cse8 .cse11 .cse12) .cse6 .cse7) .cse16) (and .cse29 .cse4))))) (or (and .cse22 .cse27) (and .cse23 .cse27) (and (let ((.cse28 (or .cse6 .cse7 (and .cse8 .cse10 .cse12)))) (or (and .cse4 .cse28) (and (or .cse6 .cse7 (and .cse8 .cse10 .cse11 .cse12)) .cse14 .cse15 .cse16) (and .cse28 .cse17))) .cse19 .cse20))))) (or (and (< v_idx_1360 c_ULTIMATE.start_main_p2) .cse1) (and (<= .cse2 v_idx_1360) .cse1) (let ((.cse3 (select |c_#memory_int| v_idx_1360))) (and (<= (* 2 .cse3) 0) (let ((.cse13 (<= .cse3 .cse26)) (.cse9 (<= .cse3 .cse25))) (let ((.cse21 (let ((.cse24 (or .cse6 .cse7 (and .cse8 .cse9 .cse12)))) (or (and .cse13 .cse15 (or .cse6 (and .cse8 .cse9 .cse11 .cse12) .cse7) .cse16) (and .cse24 .cse17) (and .cse4 .cse24))))) (or (and (let ((.cse5 (or .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse12)))) (or (and .cse4 .cse5) (and (or .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12)) .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse5))) (<= (+ .cse3 .cse18) 0) .cse19 .cse20) (and .cse21 .cse22) (and .cse23 .cse21)))) (<= .cse3 0))))))) (or (= (select |c_#valid| v_idx_1355) 1) (< v_idx_1355 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_1355)) (<= .cse2 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-18 10:14:05,564 WARN L838 $PredicateComparison]: unable to prove that (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 ((.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse5 (+ c_ULTIMATE.start_main_p1 3)) (.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_1385 c_ULTIMATE.start_main_p4) (<= .cse0 v_idx_1385) (= 1 (select |c_#valid| v_idx_1385))) (<= 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 (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1382)) (<= .cse0 v_idx_1382) (< v_idx_1382 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 ((.cse29 (select |c_#memory_int| v_idx_1388)) (.cse12 (select |c_#memory_int| v_idx_1392)) (.cse30 (select |c_#memory_int| v_idx_1390))) (let ((.cse14 (< v_idx_1390 c_ULTIMATE.start_main_p2)) (.cse16 (<= .cse30 0)) (.cse15 (<= .cse30 .cse12)) (.cse17 (<= .cse30 .cse29)) (.cse24 (<= (* 2 .cse30) 0)) (.cse26 (<= .cse1 v_idx_1390)) (.cse21 (<= 0 (+ .cse12 .cse29))) (.cse11 (<= 0 .cse12)) (.cse27 (<= 0 (* 2 .cse12))) (.cse8 (<= .cse3 v_idx_1392)) (.cse10 (< v_idx_1392 c_ULTIMATE.start_main_p3)) (.cse22 (<= .cse4 v_idx_1388)) (.cse23 (< v_idx_1388 c_ULTIMATE.start_main_p1)) (.cse18 (<= 0 .cse29)) (.cse19 (<= 0 (* 2 .cse29)))) (let ((.cse6 (let ((.cse31 (let ((.cse33 (or .cse22 .cse23 (and .cse18 .cse19)))) (or (and (or (and .cse18 .cse19 .cse21) .cse22 .cse23) .cse11 .cse27) (and .cse33 .cse8) (and .cse10 .cse33))))) (or (and .cse31 .cse14) (and .cse16 (let ((.cse32 (or (and .cse17 .cse18 .cse19) .cse22 .cse23))) (or (and .cse32 .cse10) (and .cse15 .cse11 (or (and .cse17 .cse18 .cse19 .cse21) .cse22 .cse23) .cse27) (and .cse32 .cse8))) .cse24) (and .cse31 .cse26))))) (or (and .cse6 (<= .cse0 v_idx_1394)) (and .cse6 (< v_idx_1394 c_ULTIMATE.start_main_p4)) (let ((.cse7 (select |c_#memory_int| v_idx_1394))) (and (<= (* 2 .cse7) 0) (let ((.cse25 (<= (+ .cse7 .cse30) 0)) (.cse20 (<= .cse7 .cse29))) (let ((.cse9 (let ((.cse28 (or .cse22 .cse23 (and .cse18 .cse19 .cse20)))) (or (and .cse28 .cse26) (and .cse14 .cse28) (and .cse16 .cse24 (or .cse22 .cse23 (and .cse17 .cse18 .cse19 .cse20)) .cse25))))) (or (and .cse8 .cse9) (and .cse10 .cse9) (and .cse11 (<= .cse7 .cse12) (let ((.cse13 (or (and .cse18 .cse19 .cse20 .cse21) .cse22 .cse23))) (or (and .cse13 .cse14) (and .cse15 .cse16 (or (and .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23) .cse24 .cse25) (and .cse13 .cse26))) .cse27)))) (<= .cse7 0)))))))))) is different from false [2019-02-18 10:14:07,257 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-02-18 10:14:07,257 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:14:07,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:14:07,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2019-02-18 10:14:07,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:14:07,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:14:07,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:14:07,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-18 10:14:07,258 INFO L87 Difference]: Start difference. First operand 27 states and 77 transitions. Second operand 6 states. [2019-02-18 10:14:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:14:18,123 INFO L93 Difference]: Finished difference Result 27 states and 77 transitions. [2019-02-18 10:14:18,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:14:18,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-18 10:14:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:14:18,124 INFO L225 Difference]: With dead ends: 27 [2019-02-18 10:14:18,124 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 10:14:18,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-02-18 10:14:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 10:14:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 10:14:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 10:14:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 10:14:18,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-18 10:14:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:14:18,125 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 10:14:18,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:14:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 10:14:18,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 10:14:18,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 10:14:18,778 WARN L181 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 10:14:18,780 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-18 10:14:18,780 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-02-18 10:14:18,780 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-02-18 10:14:18,780 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-02-18 10:14:18,781 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (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 (+ ULTIMATE.start_main_p4 1)) (.cse26 (+ ULTIMATE.start_main_p2 1)) (.cse32 (+ ULTIMATE.start_main_p2 2)) (.cse31 (+ ULTIMATE.start_main_p3 1)) (.cse30 (+ ULTIMATE.start_main_p1 1)) (.cse33 (+ ULTIMATE.start_main_p1 3))) (and (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (or (< v_idx_1370 ULTIMATE.start_main_p4) (= 1 (select |#valid| v_idx_1370)) (<= .cse0 v_idx_1370)) (let ((.cse18 (select |#memory_int| v_idx_1379)) (.cse23 (select |#memory_int| v_idx_1373)) (.cse24 (select |#memory_int| v_idx_1377))) (let ((.cse5 (< v_idx_1377 ULTIMATE.start_main_p3)) (.cse4 (<= .cse31 v_idx_1377)) (.cse6 (<= 0 .cse24)) (.cse15 (<= 0 (* 2 .cse24))) (.cse11 (<= 0 (+ .cse23 .cse24))) (.cse14 (<= .cse18 .cse24)) (.cse9 (<= .cse18 .cse23)) (.cse10 (<= 0 (* 2 .cse23))) (.cse12 (<= 0 .cse23)) (.cse7 (< v_idx_1373 ULTIMATE.start_main_p1)) (.cse8 (<= .cse30 v_idx_1373)) (.cse17 (<= (* 2 .cse18) 0)) (.cse20 (<= .cse18 0)) (.cse1 (<= .cse0 v_idx_1379)) (.cse21 (< v_idx_1379 ULTIMATE.start_main_p4))) (let ((.cse25 (let ((.cse27 (let ((.cse29 (or (and .cse17 .cse20) .cse1 .cse21))) (or (and (or .cse1 (and .cse17 .cse9 .cse20) .cse21) .cse10 .cse12) (and .cse29 .cse7) (and .cse29 .cse8))))) (or (and .cse27 .cse5) (and .cse27 .cse4) (and .cse6 .cse15 (let ((.cse28 (or .cse1 (and .cse14 .cse17 .cse20) .cse21))) (or (and .cse10 .cse11 .cse12 (or (and .cse14 .cse17 .cse9 .cse20) .cse1 .cse21)) (and .cse28 .cse8) (and .cse28 .cse7)))))))) (or (let ((.cse19 (select |#memory_int| v_idx_1375))) (and (let ((.cse16 (<= .cse19 .cse24)) (.cse13 (<= .cse19 .cse23))) (let ((.cse2 (let ((.cse22 (or (and .cse10 .cse12 .cse13) .cse7 .cse8))) (or (and .cse22 .cse5) (and .cse6 .cse15 .cse16 (or (and .cse10 .cse11 .cse12 .cse13) .cse7 .cse8)) (and .cse22 .cse4))))) (or (and .cse1 .cse2) (and (let ((.cse3 (or (and .cse9 .cse10 .cse12 .cse13) .cse7 .cse8))) (or (and .cse3 .cse4) (and .cse3 .cse5) (and .cse6 (or .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13)) .cse14 .cse15 .cse16))) .cse17 (<= (+ .cse18 .cse19) 0) .cse20) (and .cse2 .cse21)))) (<= .cse19 0) (<= (* 2 .cse19) 0))) (and (< v_idx_1375 ULTIMATE.start_main_p2) .cse25) (and (<= .cse26 v_idx_1375) .cse25))))) (or (<= .cse0 v_idx_1367) (< v_idx_1367 ULTIMATE.start_main_p4) (= (select |ULTIMATE.start_malloc_old_#valid| v_idx_1367) 0)) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p4) (<= .cse26 ULTIMATE.start_main_p3) (<= .cse32 ULTIMATE.start_main_p4) (<= .cse32 ULTIMATE.start_malloc_ptr) (<= .cse31 ULTIMATE.start_malloc_ptr) (<= .cse31 ULTIMATE.start_main_p4) (<= .cse30 ULTIMATE.start_main_p2) (<= .cse33 ULTIMATE.start_malloc_ptr) (<= ULTIMATE.start_main_p4 ULTIMATE.start_malloc_ptr) (<= .cse33 ULTIMATE.start_main_p4)))) [2019-02-18 10:14:18,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-02-18 10:14:18,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-18 10:14:18,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-02-18 10:14:18,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-02-18 10:14:18,781 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-02-18 10:14:18,781 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-02-18 10:14:18,802 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 10:14:18 BoogieIcfgContainer [2019-02-18 10:14:18,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 10:14:18,803 INFO L168 Benchmark]: Toolchain (without parser) took 459141.79 ms. Allocated memory was 141.6 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 109.1 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 185.0 MB. Max. memory is 7.1 GB. [2019-02-18 10:14:18,804 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 10:14:18,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.14 ms. Allocated memory is still 141.6 MB. Free memory was 108.7 MB in the beginning and 106.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-18 10:14:18,806 INFO L168 Benchmark]: Boogie Preprocessor took 25.48 ms. Allocated memory is still 141.6 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-18 10:14:18,806 INFO L168 Benchmark]: RCFGBuilder took 255.26 ms. Allocated memory is still 141.6 MB. Free memory was 105.3 MB in the beginning and 94.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-02-18 10:14:18,807 INFO L168 Benchmark]: TraceAbstraction took 458805.42 ms. Allocated memory was 141.6 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 94.8 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 170.7 MB. Max. memory is 7.1 GB. [2019-02-18 10:14:18,812 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 141.6 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.14 ms. Allocated memory is still 141.6 MB. Free memory was 108.7 MB in the beginning and 106.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.48 ms. Allocated memory is still 141.6 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 255.26 ms. Allocated memory is still 141.6 MB. Free memory was 105.3 MB in the beginning and 94.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 458805.42 ms. Allocated memory was 141.6 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 94.8 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 170.7 MB. 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_1379 : int, v_idx_1367 : int, v_idx_1377 : int, v_idx_1375 : int, v_idx_1373 : int, v_idx_1370 : int :: ((((((((((((p1 + 2 <= p3 && ((v_idx_1370 < p4 || 1 == #valid[v_idx_1370]) || p4 + 1 <= v_idx_1370)) && (((((((p4 + 1 <= v_idx_1379 && (((((((0 <= 2 * #memory_int[v_idx_1373] && 0 <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1373]) || v_idx_1373 < p1) || p1 + 1 <= v_idx_1373) && v_idx_1377 < p3) || (((0 <= #memory_int[v_idx_1377] && 0 <= 2 * #memory_int[v_idx_1377]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1377]) && (((((0 <= 2 * #memory_int[v_idx_1373] && 0 <= #memory_int[v_idx_1373] + #memory_int[v_idx_1377]) && 0 <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1373]) || v_idx_1373 < p1) || p1 + 1 <= v_idx_1373))) || (((((0 <= 2 * #memory_int[v_idx_1373] && 0 <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1373]) || v_idx_1373 < p1) || p1 + 1 <= v_idx_1373) && p3 + 1 <= v_idx_1377))) || (((((((((((#memory_int[v_idx_1379] <= #memory_int[v_idx_1373] && 0 <= 2 * #memory_int[v_idx_1373]) && 0 <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1373]) || v_idx_1373 < p1) || p1 + 1 <= v_idx_1373) && p3 + 1 <= v_idx_1377) || ((((((#memory_int[v_idx_1379] <= #memory_int[v_idx_1373] && 0 <= 2 * #memory_int[v_idx_1373]) && 0 <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1373]) || v_idx_1373 < p1) || p1 + 1 <= v_idx_1373) && v_idx_1377 < p3)) || ((((0 <= #memory_int[v_idx_1377] && ((v_idx_1373 < p1 || p1 + 1 <= v_idx_1373) || ((((#memory_int[v_idx_1379] <= #memory_int[v_idx_1373] && 0 <= 2 * #memory_int[v_idx_1373]) && 0 <= #memory_int[v_idx_1373] + #memory_int[v_idx_1377]) && 0 <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1373]))) && #memory_int[v_idx_1379] <= #memory_int[v_idx_1377]) && 0 <= 2 * #memory_int[v_idx_1377]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1377])) && 2 * #memory_int[v_idx_1379] <= 0) && #memory_int[v_idx_1379] + #memory_int[v_idx_1375] <= 0) && #memory_int[v_idx_1379] <= 0)) || ((((((((0 <= 2 * #memory_int[v_idx_1373] && 0 <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1373]) || v_idx_1373 < p1) || p1 + 1 <= v_idx_1373) && v_idx_1377 < p3) || (((0 <= #memory_int[v_idx_1377] && 0 <= 2 * #memory_int[v_idx_1377]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1377]) && (((((0 <= 2 * #memory_int[v_idx_1373] && 0 <= #memory_int[v_idx_1373] + #memory_int[v_idx_1377]) && 0 <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1373]) || v_idx_1373 < p1) || p1 + 1 <= v_idx_1373))) || (((((0 <= 2 * #memory_int[v_idx_1373] && 0 <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1375] <= #memory_int[v_idx_1373]) || v_idx_1373 < p1) || p1 + 1 <= v_idx_1373) && p3 + 1 <= v_idx_1377)) && v_idx_1379 < p4)) && #memory_int[v_idx_1375] <= 0) && 2 * #memory_int[v_idx_1375] <= 0) || (v_idx_1375 < p2 && (((((((((p4 + 1 <= v_idx_1379 || ((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1379] <= 0)) || v_idx_1379 < p4) && 0 <= 2 * #memory_int[v_idx_1373]) && 0 <= #memory_int[v_idx_1373]) || ((((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4) && v_idx_1373 < p1)) || ((((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4) && p1 + 1 <= v_idx_1373)) && v_idx_1377 < p3) || (((((((p4 + 1 <= v_idx_1379 || ((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1379] <= 0)) || v_idx_1379 < p4) && 0 <= 2 * #memory_int[v_idx_1373]) && 0 <= #memory_int[v_idx_1373]) || ((((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4) && v_idx_1373 < p1)) || ((((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4) && p1 + 1 <= v_idx_1373)) && p3 + 1 <= v_idx_1377)) || ((0 <= #memory_int[v_idx_1377] && 0 <= 2 * #memory_int[v_idx_1377]) && (((((0 <= 2 * #memory_int[v_idx_1373] && 0 <= #memory_int[v_idx_1373] + #memory_int[v_idx_1377]) && 0 <= #memory_int[v_idx_1373]) && (((((#memory_int[v_idx_1379] <= #memory_int[v_idx_1377] && 2 * #memory_int[v_idx_1379] <= 0) && #memory_int[v_idx_1379] <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4)) || (((p4 + 1 <= v_idx_1379 || ((#memory_int[v_idx_1379] <= #memory_int[v_idx_1377] && 2 * #memory_int[v_idx_1379] <= 0) && #memory_int[v_idx_1379] <= 0)) || v_idx_1379 < p4) && p1 + 1 <= v_idx_1373)) || (((p4 + 1 <= v_idx_1379 || ((#memory_int[v_idx_1379] <= #memory_int[v_idx_1377] && 2 * #memory_int[v_idx_1379] <= 0) && #memory_int[v_idx_1379] <= 0)) || v_idx_1379 < p4) && v_idx_1373 < p1)))))) || (p2 + 1 <= v_idx_1375 && (((((((((p4 + 1 <= v_idx_1379 || ((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1379] <= 0)) || v_idx_1379 < p4) && 0 <= 2 * #memory_int[v_idx_1373]) && 0 <= #memory_int[v_idx_1373]) || ((((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4) && v_idx_1373 < p1)) || ((((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4) && p1 + 1 <= v_idx_1373)) && v_idx_1377 < p3) || (((((((p4 + 1 <= v_idx_1379 || ((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1379] <= 0)) || v_idx_1379 < p4) && 0 <= 2 * #memory_int[v_idx_1373]) && 0 <= #memory_int[v_idx_1373]) || ((((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4) && v_idx_1373 < p1)) || ((((2 * #memory_int[v_idx_1379] <= 0 && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4) && p1 + 1 <= v_idx_1373)) && p3 + 1 <= v_idx_1377)) || ((0 <= #memory_int[v_idx_1377] && 0 <= 2 * #memory_int[v_idx_1377]) && (((((0 <= 2 * #memory_int[v_idx_1373] && 0 <= #memory_int[v_idx_1373] + #memory_int[v_idx_1377]) && 0 <= #memory_int[v_idx_1373]) && (((((#memory_int[v_idx_1379] <= #memory_int[v_idx_1377] && 2 * #memory_int[v_idx_1379] <= 0) && #memory_int[v_idx_1379] <= #memory_int[v_idx_1373]) && #memory_int[v_idx_1379] <= 0) || p4 + 1 <= v_idx_1379) || v_idx_1379 < p4)) || (((p4 + 1 <= v_idx_1379 || ((#memory_int[v_idx_1379] <= #memory_int[v_idx_1377] && 2 * #memory_int[v_idx_1379] <= 0) && #memory_int[v_idx_1379] <= 0)) || v_idx_1379 < p4) && p1 + 1 <= v_idx_1373)) || (((p4 + 1 <= v_idx_1379 || ((#memory_int[v_idx_1379] <= #memory_int[v_idx_1377] && 2 * #memory_int[v_idx_1379] <= 0) && #memory_int[v_idx_1379] <= 0)) || v_idx_1379 < p4) && v_idx_1373 < p1))))))) && ((p4 + 1 <= v_idx_1367 || v_idx_1367 < p4) || old(malloc_old_#valid)[v_idx_1367] == 0)) && ptr <= p4) && p2 + 1 <= p3) && p2 + 2 <= p4) && p2 + 2 <= ptr) && p3 + 1 <= ptr) && p3 + 1 <= p4) && p1 + 1 <= p2) && p1 + 3 <= ptr) && p4 <= ptr) && p1 + 3 <= p4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 458.7s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 162.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 92 SDtfs, 39 SDslu, 1 SDs, 0 SdLazy, 91 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 22 SemanticMatches, 33 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 267.6s AbstIntTime, 15 AbstIntIterations, 15 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 16 NumberOfFragments, 1237 HoareAnnotationTreeSize, 1 FomulaSimplifications, 60257 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 2155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...