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-1de736e-m [2019-02-15 10:44:58,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:44:58,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:44:58,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:44:58,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:44:58,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:44:58,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:44:58,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:44:58,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:44:58,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:44:58,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:44:58,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:44:58,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:44:58,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:44:58,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:44:58,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:44:58,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:44:58,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:44:58,721 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:44:58,723 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:44:58,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:44:58,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:44:58,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:44:58,728 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:44:58,728 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:44:58,729 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:44:58,731 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:44:58,732 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:44:58,732 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:44:58,734 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:44:58,734 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:44:58,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:44:58,735 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:44:58,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:44:58,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:44:58,737 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:44:58,738 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-02-15 10:44:58,750 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:44:58,751 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:44:58,752 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:44:58,752 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:44:58,752 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:44:58,752 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:44:58,753 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:44:58,753 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:44:58,753 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:44:58,753 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:44:58,754 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:44:58,754 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:44:58,754 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:44:58,754 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:44:58,755 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:44:58,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:44:58,756 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:44:58,756 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:44:58,756 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:44:58,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:44:58,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:44:58,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:44:58,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:44:58,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:44:58,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:44:58,758 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:44:58,758 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:44:58,758 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:44:58,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:44:58,759 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:44:58,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:44:58,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:58,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:44:58,760 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:44:58,760 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:44:58,760 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:44:58,760 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:44:58,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:44:58,761 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:44:58,761 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:44:58,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:44:58,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:44:58,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:44:58,817 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:44:58,819 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:44:58,820 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-02-15 10:44:58,820 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-02-15 10:44:58,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:44:58,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:44:58,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:58,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:44:58,866 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:44:58,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... [2019-02-15 10:44:58,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... [2019-02-15 10:44:58,901 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-15 10:44:58,902 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-15 10:44:58,902 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-15 10:44:58,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:58,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:44:58,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:44:58,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:44:58,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... [2019-02-15 10:44:58,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... [2019-02-15 10:44:58,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... [2019-02-15 10:44:58,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... [2019-02-15 10:44:58,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... [2019-02-15 10:44:58,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... [2019-02-15 10:44:58,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... [2019-02-15 10:44:58,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:44:58,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:44:58,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:44:58,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:44:58,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:59,016 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-15 10:44:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-15 10:44:59,017 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-15 10:44:59,240 INFO L278 CfgBuilder]: Using library mode [2019-02-15 10:44:59,241 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-15 10:44:59,242 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:59 BoogieIcfgContainer [2019-02-15 10:44:59,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:44:59,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:44:59,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:44:59,248 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:44:59,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:58" (1/2) ... [2019-02-15 10:44:59,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58be34a9 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:44:59, skipping insertion in model container [2019-02-15 10:44:59,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:59" (2/2) ... [2019-02-15 10:44:59,252 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-02-15 10:44:59,262 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:44:59,271 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 10:44:59,290 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 10:44:59,324 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:44:59,324 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:44:59,324 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:44:59,324 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:44:59,325 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:44:59,325 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:44:59,325 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:44:59,325 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:44:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-15 10:44:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:44:59,348 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:59,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:44:59,351 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:59,358 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-02-15 10:44:59,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:59,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:59,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:44:59,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:44:59,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:44:59,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:44:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:44:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:44:59,533 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-15 10:44:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:59,587 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-15 10:44:59,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:44:59,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:44:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:59,601 INFO L225 Difference]: With dead ends: 11 [2019-02-15 10:44:59,601 INFO L226 Difference]: Without dead ends: 5 [2019-02-15 10:44:59,605 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-02-15 10:44:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-15 10:44:59,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-15 10:44:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-15 10:44:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-15 10:44:59,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-15 10:44:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:59,646 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-15 10:44:59,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:44:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-15 10:44:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:44:59,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:59,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:44:59,647 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-02-15 10:44:59,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:59,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:59,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:59,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:59,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:59,944 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:44:59,946 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-02-15 10:44:59,986 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:44:59,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:45:00,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:45:00,130 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-02-15 10:45:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:00,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:45:00,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:00,139 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-02-15 10:45:00,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:00,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:00,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:00,277 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-02-15 10:45:00,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:00,381 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-02-15 10:45:00,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-15 10:45:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:00,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:00,941 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-02-15 10:45:00,959 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-02-15 10:45:00,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:01,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-02-15 10:45:01,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-15 10:45:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:01,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:01,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-15 10:45:01,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:01,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:45:01,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:45:01,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:45:01,154 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-02-15 10:45:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:01,248 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-15 10:45:01,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:45:01,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-02-15 10:45:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:01,250 INFO L225 Difference]: With dead ends: 8 [2019-02-15 10:45:01,250 INFO L226 Difference]: Without dead ends: 6 [2019-02-15 10:45:01,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:45:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-15 10:45:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-15 10:45:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-15 10:45:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-15 10:45:01,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-15 10:45:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:01,254 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-15 10:45:01,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:45:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-15 10:45:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:45:01,254 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:01,255 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 10:45:01,255 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-02-15 10:45:01,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:01,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:01,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:01,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:01,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:01,493 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:01,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:01,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,495 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-02-15 10:45:01,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:01,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:01,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:45:01,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:01,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:01,581 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-02-15 10:45:01,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:01,591 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-02-15 10:45:01,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-15 10:45:01,657 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-02-15 10:45:01,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:01,742 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-02-15 10:45:01,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-15 10:45:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:01,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:02,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-02-15 10:45:02,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:02,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:02,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-15 10:45:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:45:02,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:02,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-02-15 10:45:02,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:02,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:45:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:45:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:45:02,281 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-02-15 10:45:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:02,540 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-15 10:45:02,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:45:02,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:45:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:02,542 INFO L225 Difference]: With dead ends: 9 [2019-02-15 10:45:02,542 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 10:45:02,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:45:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 10:45:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-15 10:45:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 10:45:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-15 10:45:02,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-15 10:45:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:02,546 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-15 10:45:02,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:45:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-15 10:45:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:45:02,547 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:02,547 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-15 10:45:02,547 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-02-15 10:45:02,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:02,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:02,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:02,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:02,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:02,846 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-02-15 10:45:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:02,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:02,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:02,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:02,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:02,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:02,875 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-02-15 10:45:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:02,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:02,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:02,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:02,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:02,924 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-02-15 10:45:02,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:02,933 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-02-15 10:45:02,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-15 10:45:02,974 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-02-15 10:45:02,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:02,988 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-02-15 10:45:02,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-15 10:45:03,023 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-02-15 10:45:03,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:03,045 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-02-15 10:45:03,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-15 10:45:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:03,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:03,300 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-02-15 10:45:03,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:03,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:03,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-15 10:45:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:45:03,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:03,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-02-15 10:45:03,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:03,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:45:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:45:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:45:03,340 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-02-15 10:45:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:03,544 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-15 10:45:03,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:45:03,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:45:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:03,546 INFO L225 Difference]: With dead ends: 10 [2019-02-15 10:45:03,546 INFO L226 Difference]: Without dead ends: 8 [2019-02-15 10:45:03,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:45:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-15 10:45:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-15 10:45:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-15 10:45:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-15 10:45:03,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-15 10:45:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:03,550 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-15 10:45:03,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:45:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-15 10:45:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:45:03,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:03,551 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-15 10:45:03,551 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:03,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-02-15 10:45:03,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:03,870 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-02-15 10:45:04,011 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-02-15 10:45:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:04,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:04,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:04,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:04,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:04,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:04,036 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-02-15 10:45:04,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:04,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:04,116 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-02-15 10:45:04,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:04,122 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-02-15 10:45:04,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-15 10:45:04,162 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-02-15 10:45:04,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:04,173 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-02-15 10:45:04,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-15 10:45:04,209 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-02-15 10:45:04,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:04,231 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-02-15 10:45:04,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-15 10:45:04,282 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-02-15 10:45:04,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:04,322 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-02-15 10:45:04,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-15 10:45:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:04,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:04,649 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-02-15 10:45:04,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:04,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:04,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-15 10:45:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 10:45:04,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:04,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-02-15 10:45:04,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:04,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:45:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:45:04,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:45:04,686 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-02-15 10:45:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:04,953 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-15 10:45:04,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:45:04,954 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-15 10:45:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:04,954 INFO L225 Difference]: With dead ends: 11 [2019-02-15 10:45:04,954 INFO L226 Difference]: Without dead ends: 9 [2019-02-15 10:45:04,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:45:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-15 10:45:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-15 10:45:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-15 10:45:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-15 10:45:04,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-15 10:45:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:04,959 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-15 10:45:04,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:45:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-15 10:45:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:45:04,960 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:04,960 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-15 10:45:04,960 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-02-15 10:45:04,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,345 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-02-15 10:45:05,495 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-02-15 10:45:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:05,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:05,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:05,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:05,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,542 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-02-15 10:45:05,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:05,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:05,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 10:45:05,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:05,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:05,608 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-02-15 10:45:05,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,613 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-02-15 10:45:05,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-15 10:45:05,656 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-02-15 10:45:05,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,665 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-02-15 10:45:05,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-15 10:45:05,839 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-02-15 10:45:05,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,856 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-02-15 10:45:05,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-15 10:45:05,918 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-02-15 10:45:05,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,939 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-02-15 10:45:05,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-15 10:45:06,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-02-15 10:45:06,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:06,092 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-02-15 10:45:06,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-15 10:45:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:12,689 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-02-15 10:45:12,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:12,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:12,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-15 10:45:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 10:45:12,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:12,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-02-15 10:45:12,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:12,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-15 10:45:12,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-15 10:45:12,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:45:12,727 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-02-15 10:45:13,400 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-02-15 10:45:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:13,416 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-15 10:45:13,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:45:13,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-02-15 10:45:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:13,417 INFO L225 Difference]: With dead ends: 12 [2019-02-15 10:45:13,417 INFO L226 Difference]: Without dead ends: 10 [2019-02-15 10:45:13,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:45:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-15 10:45:13,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-15 10:45:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 10:45:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-15 10:45:13,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-15 10:45:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:13,424 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-15 10:45:13,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-15 10:45:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-15 10:45:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:45:13,425 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:13,425 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-15 10:45:13,425 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:13,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-02-15 10:45:13,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:13,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:13,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:13,909 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-02-15 10:45:14,108 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2019-02-15 10:45:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:14,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:14,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:14,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:14,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,130 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-02-15 10:45:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:14,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:14,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:14,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:14,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:14,171 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-02-15 10:45:14,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,176 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-02-15 10:45:14,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-15 10:45:14,206 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-02-15 10:45:14,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,215 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-02-15 10:45:14,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-15 10:45:14,244 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-02-15 10:45:14,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,259 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-02-15 10:45:14,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-15 10:45:14,316 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-02-15 10:45:14,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,335 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-02-15 10:45:14,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-15 10:45:14,408 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-02-15 10:45:14,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,431 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-02-15 10:45:14,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-15 10:45:14,657 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-02-15 10:45:14,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,687 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-02-15 10:45:14,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-02-15 10:45:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:16,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:18,557 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-02-15 10:45:18,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:18,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:18,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-15 10:45:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 10:45:18,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:18,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-02-15 10:45:18,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:18,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-15 10:45:18,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-15 10:45:18,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:45:18,613 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-02-15 10:45:23,623 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-02-15 10:45:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:23,636 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-15 10:45:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:45:23,637 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-02-15 10:45:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:23,638 INFO L225 Difference]: With dead ends: 13 [2019-02-15 10:45:23,638 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 10:45:23,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2019-02-15 10:45:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 10:45:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-15 10:45:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 10:45:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-15 10:45:23,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-15 10:45:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:23,643 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-15 10:45:23,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-15 10:45:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-15 10:45:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 10:45:23,644 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:23,644 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-15 10:45:23,644 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:23,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-02-15 10:45:23,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:24,235 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-02-15 10:45:24,477 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-02-15 10:45:24,782 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-02-15 10:45:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:24,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:24,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:24,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:24,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,809 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-02-15 10:45:24,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:24,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:24,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:24,857 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-02-15 10:45:24,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:24,866 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-02-15 10:45:24,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-15 10:45:24,904 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-02-15 10:45:24,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:25,030 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-02-15 10:45:25,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-15 10:45:25,075 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-02-15 10:45:25,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:25,099 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-02-15 10:45:25,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-15 10:45:25,148 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-02-15 10:45:25,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:25,170 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-02-15 10:45:25,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-15 10:45:25,240 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-02-15 10:45:25,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:25,268 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-02-15 10:45:25,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-15 10:45:25,588 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-02-15 10:45:25,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:25,623 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-02-15 10:45:25,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-02-15 10:45:27,749 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-02-15 10:45:27,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:27,783 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-02-15 10:45:27,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-02-15 10:45:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:41,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:54,527 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-02-15 10:45:54,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:54,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:54,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-15 10:45:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 10:45:54,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:54,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2019-02-15 10:45:54,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:54,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-15 10:45:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-15 10:45:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=309, Unknown=2, NotChecked=0, Total=420 [2019-02-15 10:45:54,567 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2019-02-15 10:45:59,591 WARN L181 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 111 DAG size of output: 48 [2019-02-15 10:46:13,029 WARN L181 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2019-02-15 10:46:30,565 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-15 10:46:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:46:30,567 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.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2019-02-15 10:46:30,571 INFO L168 Benchmark]: Toolchain (without parser) took 91709.76 ms. Allocated memory was 130.0 MB in the beginning and 365.4 MB in the end (delta: 235.4 MB). Free memory was 102.8 MB in the beginning and 208.4 MB in the end (delta: -105.6 MB). Peak memory consumption was 129.8 MB. Max. memory is 7.1 GB. [2019-02-15 10:46:30,572 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 130.0 MB. Free memory is still 104.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:46:30,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.92 ms. Allocated memory is still 130.0 MB. Free memory was 102.8 MB in the beginning and 100.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-02-15 10:46:30,573 INFO L168 Benchmark]: Boogie Preprocessor took 26.36 ms. Allocated memory is still 130.0 MB. Free memory was 100.9 MB in the beginning and 99.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-02-15 10:46:30,574 INFO L168 Benchmark]: RCFGBuilder took 309.76 ms. Allocated memory is still 130.0 MB. Free memory was 99.7 MB in the beginning and 91.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-02-15 10:46:30,574 INFO L168 Benchmark]: TraceAbstraction took 91326.90 ms. Allocated memory was 130.0 MB in the beginning and 365.4 MB in the end (delta: 235.4 MB). Free memory was 90.8 MB in the beginning and 208.4 MB in the end (delta: -117.7 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2019-02-15 10:46:30,577 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.26 ms. Allocated memory is still 130.0 MB. Free memory is still 104.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.92 ms. Allocated memory is still 130.0 MB. Free memory was 102.8 MB in the beginning and 100.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.36 ms. Allocated memory is still 130.0 MB. Free memory was 100.9 MB in the beginning and 99.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 309.76 ms. Allocated memory is still 130.0 MB. Free memory was 99.7 MB in the beginning and 91.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91326.90 ms. Allocated memory was 130.0 MB in the beginning and 365.4 MB in the end (delta: 235.4 MB). Free memory was 90.8 MB in the beginning and 208.4 MB in the end (delta: -117.7 MB). Peak memory consumption was 117.7 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...