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/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 14:14:25,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 14:14:25,680 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 14:14:25,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 14:14:25,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 14:14:25,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 14:14:25,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 14:14:25,700 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 14:14:25,701 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 14:14:25,702 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 14:14:25,703 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 14:14:25,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 14:14:25,704 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 14:14:25,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 14:14:25,707 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 14:14:25,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 14:14:25,709 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 14:14:25,712 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 14:14:25,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 14:14:25,723 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 14:14:25,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 14:14:25,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 14:14:25,733 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 14:14:25,733 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 14:14:25,733 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 14:14:25,734 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 14:14:25,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 14:14:25,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 14:14:25,738 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 14:14:25,739 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 14:14:25,739 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 14:14:25,740 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 14:14:25,741 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 14:14:25,741 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 14:14:25,742 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 14:14:25,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 14:14:25,743 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 [2018-12-24 14:14:25,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 14:14:25,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 14:14:25,761 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 14:14:25,764 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 14:14:25,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 14:14:25,764 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 14:14:25,764 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 14:14:25,764 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 14:14:25,765 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 14:14:25,765 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-24 14:14:25,765 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-24 14:14:25,765 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 14:14:25,765 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 14:14:25,767 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 14:14:25,767 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 14:14:25,767 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 14:14:25,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 14:14:25,768 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 14:14:25,768 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 14:14:25,768 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 14:14:25,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 14:14:25,770 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 14:14:25,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 14:14:25,770 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 14:14:25,770 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 14:14:25,770 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 14:14:25,771 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 14:14:25,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 14:14:25,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 14:14:25,771 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 14:14:25,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:14:25,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 14:14:25,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 14:14:25,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 14:14:25,772 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 14:14:25,772 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 14:14:25,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 14:14:25,773 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 14:14:25,773 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 14:14:25,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 14:14:25,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 14:14:25,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 14:14:25,857 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 14:14:25,860 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 14:14:25,861 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2018-12-24 14:14:25,861 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2018-12-24 14:14:25,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 14:14:25,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 14:14:25,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 14:14:25,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 14:14:25,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 14:14:25,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... [2018-12-24 14:14:25,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... [2018-12-24 14:14:25,965 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-24 14:14:25,965 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-24 14:14:25,965 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-24 14:14:25,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 14:14:25,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 14:14:25,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 14:14:25,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 14:14:25,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... [2018-12-24 14:14:25,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... [2018-12-24 14:14:25,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... [2018-12-24 14:14:25,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... [2018-12-24 14:14:25,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... [2018-12-24 14:14:26,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... [2018-12-24 14:14:26,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... [2018-12-24 14:14:26,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 14:14:26,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 14:14:26,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 14:14:26,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 14:14:26,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:14:26,086 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-24 14:14:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-24 14:14:26,087 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-24 14:14:26,334 INFO L272 CfgBuilder]: Using library mode [2018-12-24 14:14:26,335 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-24 14:14:26,335 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:14:26 BoogieIcfgContainer [2018-12-24 14:14:26,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 14:14:26,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 14:14:26,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 14:14:26,341 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 14:14:26,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:14:25" (1/2) ... [2018-12-24 14:14:26,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbbb50a and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:14:26, skipping insertion in model container [2018-12-24 14:14:26,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:14:26" (2/2) ... [2018-12-24 14:14:26,345 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2018-12-24 14:14:26,358 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 14:14:26,372 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 14:14:26,395 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 14:14:26,447 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 14:14:26,447 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 14:14:26,447 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 14:14:26,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 14:14:26,449 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 14:14:26,449 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 14:14:26,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 14:14:26,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 14:14:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-24 14:14:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 14:14:26,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:26,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 14:14:26,493 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-24 14:14:26,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:26,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:26,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:26,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:14:26,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 14:14:26,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:14:26,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:14:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:14:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:14:26,702 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-24 14:14:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:26,744 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-24 14:14:26,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:14:26,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 14:14:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:26,763 INFO L225 Difference]: With dead ends: 11 [2018-12-24 14:14:26,769 INFO L226 Difference]: Without dead ends: 5 [2018-12-24 14:14:26,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:14:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-24 14:14:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-24 14:14:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-24 14:14:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-24 14:14:26,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-24 14:14:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:26,818 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-24 14:14:26,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:14:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-24 14:14:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:14:26,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:26,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:14:26,819 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:26,819 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-12-24 14:14:26,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:26,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:26,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:26,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:26,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:27,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:27,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:27,132 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 14:14:27,134 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2018-12-24 14:14:27,199 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:14:27,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:14:29,704 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-24 14:14:29,706 INFO L272 AbstractInterpreter]: Visited 4 different actions 15 times. Merged at 2 different actions 7 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 14:14:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:29,713 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-24 14:14:29,908 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 42.22% of their original sizes. [2018-12-24 14:14:29,909 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-24 14:14:31,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_30 Int) (v_idx_29 Int) (v_idx_28 Int)) (exists ((v_b_27_1 Int) (v_v_314_1 Int) (v_v_315_1 Int) (v_b_28_1 Int) (v_v_316_1 Int)) (let ((.cse0 (* 2 v_b_27_1)) (.cse1 (* 2 v_v_315_1)) (.cse2 (+ v_b_27_1 v_v_315_1))) (and (<= 0 .cse0) (<= v_v_315_1 v_b_27_1) (<= .cse0 0) (<= 0 (+ v_b_27_1 c_i)) (<= 0 (* 2 c_i)) (<= .cse1 0) (or (<= v_b_28_1 v_idx_29) (< v_idx_29 v_b_27_1) (= v_v_315_1 (select c_a v_idx_29))) (<= 0 .cse2) (or (<= v_b_27_1 v_idx_28) (= (select c_a v_idx_28) v_v_314_1)) (<= v_b_28_1 c_i) (<= v_b_27_1 c_i) (<= 0 (+ v_v_315_1 v_b_28_1)) (<= v_v_315_1 c_i) (<= 0 .cse1) (<= c_i v_b_28_1) (<= .cse2 0) (or (= v_v_316_1 (select c_a v_idx_30)) (< v_idx_30 v_b_28_1)) (<= v_b_27_1 v_b_28_1) (<= v_b_27_1 v_v_315_1) (<= v_v_315_1 v_b_28_1) (<= 0 (+ v_v_315_1 c_i)) (<= 0 (* 2 v_b_28_1)) (<= 0 (+ v_b_27_1 v_b_28_1)) (<= 0 (+ v_b_28_1 c_i)))))) is different from false [2018-12-24 14:14:34,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_32 Int) (v_idx_33 Int) (v_idx_31 Int)) (exists ((v_b_27_1 Int) (v_v_314_1 Int) (v_v_315_1 Int) (v_b_28_1 Int) (v_v_316_1 Int)) (let ((.cse0 (* 2 v_b_27_1)) (.cse1 (* 2 v_v_315_1)) (.cse2 (+ v_b_27_1 v_v_315_1))) (and (<= 0 .cse0) (<= v_v_315_1 v_b_27_1) (<= .cse0 0) (<= 0 (+ v_b_27_1 c_i)) (<= 0 (* 2 c_i)) (<= .cse1 0) (<= 0 .cse2) (<= v_b_28_1 c_i) (or (= v_v_315_1 (select c_a v_idx_32)) (<= v_b_28_1 v_idx_32) (< v_idx_32 v_b_27_1)) (<= v_b_27_1 c_i) (<= 0 (+ v_v_315_1 v_b_28_1)) (<= v_v_315_1 c_i) (<= 0 .cse1) (or (<= v_b_27_1 v_idx_31) (= v_v_314_1 (select c_a v_idx_31))) (<= c_i v_b_28_1) (<= .cse2 0) (<= v_b_27_1 v_b_28_1) (<= v_b_27_1 v_v_315_1) (<= v_v_315_1 v_b_28_1) (<= 0 (+ v_v_315_1 c_i)) (<= 0 (* 2 v_b_28_1)) (or (= (select c_a v_idx_33) v_v_316_1) (< v_idx_33 v_b_28_1)) (<= 0 (+ v_b_27_1 v_b_28_1)) (<= 0 (+ v_b_28_1 c_i)))))) is different from false [2018-12-24 14:14:36,206 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_36 Int) (v_idx_34 Int) (v_idx_35 Int)) (exists ((v_b_27_1 Int) (v_v_314_1 Int) (v_v_315_1 Int) (v_b_28_1 Int) (v_v_316_1 Int)) (let ((.cse0 (* 2 v_b_27_1)) (.cse1 (* 2 v_v_315_1)) (.cse2 (+ v_b_27_1 v_v_315_1))) (and (<= 0 .cse0) (<= v_v_315_1 v_b_27_1) (<= .cse0 0) (or (= v_v_316_1 (select c_a v_idx_36)) (< v_idx_36 v_b_28_1)) (<= 0 (+ v_b_27_1 c_r)) (<= .cse1 0) (<= 0 (+ v_v_315_1 c_r)) (<= 0 .cse2) (<= v_b_27_1 c_r) (<= (+ v_v_315_1 1) v_b_28_1) (<= (+ c_r 1) v_b_28_1) (<= 0 .cse1) (or (= (select c_a v_idx_34) v_v_314_1) (<= v_b_27_1 v_idx_34)) (or (< v_idx_35 v_b_27_1) (= v_v_315_1 (select c_a v_idx_35)) (<= v_b_28_1 v_idx_35)) (<= .cse2 0) (<= 0 (* 2 c_r)) (<= (+ v_b_27_1 1) v_b_28_1) (<= v_b_27_1 v_v_315_1) (<= 1 (+ v_b_28_1 c_r)) (<= 2 (* 2 v_b_28_1)) (<= 1 (+ v_b_27_1 v_b_28_1)) (<= v_v_315_1 c_r) (<= 1 (+ v_v_315_1 v_b_28_1)))))) is different from false [2018-12-24 14:14:36,223 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2018-12-24 14:14:36,224 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-24 14:14:36,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-24 14:14:36,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2018-12-24 14:14:36,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:14:36,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 14:14:36,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 14:14:36,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2018-12-24 14:14:36,228 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-24 14:14:38,288 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_30 Int) (v_idx_29 Int) (v_idx_28 Int)) (exists ((v_b_27_1 Int) (v_v_314_1 Int) (v_v_315_1 Int) (v_b_28_1 Int) (v_v_316_1 Int)) (let ((.cse0 (* 2 v_b_27_1)) (.cse1 (* 2 v_v_315_1)) (.cse2 (+ v_b_27_1 v_v_315_1))) (and (<= 0 .cse0) (<= v_v_315_1 v_b_27_1) (<= .cse0 0) (<= 0 (+ v_b_27_1 c_i)) (<= 0 (* 2 c_i)) (<= .cse1 0) (or (<= v_b_28_1 v_idx_29) (< v_idx_29 v_b_27_1) (= v_v_315_1 (select c_a v_idx_29))) (<= 0 .cse2) (or (<= v_b_27_1 v_idx_28) (= (select c_a v_idx_28) v_v_314_1)) (<= v_b_28_1 c_i) (<= v_b_27_1 c_i) (<= 0 (+ v_v_315_1 v_b_28_1)) (<= v_v_315_1 c_i) (<= 0 .cse1) (<= c_i v_b_28_1) (<= .cse2 0) (or (= v_v_316_1 (select c_a v_idx_30)) (< v_idx_30 v_b_28_1)) (<= v_b_27_1 v_b_28_1) (<= v_b_27_1 v_v_315_1) (<= v_v_315_1 v_b_28_1) (<= 0 (+ v_v_315_1 c_i)) (<= 0 (* 2 v_b_28_1)) (<= 0 (+ v_b_27_1 v_b_28_1)) (<= 0 (+ v_b_28_1 c_i)))))) (forall ((v_idx_32 Int) (v_idx_33 Int) (v_idx_31 Int)) (exists ((v_b_27_1 Int) (v_v_314_1 Int) (v_v_315_1 Int) (v_b_28_1 Int) (v_v_316_1 Int)) (let ((.cse3 (* 2 v_b_27_1)) (.cse4 (* 2 v_v_315_1)) (.cse5 (+ v_b_27_1 v_v_315_1))) (and (<= 0 .cse3) (<= v_v_315_1 v_b_27_1) (<= .cse3 0) (<= 0 (+ v_b_27_1 c_i)) (<= 0 (* 2 c_i)) (<= .cse4 0) (<= 0 .cse5) (<= v_b_28_1 c_i) (or (= v_v_315_1 (select c_a v_idx_32)) (<= v_b_28_1 v_idx_32) (< v_idx_32 v_b_27_1)) (<= v_b_27_1 c_i) (<= 0 (+ v_v_315_1 v_b_28_1)) (<= v_v_315_1 c_i) (<= 0 .cse4) (or (<= v_b_27_1 v_idx_31) (= v_v_314_1 (select c_a v_idx_31))) (<= c_i v_b_28_1) (<= .cse5 0) (<= v_b_27_1 v_b_28_1) (<= v_b_27_1 v_v_315_1) (<= v_v_315_1 v_b_28_1) (<= 0 (+ v_v_315_1 c_i)) (<= 0 (* 2 v_b_28_1)) (or (= (select c_a v_idx_33) v_v_316_1) (< v_idx_33 v_b_28_1)) (<= 0 (+ v_b_27_1 v_b_28_1)) (<= 0 (+ v_b_28_1 c_i))))))) is different from false [2018-12-24 14:14:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:44,629 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-24 14:14:44,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:14:44,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-24 14:14:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:44,630 INFO L225 Difference]: With dead ends: 8 [2018-12-24 14:14:44,631 INFO L226 Difference]: Without dead ends: 6 [2018-12-24 14:14:44,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=9, Invalid=5, Unknown=4, NotChecked=12, Total=30 [2018-12-24 14:14:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-24 14:14:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-24 14:14:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-24 14:14:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-24 14:14:44,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-24 14:14:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:44,637 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-24 14:14:44,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 14:14:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-24 14:14:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:14:44,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:44,638 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-24 14:14:44,639 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-12-24 14:14:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:44,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:44,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:45,004 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 5 [2018-12-24 14:14:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:45,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:45,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:45,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:45,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:45,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:45,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:45,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:45,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:45,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 14:14:45,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:45,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:45,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:14:45,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:45,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:45,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-24 14:14:45,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-24 14:14:45,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:45,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:45,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-24 14:14:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:45,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:46,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-24 14:14:46,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:46,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:14:46,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-24 14:14:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:14:46,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:46,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-24 14:14:46,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:46,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:14:46,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:14:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:14:46,182 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2018-12-24 14:14:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:46,388 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-24 14:14:46,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:14:46,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 14:14:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:46,390 INFO L225 Difference]: With dead ends: 9 [2018-12-24 14:14:46,390 INFO L226 Difference]: Without dead ends: 7 [2018-12-24 14:14:46,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:14:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-24 14:14:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-24 14:14:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 14:14:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-24 14:14:46,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-24 14:14:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:46,395 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-24 14:14:46,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:14:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-24 14:14:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:14:46,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:46,396 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-24 14:14:46,397 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-12-24 14:14:46,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:46,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:46,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:47,038 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-12-24 14:14:47,356 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 5 [2018-12-24 14:14:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:47,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:47,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:47,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:47,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:47,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:47,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:47,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:47,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:47,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:47,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:47,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:47,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:14:47,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:47,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:47,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-24 14:14:47,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-24 14:14:47,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:47,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:47,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-24 14:14:47,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-24 14:14:47,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:47,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:47,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-24 14:14:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:47,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:47,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-24 14:14:47,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:47,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:14:47,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-24 14:14:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 14:14:47,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:47,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2018-12-24 14:14:47,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:47,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:14:47,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:14:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-24 14:14:47,891 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2018-12-24 14:14:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:48,099 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-24 14:14:48,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:14:48,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 14:14:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:48,103 INFO L225 Difference]: With dead ends: 10 [2018-12-24 14:14:48,104 INFO L226 Difference]: Without dead ends: 8 [2018-12-24 14:14:48,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-24 14:14:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-24 14:14:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-24 14:14:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 14:14:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-24 14:14:48,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-24 14:14:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:48,108 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-24 14:14:48,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:14:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-24 14:14:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 14:14:48,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:48,109 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-24 14:14:48,110 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:48,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:48,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-12-24 14:14:48,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:48,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:48,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:48,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:48,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:48,651 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-12-24 14:14:48,769 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-12-24 14:14:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:48,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:48,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:48,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:48,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:48,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:48,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:48,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:48,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:48,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:14:48,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:48,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:48,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-24 14:14:48,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-24 14:14:48,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:48,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:48,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-24 14:14:48,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-24 14:14:48,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:48,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:48,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-24 14:14:49,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-24 14:14:49,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:49,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:49,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-24 14:14:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:49,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:49,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-24 14:14:49,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:49,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:14:49,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-24 14:14:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-24 14:14:49,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:49,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2018-12-24 14:14:49,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:49,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 14:14:49,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 14:14:49,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-12-24 14:14:49,843 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2018-12-24 14:14:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:50,193 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-24 14:14:50,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:14:50,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-12-24 14:14:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:50,195 INFO L225 Difference]: With dead ends: 11 [2018-12-24 14:14:50,195 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 14:14:50,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:14:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 14:14:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-24 14:14:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 14:14:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-24 14:14:50,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-24 14:14:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:50,201 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-24 14:14:50,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 14:14:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-24 14:14:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:14:50,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:50,202 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-24 14:14:50,203 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-12-24 14:14:50,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:50,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:50,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:50,765 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-12-24 14:14:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:50,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:50,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:50,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:50,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:50,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:50,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:50,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:50,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:50,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 14:14:50,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:50,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:50,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:14:50,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:50,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:50,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-24 14:14:50,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-24 14:14:50,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:50,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:50,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-24 14:14:50,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-24 14:14:50,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:50,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:50,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-24 14:14:51,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-24 14:14:51,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:51,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:51,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-24 14:14:51,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-24 14:14:51,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:51,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:51,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-24 14:14:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:51,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:52,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-24 14:14:52,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:52,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:14:52,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-24 14:14:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-24 14:14:53,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:53,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2018-12-24 14:14:53,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:53,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 14:14:53,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 14:14:53,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:14:53,017 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2018-12-24 14:14:53,665 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-24 14:14:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:53,681 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-24 14:14:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:14:53,682 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-12-24 14:14:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:53,683 INFO L225 Difference]: With dead ends: 12 [2018-12-24 14:14:53,683 INFO L226 Difference]: Without dead ends: 10 [2018-12-24 14:14:53,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-24 14:14:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-24 14:14:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-24 14:14:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 14:14:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-24 14:14:53,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-24 14:14:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:53,689 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-24 14:14:53,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 14:14:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-24 14:14:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 14:14:53,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:53,689 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-24 14:14:53,690 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-12-24 14:14:53,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:53,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:53,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:53,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:53,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:54,235 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2018-12-24 14:14:54,482 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-12-24 14:14:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:54,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:54,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:54,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:54,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:54,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:54,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:54,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:54,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:54,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:54,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:54,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:54,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:14:54,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:54,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:54,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-24 14:14:54,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-24 14:14:54,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:54,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:54,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-24 14:14:54,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-24 14:14:54,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:54,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:54,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-24 14:14:54,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-24 14:14:54,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:54,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:54,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-24 14:14:55,228 INFO L303 Elim1Store]: Index analysis took 123 ms [2018-12-24 14:14:55,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-24 14:14:55,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:55,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:55,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-24 14:14:55,560 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-12-24 14:14:55,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-24 14:14:55,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:14:55,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-24 14:14:55,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-24 14:14:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:14:58,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:08,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-24 14:15:08,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:15:08,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:15:08,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-24 14:15:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-24 14:15:08,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:08,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2018-12-24 14:15:08,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:08,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 14:15:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 14:15:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-12-24 14:15:08,974 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2018-12-24 14:15:09,493 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2018-12-24 14:15:14,100 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-12-24 14:15:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:14,117 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-24 14:15:14,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:15:14,118 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-12-24 14:15:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:14,118 INFO L225 Difference]: With dead ends: 13 [2018-12-24 14:15:14,118 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 14:15:14,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2018-12-24 14:15:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 14:15:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-24 14:15:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 14:15:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-24 14:15:14,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-24 14:15:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:14,124 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-24 14:15:14,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 14:15:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-24 14:15:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:15:14,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:14,125 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-24 14:15:14,126 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-12-24 14:15:14,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:14,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:14,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:14,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:14,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:14,656 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2018-12-24 14:15:14,835 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2018-12-24 14:15:15,142 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-24 14:15:15,475 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2018-12-24 14:15:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:15,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:15,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:15,510 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:15,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:15,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:15,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:15,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:15,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:15:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:15,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:15,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:15:15,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:15:15,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 14:15:15,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-24 14:15:15,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-24 14:15:15,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:15:15,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 14:15:15,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-24 14:15:15,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-24 14:15:15,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:15:15,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-24 14:15:15,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-24 14:15:15,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-24 14:15:15,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:15:15,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-24 14:15:15,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-24 14:15:15,960 INFO L303 Elim1Store]: Index analysis took 132 ms [2018-12-24 14:15:15,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-24 14:15:15,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:15:15,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-24 14:15:15,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-24 14:15:16,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-24 14:15:16,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:15:16,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-24 14:15:16,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-24 14:15:18,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-24 14:15:18,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:15:18,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-24 14:15:18,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-12-24 14:15:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:15:32,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:44,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-24 14:15:44,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:15:44,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:15:44,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-24 14:15:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-24 14:15:44,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:44,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2018-12-24 14:15:44,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:44,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 14:15:44,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 14:15:44,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=308, Unknown=4, NotChecked=0, Total=420 [2018-12-24 14:15:44,918 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2018-12-24 14:16:01,298 WARN L181 SmtUtils]: Spent 9.16 s on a formula simplification. DAG size of input: 119 DAG size of output: 48 [2018-12-24 14:16:15,634 WARN L181 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-12-24 14:16:28,365 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-24 14:16:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:16:28,366 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2018-12-24 14:16:28,371 INFO L168 Benchmark]: Toolchain (without parser) took 122457.38 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 974.1 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -829.9 MB). Peak memory consumption was 144.2 MB. Max. memory is 7.1 GB. [2018-12-24 14:16:28,372 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:16:28,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:16:28,373 INFO L168 Benchmark]: Boogie Preprocessor took 34.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:16:28,374 INFO L168 Benchmark]: RCFGBuilder took 331.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 14:16:28,374 INFO L168 Benchmark]: TraceAbstraction took 122033.72 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 974.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -851.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2018-12-24 14:16:28,378 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 331.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 122033.72 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 974.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -851.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...