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_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 09:57:32,865 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 09:57:32,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 09:57:32,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 09:57:32,884 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 09:57:32,885 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 09:57:32,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 09:57:32,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 09:57:32,889 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 09:57:32,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 09:57:32,891 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 09:57:32,891 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 09:57:32,892 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 09:57:32,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 09:57:32,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 09:57:32,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 09:57:32,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 09:57:32,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 09:57:32,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 09:57:32,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 09:57:32,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 09:57:32,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 09:57:32,918 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 09:57:32,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 09:57:32,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 09:57:32,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 09:57:32,924 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 09:57:32,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 09:57:32,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 09:57:32,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 09:57:32,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 09:57:32,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 09:57:32,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 09:57:32,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 09:57:32,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 09:57:32,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 09:57:32,933 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 09:57:32,953 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 09:57:32,954 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 09:57:32,955 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 09:57:32,955 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 09:57:32,955 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 09:57:32,956 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 09:57:32,956 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 09:57:32,956 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 09:57:32,957 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 09:57:32,957 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 09:57:32,957 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 09:57:32,957 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 09:57:32,957 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 09:57:32,957 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 09:57:32,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 09:57:32,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 09:57:32,958 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 09:57:32,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 09:57:32,959 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 09:57:32,959 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 09:57:32,959 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 09:57:32,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 09:57:32,961 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 09:57:32,961 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 09:57:32,961 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 09:57:32,962 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 09:57:32,962 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 09:57:32,962 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 09:57:32,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 09:57:32,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 09:57:32,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 09:57:32,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:32,963 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 09:57:32,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 09:57:32,963 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 09:57:32,963 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 09:57:32,964 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 09:57:32,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 09:57:32,964 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 09:57:32,964 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 09:57:33,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 09:57:33,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 09:57:33,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 09:57:33,035 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 09:57:33,036 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 09:57:33,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-01-20 09:57:33,037 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-01-20 09:57:33,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 09:57:33,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 09:57:33,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:33,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 09:57:33,071 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 09:57:33,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,102 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-20 09:57:33,102 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-20 09:57:33,103 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-20 09:57:33,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:33,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 09:57:33,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 09:57:33,106 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 09:57:33,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 09:57:33,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 09:57:33,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 09:57:33,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 09:57:33,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:33,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-20 09:57:33,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-20 09:57:33,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-20 09:57:33,433 INFO L278 CfgBuilder]: Using library mode [2019-01-20 09:57:33,434 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-20 09:57:33,435 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:33 BoogieIcfgContainer [2019-01-20 09:57:33,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 09:57:33,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 09:57:33,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 09:57:33,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 09:57:33,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/2) ... [2019-01-20 09:57:33,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecc271b and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:57:33, skipping insertion in model container [2019-01-20 09:57:33,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:33" (2/2) ... [2019-01-20 09:57:33,444 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-01-20 09:57:33,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 09:57:33,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 09:57:33,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 09:57:33,515 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 09:57:33,515 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 09:57:33,515 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 09:57:33,515 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 09:57:33,516 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 09:57:33,516 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 09:57:33,516 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 09:57:33,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 09:57:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-20 09:57:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 09:57:33,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:33,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 09:57:33,537 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-20 09:57:33,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:33,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:33,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:33,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 09:57:33,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:33,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 09:57:33,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 09:57:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:33,692 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-20 09:57:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:33,745 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-20 09:57:33,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 09:57:33,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 09:57:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:33,759 INFO L225 Difference]: With dead ends: 11 [2019-01-20 09:57:33,759 INFO L226 Difference]: Without dead ends: 5 [2019-01-20 09:57:33,763 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 [2019-01-20 09:57:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-20 09:57:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-20 09:57:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-20 09:57:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-20 09:57:33,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-20 09:57:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:33,798 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-20 09:57:33,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 09:57:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-20 09:57:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 09:57:33,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:33,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 09:57:33,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-20 09:57:33,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:34,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:34,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:34,095 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 09:57:34,098 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-20 09:57:34,135 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 09:57:34,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 09:57:34,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 09:57:34,255 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 09:57:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:34,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 09:57:34,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:34,262 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 [2019-01-20 09:57:34,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:34,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:34,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:34,371 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 [2019-01-20 09:57:34,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:34,390 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. [2019-01-20 09:57:34,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:34,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:34,837 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-20 09:57:34,854 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 [2019-01-20 09:57:34,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:34,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:34,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-20 09:57:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:35,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:35,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-20 09:57:35,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:35,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 09:57:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 09:57:35,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-20 09:57:35,018 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-01-20 09:57:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:35,148 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-20 09:57:35,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 09:57:35,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-20 09:57:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:35,149 INFO L225 Difference]: With dead ends: 8 [2019-01-20 09:57:35,150 INFO L226 Difference]: Without dead ends: 6 [2019-01-20 09:57:35,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-20 09:57:35,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-20 09:57:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-20 09:57:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-20 09:57:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-20 09:57:35,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-20 09:57:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:35,156 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-20 09:57:35,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 09:57:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-20 09:57:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 09:57:35,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:35,157 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 09:57:35,158 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-01-20 09:57:35,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:35,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:35,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:35,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:35,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:35,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:35,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:35,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,372 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 [2019-01-20 09:57:35,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:35,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:35,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 09:57:35,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:35,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:35,475 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 [2019-01-20 09:57:35,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:35,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. [2019-01-20 09:57:35,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:35,510 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 [2019-01-20 09:57:35,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:35,551 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. [2019-01-20 09:57:35,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-20 09:57:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:35,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:35,842 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 [2019-01-20 09:57:35,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:35,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:35,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-20 09:57:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 09:57:36,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:36,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-20 09:57:36,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:36,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 09:57:36,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 09:57:36,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-20 09:57:36,123 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-01-20 09:57:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:36,301 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-20 09:57:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 09:57:36,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 09:57:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:36,302 INFO L225 Difference]: With dead ends: 9 [2019-01-20 09:57:36,302 INFO L226 Difference]: Without dead ends: 7 [2019-01-20 09:57:36,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-20 09:57:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-20 09:57:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-20 09:57:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-20 09:57:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-20 09:57:36,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-20 09:57:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:36,308 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-20 09:57:36,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 09:57:36,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-20 09:57:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 09:57:36,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:36,308 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-20 09:57:36,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:36,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-01-20 09:57:36,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:36,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:36,567 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-01-20 09:57:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:36,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:36,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:36,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,592 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 [2019-01-20 09:57:36,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:36,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:36,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:36,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:36,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:36,625 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 [2019-01-20 09:57:36,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:36,638 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. [2019-01-20 09:57:36,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:36,667 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 [2019-01-20 09:57:36,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:36,678 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. [2019-01-20 09:57:36,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-20 09:57:36,722 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 [2019-01-20 09:57:36,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:36,740 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. [2019-01-20 09:57:36,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-20 09:57:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:37,002 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 [2019-01-20 09:57:37,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:37,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:37,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-20 09:57:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 09:57:37,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:37,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-01-20 09:57:37,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:37,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 09:57:37,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 09:57:37,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-20 09:57:37,066 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-01-20 09:57:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:37,244 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-20 09:57:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 09:57:37,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 09:57:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:37,245 INFO L225 Difference]: With dead ends: 10 [2019-01-20 09:57:37,246 INFO L226 Difference]: Without dead ends: 8 [2019-01-20 09:57:37,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-20 09:57:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-20 09:57:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-20 09:57:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 09:57:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-20 09:57:37,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-20 09:57:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:37,251 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-20 09:57:37,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 09:57:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-20 09:57:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 09:57:37,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:37,252 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-20 09:57:37,252 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:37,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-01-20 09:57:37,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:37,575 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-01-20 09:57:37,705 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-01-20 09:57:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:37,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:37,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:37,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:37,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:37,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:37,775 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 [2019-01-20 09:57:37,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:37,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:37,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:37,828 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 [2019-01-20 09:57:37,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:37,839 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. [2019-01-20 09:57:37,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:37,884 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 [2019-01-20 09:57:37,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:37,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. [2019-01-20 09:57:37,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-20 09:57:37,932 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 [2019-01-20 09:57:37,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:37,946 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. [2019-01-20 09:57:37,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-20 09:57:37,987 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 [2019-01-20 09:57:37,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:38,028 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. [2019-01-20 09:57:38,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-20 09:57:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:38,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:38,395 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 [2019-01-20 09:57:38,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:38,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:38,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-20 09:57:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-20 09:57:38,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:38,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-01-20 09:57:38,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:38,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 09:57:38,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 09:57:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-01-20 09:57:38,434 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-01-20 09:57:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,692 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-20 09:57:38,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 09:57:38,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-20 09:57:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,693 INFO L225 Difference]: With dead ends: 11 [2019-01-20 09:57:38,693 INFO L226 Difference]: Without dead ends: 9 [2019-01-20 09:57:38,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-20 09:57:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-20 09:57:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-20 09:57:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 09:57:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-20 09:57:38,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-20 09:57:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,697 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-20 09:57:38,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 09:57:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-20 09:57:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 09:57:38,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,698 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-20 09:57:38,698 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:38,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-01-20 09:57:38,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,127 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-01-20 09:57:39,318 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-01-20 09:57:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:39,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:39,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:39,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,363 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 [2019-01-20 09:57:39,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:39,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:39,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 09:57:39,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:39,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:39,396 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 [2019-01-20 09:57:39,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,409 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. [2019-01-20 09:57:39,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:39,432 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 [2019-01-20 09:57:39,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,444 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. [2019-01-20 09:57:39,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-20 09:57:39,553 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 [2019-01-20 09:57:39,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,571 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. [2019-01-20 09:57:39,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-20 09:57:39,685 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 [2019-01-20 09:57:39,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,704 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. [2019-01-20 09:57:39,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-20 09:57:39,790 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 [2019-01-20 09:57:39,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,851 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. [2019-01-20 09:57:39,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-20 09:57:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:46,305 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 [2019-01-20 09:57:46,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:46,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:46,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-20 09:57:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 09:57:46,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:46,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-01-20 09:57:46,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:46,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 09:57:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 09:57:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-01-20 09:57:46,339 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-01-20 09:57:47,022 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-20 09:57:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:47,035 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-20 09:57:47,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 09:57:47,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-01-20 09:57:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:47,037 INFO L225 Difference]: With dead ends: 12 [2019-01-20 09:57:47,037 INFO L226 Difference]: Without dead ends: 10 [2019-01-20 09:57:47,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-01-20 09:57:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-20 09:57:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-20 09:57:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-20 09:57:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-20 09:57:47,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-20 09:57:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:47,042 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-20 09:57:47,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 09:57:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-20 09:57:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 09:57:47,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:47,043 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-20 09:57:47,044 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-01-20 09:57:47,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:47,532 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-01-20 09:57:47,728 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2019-01-20 09:57:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:47,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:47,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:47,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:47,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,754 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 [2019-01-20 09:57:47,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:47,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:47,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:47,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:47,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:47,788 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 [2019-01-20 09:57:47,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:47,799 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. [2019-01-20 09:57:47,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:47,826 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 [2019-01-20 09:57:47,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:47,834 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. [2019-01-20 09:57:47,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-20 09:57:47,861 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 [2019-01-20 09:57:47,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:47,875 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. [2019-01-20 09:57:47,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-20 09:57:47,935 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 [2019-01-20 09:57:47,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:47,956 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. [2019-01-20 09:57:47,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-20 09:57:48,029 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 [2019-01-20 09:57:48,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:48,052 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. [2019-01-20 09:57:48,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-20 09:57:48,250 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 [2019-01-20 09:57:48,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:48,283 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. [2019-01-20 09:57:48,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-20 09:57:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:50,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:52,053 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 [2019-01-20 09:57:52,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:52,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:57:52,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-20 09:57:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-20 09:57:52,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:52,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-01-20 09:57:52,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:52,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-20 09:57:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-20 09:57:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-01-20 09:57:52,108 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-01-20 09:57:52,609 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2019-01-20 09:57:57,126 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-20 09:57:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:57,141 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-20 09:57:57,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 09:57:57,142 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-01-20 09:57:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:57,142 INFO L225 Difference]: With dead ends: 13 [2019-01-20 09:57:57,143 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 09:57:57,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2019-01-20 09:57:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 09:57:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 09:57:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 09:57:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-20 09:57:57,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-20 09:57:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:57,149 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-20 09:57:57,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-20 09:57:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-20 09:57:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 09:57:57,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:57,149 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-20 09:57:57,149 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:57,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-01-20 09:57:57,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:57,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:57,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:57,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:57,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:57,601 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2019-01-20 09:57:57,766 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-01-20 09:57:58,036 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-01-20 09:57:58,313 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-01-20 09:57:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:58,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:58,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:58,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:58,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,339 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:58,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:58,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:58,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:58,387 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 [2019-01-20 09:57:58,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,395 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. [2019-01-20 09:57:58,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-20 09:57:58,416 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 [2019-01-20 09:57:58,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,429 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. [2019-01-20 09:57:58,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-20 09:57:58,458 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 [2019-01-20 09:57:58,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,479 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. [2019-01-20 09:57:58,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-20 09:57:58,646 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-20 09:57:58,647 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 [2019-01-20 09:57:58,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,698 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. [2019-01-20 09:57:58,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-20 09:57:58,778 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 [2019-01-20 09:57:58,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,804 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. [2019-01-20 09:57:58,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-20 09:57:59,156 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 [2019-01-20 09:57:59,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:59,187 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. [2019-01-20 09:57:59,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-20 09:58:01,267 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 [2019-01-20 09:58:01,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:01,305 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. [2019-01-20 09:58:01,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-01-20 09:58:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:14,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:24,093 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 [2019-01-20 09:58:24,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:24,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 09:58:24,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-20 09:58:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 09:58:24,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:24,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2019-01-20 09:58:24,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:24,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-20 09:58:24,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-20 09:58:24,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=308, Unknown=4, NotChecked=0, Total=420 [2019-01-20 09:58:24,130 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2019-01-20 09:58:39,777 WARN L181 SmtUtils]: Spent 8.71 s on a formula simplification. DAG size of input: 119 DAG size of output: 48 [2019-01-20 09:58:53,257 WARN L181 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2019-01-20 09:59:17,588 WARN L181 SmtUtils]: Spent 9.86 s on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2019-01-20 09:59:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:17,613 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-20 09:59:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 09:59:17,613 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2019-01-20 09:59:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:17,614 INFO L225 Difference]: With dead ends: 14 [2019-01-20 09:59:17,614 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 09:59:17,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 68.6s TimeCoverageRelationStatistics Valid=181, Invalid=510, Unknown=11, NotChecked=0, Total=702 [2019-01-20 09:59:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 09:59:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-20 09:59:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 09:59:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-20 09:59:17,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-20 09:59:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:17,621 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-20 09:59:17,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-20 09:59:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-20 09:59:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-20 09:59:17,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:17,622 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-20 09:59:17,622 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:17,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-01-20 09:59:17,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:17,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:17,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:17,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:17,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:18,269 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 30 [2019-01-20 09:59:18,742 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 38 [2019-01-20 09:59:19,370 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2019-01-20 09:59:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:19,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:19,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:19,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:19,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:19,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:19,397 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:19,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:19,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:19,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-20 09:59:19,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:19,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:19,453 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 [2019-01-20 09:59:19,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:19,458 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. [2019-01-20 09:59:19,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-20 09:59:19,545 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 [2019-01-20 09:59:19,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:19,556 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. [2019-01-20 09:59:19,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-20 09:59:19,600 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 [2019-01-20 09:59:19,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:19,614 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. [2019-01-20 09:59:19,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-20 09:59:19,668 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 [2019-01-20 09:59:19,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:19,687 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. [2019-01-20 09:59:19,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-20 09:59:19,764 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 [2019-01-20 09:59:19,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:19,789 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. [2019-01-20 09:59:19,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-20 09:59:20,014 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 [2019-01-20 09:59:20,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:20,046 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. [2019-01-20 09:59:20,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-20 09:59:20,979 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-20 09:59:21,180 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:21,182 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:934) 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.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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) ... 39 more [2019-01-20 09:59:21,188 INFO L168 Benchmark]: Toolchain (without parser) took 108118.78 ms. Allocated memory was 133.7 MB in the beginning and 348.1 MB in the end (delta: 214.4 MB). Free memory was 107.9 MB in the beginning and 277.5 MB in the end (delta: -169.6 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-01-20 09:59:21,189 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 133.7 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 09:59:21,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.65 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 105.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-20 09:59:21,189 INFO L168 Benchmark]: Boogie Preprocessor took 25.69 ms. Allocated memory is still 133.7 MB. Free memory was 105.9 MB in the beginning and 104.9 MB in the end (delta: 969.8 kB). Peak memory consumption was 969.8 kB. Max. memory is 7.1 GB. [2019-01-20 09:59:21,190 INFO L168 Benchmark]: RCFGBuilder took 304.12 ms. Allocated memory is still 133.7 MB. Free memory was 104.7 MB in the beginning and 96.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-01-20 09:59:21,190 INFO L168 Benchmark]: TraceAbstraction took 107750.50 ms. Allocated memory was 133.7 MB in the beginning and 348.1 MB in the end (delta: 214.4 MB). Free memory was 96.2 MB in the beginning and 277.5 MB in the end (delta: -181.3 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2019-01-20 09:59:21,193 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.18 ms. Allocated memory is still 133.7 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.65 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 105.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.69 ms. Allocated memory is still 133.7 MB. Free memory was 105.9 MB in the beginning and 104.9 MB in the end (delta: 969.8 kB). Peak memory consumption was 969.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 304.12 ms. Allocated memory is still 133.7 MB. Free memory was 104.7 MB in the beginning and 96.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107750.50 ms. Allocated memory was 133.7 MB in the beginning and 348.1 MB in the end (delta: 214.4 MB). Free memory was 96.2 MB in the beginning and 277.5 MB in the end (delta: -181.3 MB). Peak memory consumption was 33.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...