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_camel.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:48,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:48,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:48,601 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:48,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:48,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:48,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:48,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:48,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:48,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:48,609 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:48,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:48,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:48,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:48,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:48,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:48,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:48,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:48,618 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:48,620 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:48,624 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:48,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:48,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:48,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:48,631 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:48,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:48,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:48,633 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:48,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:48,636 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:48,637 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:48,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:48,638 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:48,639 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:48,640 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:48,641 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:48,642 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:23:48,666 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:48,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:48,667 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:48,667 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:48,667 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:48,671 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:48,671 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:48,671 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:48,672 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:48,672 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:48,672 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:48,672 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:48,672 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:48,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:48,673 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:48,674 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:48,674 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:48,674 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:48,674 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:48,674 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:48,675 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:48,676 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:48,677 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:48,677 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:48,677 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:48,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:48,677 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:48,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:48,678 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:48,678 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:48,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:48,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:48,679 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:48,679 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:48,679 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:48,679 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:48,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:48,680 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:48,681 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:48,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:48,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:48,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:48,754 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:48,755 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:48,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2019-03-04 16:23:48,756 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-03-04 16:23:48,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:48,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:48,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:48,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:48,816 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:48,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/1) ... [2019-03-04 16:23:48,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/1) ... [2019-03-04 16:23:48,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:48,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:48,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:48,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:48,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/1) ... [2019-03-04 16:23:48,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/1) ... [2019-03-04 16:23:48,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/1) ... [2019-03-04 16:23:48,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/1) ... [2019-03-04 16:23:48,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/1) ... [2019-03-04 16:23:48,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/1) ... [2019-03-04 16:23:48,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/1) ... [2019-03-04 16:23:48,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:48,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:48,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:48,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:48,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (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-03-04 16:23:48,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:23:48,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:23:49,304 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-03-04 16:23:49,306 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:23:49,306 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-03-04 16:23:49,307 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:49 BoogieIcfgContainer [2019-03-04 16:23:49,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:49,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:49,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:49,314 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:49,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:48" (1/2) ... [2019-03-04 16:23:49,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560b0f7b and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:49, skipping insertion in model container [2019-03-04 16:23:49,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:49" (2/2) ... [2019-03-04 16:23:49,317 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-03-04 16:23:49,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:49,338 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:23:49,355 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:23:49,396 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:49,397 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:49,397 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:49,397 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:49,397 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:49,397 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:49,398 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:49,398 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:49,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-03-04 16:23:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:23:49,417 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:49,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:23:49,421 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-03-04 16:23:49,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:49,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:49,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:49,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:49,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:23:49,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:49,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:49,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:49,623 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-03-04 16:23:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:49,703 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-03-04 16:23:49,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:23:49,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-03-04 16:23:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:49,721 INFO L225 Difference]: With dead ends: 11 [2019-03-04 16:23:49,725 INFO L226 Difference]: Without dead ends: 7 [2019-03-04 16:23:49,733 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-03-04 16:23:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-03-04 16:23:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-03-04 16:23:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:23:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-03-04 16:23:49,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-03-04 16:23:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:49,784 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-03-04 16:23:49,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:23:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-03-04 16:23:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:23:49,786 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:49,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:23:49,786 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-03-04 16:23:49,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:49,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:49,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:49,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:49,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:49,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03-04 16:23:49,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:49,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:23:49,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:49,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:49,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-03-04 16:23:49,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:23:49,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:23:49,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:23:49,963 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-03-04 16:23:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:50,026 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-03-04 16:23:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:23:50,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:23:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:50,027 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:23:50,027 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:23:50,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:23:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:23:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-03-04 16:23:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:23:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-03-04 16:23:50,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-03-04 16:23:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:50,032 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-03-04 16:23:50,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:23:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-03-04 16:23:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:23:50,033 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:50,033 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:23:50,034 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:50,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:50,035 INFO L82 PathProgramCache]: Analyzing trace with hash 894182058, now seen corresponding path program 2 times [2019-03-04 16:23:50,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:50,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:50,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:50,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03-04 16:23:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:50,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-03-04 16:23:50,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:50,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:23:50,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:23:50,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:23:50,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-03-04 16:23:50,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:23:50,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:23:50,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:23:50,280 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2019-03-04 16:23:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:50,502 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2019-03-04 16:23:50,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:23:50,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-03-04 16:23:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:50,503 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:23:50,503 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:23:50,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:23:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:23:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-03-04 16:23:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:23:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-03-04 16:23:50,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2019-03-04 16:23:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:50,508 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-03-04 16:23:50,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:23:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-03-04 16:23:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:23:50,509 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:50,509 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:50,510 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:50,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:50,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1241275689, now seen corresponding path program 1 times [2019-03-04 16:23:50,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:50,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:23:50,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:50,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03-04 16:23:50,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:23:50,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:23:50,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:50,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-03-04 16:23:50,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:23:50,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:23:50,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:50,681 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 6 states. [2019-03-04 16:23:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:50,870 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-03-04 16:23:50,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:23:50,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-03-04 16:23:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:50,872 INFO L225 Difference]: With dead ends: 16 [2019-03-04 16:23:50,872 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:23:50,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:23:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-03-04 16:23:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:23:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-03-04 16:23:50,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-03-04 16:23:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:50,878 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-03-04 16:23:50,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:23:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-03-04 16:23:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:23:50,879 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:50,879 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:50,879 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash -126441518, now seen corresponding path program 2 times [2019-03-04 16:23:50,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:23:51,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:51,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03-04 16:23:51,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:51,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:51,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:51,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:23:51,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:23:51,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:51,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-03-04 16:23:51,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:23:51,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:23:51,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:23:51,153 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 7 states. [2019-03-04 16:23:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:51,200 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-03-04 16:23:51,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:23:51,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-03-04 16:23:51,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:51,201 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:23:51,202 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:23:51,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:23:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:23:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-03-04 16:23:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:23:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-03-04 16:23:51,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-03-04 16:23:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:51,206 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-03-04 16:23:51,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:23:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-03-04 16:23:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-03-04 16:23:51,207 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:51,207 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:51,208 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash 423998025, now seen corresponding path program 3 times [2019-03-04 16:23:51,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:51,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:51,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:51,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-03-04 16:23:51,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:51,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-03-04 16:23:51,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:23:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:23:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:23:51,323 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2019-03-04 16:23:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:51,394 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-03-04 16:23:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:51,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-03-04 16:23:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:51,396 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:23:51,396 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:23:51,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:23:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-03-04 16:23:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:23:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-03-04 16:23:51,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-03-04 16:23:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:51,402 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-03-04 16:23:51,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:23:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-03-04 16:23:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-03-04 16:23:51,403 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:51,403 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:51,403 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:51,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:51,403 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 1 times [2019-03-04 16:23:51,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:51,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:51,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:51,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-03-04 16:23:51,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:51,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03-04 16:23:51,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:51,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:23:51,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-03-04 16:23:51,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:51,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-03-04 16:23:51,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:23:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:23:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:23:51,754 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 9 states. [2019-03-04 16:23:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:52,170 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2019-03-04 16:23:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:23:52,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-03-04 16:23:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:52,172 INFO L225 Difference]: With dead ends: 22 [2019-03-04 16:23:52,172 INFO L226 Difference]: Without dead ends: 18 [2019-03-04 16:23:52,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-03-04 16:23:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-03-04 16:23:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:23:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-03-04 16:23:52,179 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2019-03-04 16:23:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:52,179 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-03-04 16:23:52,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:23:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-03-04 16:23:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-03-04 16:23:52,180 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:52,181 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 1, 1, 1, 1] [2019-03-04 16:23:52,181 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:52,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:52,181 INFO L82 PathProgramCache]: Analyzing trace with hash -637795687, now seen corresponding path program 2 times [2019-03-04 16:23:52,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:52,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:52,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:52,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-03-04 16:23:52,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:52,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-03-04 16:23:52,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:23:52,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:23:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:23:52,357 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 4 states. [2019-03-04 16:23:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:52,431 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-03-04 16:23:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:23:52,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-03-04 16:23:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:52,433 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:23:52,433 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:23:52,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:23:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:23:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-03-04 16:23:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:23:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-03-04 16:23:52,441 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2019-03-04 16:23:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:52,441 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-03-04 16:23:52,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:23:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-03-04 16:23:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-03-04 16:23:52,442 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:52,442 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1] [2019-03-04 16:23:52,442 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:52,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1767587827, now seen corresponding path program 3 times [2019-03-04 16:23:52,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:52,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:52,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-03-04 16:23:52,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:52,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03-04 16:23:52,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:23:52,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:23:52,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:52,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:23:52,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:52,689 INFO L453 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-03-04 16:23:52,689 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:52,707 INFO L309 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-03-04 16:23:52,707 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:23:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-03-04 16:23:52,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:23:52,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-03-04 16:23:52,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:23:52,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:23:52,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:23:52,814 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 9 states. [2019-03-04 16:23:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:53,223 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-03-04 16:23:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:23:53,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-03-04 16:23:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:53,225 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:23:53,226 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:23:53,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:23:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:23:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:23:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:23:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:23:53,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-03-04 16:23:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:53,228 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:23:53,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:23:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:23:53,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:23:53,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:23:53,556 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-03-04 16:23:53,688 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-03-04 16:23:53,692 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-03-04 16:23:53,692 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-03-04 16:23:53,693 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-03-04 16:23:53,693 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (let ((.cse4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))) (let ((.cse0 (<= .cse4 ULTIMATE.start_SelectionSort_~i~4)) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_16 Int)) (and (<= v_ULTIMATE.start_main_~i~7_16 (+ ULTIMATE.start_main_~i~7 1)) (<= 0 v_ULTIMATE.start_main_~i~7_16) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_16) v_ULTIMATE.start_main_~i~7_16)))) (.cse2 (exists ((v_ULTIMATE.start_main_~i~7_16 Int)) (and (<= v_ULTIMATE.start_main_~i~7_16 0) (<= 0 v_ULTIMATE.start_main_~i~7_16) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_16) v_ULTIMATE.start_main_~i~7_16)))) (.cse3 (<= 5 ~n))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)) (and .cse0 .cse1 (<= ULTIMATE.start_SelectionSort_~i~4 .cse4) (<= .cse4 ~n) .cse2 .cse3)))) [2019-03-04 16:23:53,693 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-03-04 16:23:53,693 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_16 Int)) (and (<= v_ULTIMATE.start_main_~i~7_16 (+ ULTIMATE.start_main_~i~7 1)) (<= 0 v_ULTIMATE.start_main_~i~7_16) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_16) v_ULTIMATE.start_main_~i~7_16)))) (.cse1 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse2 (exists ((v_ULTIMATE.start_main_~i~7_16 Int)) (and (<= v_ULTIMATE.start_main_~i~7_16 0) (<= 0 v_ULTIMATE.start_main_~i~7_16) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_16) v_ULTIMATE.start_main_~i~7_16)))) (.cse3 (<= 5 ~n))) (or (and .cse0 (<= ULTIMATE.start_SelectionSort_~i~4 .cse1) (<= ~n ULTIMATE.start_SelectionSort_~lh~4) .cse2 .cse3) (and .cse0 .cse2 .cse3 (= ULTIMATE.start_SelectionSort_~lh~4 0)) (and (<= .cse1 ULTIMATE.start_SelectionSort_~i~4) .cse0 (<= .cse1 ~n) .cse2 .cse3))) [2019-03-04 16:23:53,694 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (let ((.cse0 (<= 5 ~n))) (or (and (exists ((v_ULTIMATE.start_main_~i~7_16 Int)) (and (<= v_ULTIMATE.start_main_~i~7_16 (+ ULTIMATE.start_main_~i~7 1)) (<= 0 v_ULTIMATE.start_main_~i~7_16) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_16) v_ULTIMATE.start_main_~i~7_16))) .cse0) (and (<= 4 ULTIMATE.start_main_~i~7) .cse0))) [2019-03-04 16:23:53,708 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:23:53 BoogieIcfgContainer [2019-03-04 16:23:53,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:23:53,709 INFO L168 Benchmark]: Toolchain (without parser) took 4895.68 ms. Allocated memory was 132.1 MB in the beginning and 195.0 MB in the end (delta: 62.9 MB). Free memory was 106.1 MB in the beginning and 105.8 MB in the end (delta: 335.5 kB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:53,711 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:23:53,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.19 ms. Allocated memory is still 132.1 MB. Free memory was 106.1 MB in the beginning and 104.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:53,712 INFO L168 Benchmark]: Boogie Preprocessor took 27.54 ms. Allocated memory is still 132.1 MB. Free memory was 104.4 MB in the beginning and 103.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:53,713 INFO L168 Benchmark]: RCFGBuilder took 420.92 ms. Allocated memory is still 132.1 MB. Free memory was 103.3 MB in the beginning and 92.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:53,714 INFO L168 Benchmark]: TraceAbstraction took 4398.05 ms. Allocated memory was 132.1 MB in the beginning and 195.0 MB in the end (delta: 62.9 MB). Free memory was 92.5 MB in the beginning and 105.8 MB in the end (delta: -13.3 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:53,719 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.22 ms. Allocated memory is still 132.1 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.19 ms. Allocated memory is still 132.1 MB. Free memory was 106.1 MB in the beginning and 104.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.54 ms. Allocated memory is still 132.1 MB. Free memory was 104.4 MB in the beginning and 103.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 420.92 ms. Allocated memory is still 132.1 MB. Free memory was 103.3 MB in the beginning and 92.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4398.05 ms. Allocated memory was 132.1 MB in the beginning and 195.0 MB in the end (delta: 62.9 MB). Free memory was 92.5 MB in the beginning and 105.8 MB in the end (delta: -13.3 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= main_~i~7 + 1 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && ~n <= SelectionSort_~lh~4) && (exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= 0 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16)) && 5 <= ~n) || ((((exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= main_~i~7 + 1 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16) && (exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= 0 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16)) && 5 <= ~n) && SelectionSort_~lh~4 == 0)) || ((((SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4 && (exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= main_~i~7 + 1 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16)) && SelectionSort_~lh~4 + 1 <= ~n) && (exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= 0 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16)) && 5 <= ~n) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= main_~i~7 + 1 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16) && 5 <= ~n) || (4 <= main_~i~7 && 5 <= ~n) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4 && (exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= main_~i~7 + 1 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16)) && (exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= 0 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16)) && 5 <= ~n) && SelectionSort_~lh~4 + 2 <= ~n) || (((((SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4 && (exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= main_~i~7 + 1 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16)) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && SelectionSort_~lh~4 + 1 <= ~n) && (exists v_ULTIMATE.start_main_~i~7_16 : int :: (v_ULTIMATE.start_main_~i~7_16 <= 0 && 0 <= v_ULTIMATE.start_main_~i~7_16) && main_~array~7[v_ULTIMATE.start_main_~i~7_16] == v_ULTIMATE.start_main_~i~7_16)) && 5 <= ~n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 41 SDslu, 71 SDs, 0 SdLazy, 151 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 21 NumberOfFragments, 236 HoareAnnotationTreeSize, 4 FomulaSimplifications, 453 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 165 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 152 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 137 ConstructedInterpolants, 11 QuantifiedInterpolants, 5925 SizeOfPredicates, 12 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 155/197 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...