java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:01:55,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:01:55,471 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:01:55,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:01:55,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:01:55,493 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:01:55,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:01:55,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:01:55,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:01:55,502 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:01:55,505 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:01:55,505 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:01:55,506 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:01:55,507 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:01:55,508 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:01:55,516 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:01:55,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:01:55,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:01:55,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:01:55,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:01:55,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:01:55,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:01:55,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:01:55,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:01:55,527 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:01:55,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:01:55,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:01:55,529 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:01:55,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:01:55,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:01:55,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:01:55,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:01:55,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:01:55,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:01:55,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:01:55,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:01:55,534 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:01:55,551 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:01:55,552 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:01:55,553 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:01:55,553 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:01:55,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:01:55,553 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:01:55,553 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:01:55,554 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:01:55,557 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:01:55,557 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:01:55,557 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:01:55,557 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:01:55,557 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:01:55,558 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:01:55,558 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:01:55,559 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:01:55,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:01:55,559 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:01:55,559 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:01:55,559 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:01:55,559 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:01:55,561 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:01:55,562 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:01:55,562 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:01:55,562 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:01:55,562 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:01:55,562 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:01:55,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:01:55,563 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:01:55,563 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:01:55,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:01:55,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:01:55,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:01:55,564 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:01:55,564 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:01:55,565 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:01:55,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:01:55,565 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:01:55,565 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:01:55,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:01:55,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:01:55,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:01:55,626 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:01:55,626 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:01:55,627 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl [2018-12-03 18:01:55,627 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl' [2018-12-03 18:01:55,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:01:55,663 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:01:55,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:01:55,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:01:55,665 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:01:55,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... [2018-12-03 18:01:55,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... [2018-12-03 18:01:55,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:01:55,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:01:55,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:01:55,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:01:55,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... [2018-12-03 18:01:55,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... [2018-12-03 18:01:55,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... [2018-12-03 18:01:55,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... [2018-12-03 18:01:55,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... [2018-12-03 18:01:55,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... [2018-12-03 18:01:55,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... [2018-12-03 18:01:55,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:01:55,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:01:55,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:01:55,723 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:01:55,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:01:55,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:01:55,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:01:56,063 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:01:56,064 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:01:56,064 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:56 BoogieIcfgContainer [2018-12-03 18:01:56,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:01:56,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:01:56,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:01:56,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:01:56,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:55" (1/2) ... [2018-12-03 18:01:56,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c2ff45 and model type sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:01:56, skipping insertion in model container [2018-12-03 18:01:56,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:56" (2/2) ... [2018-12-03 18:01:56,074 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03.i_3.bpl [2018-12-03 18:01:56,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:01:56,092 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:01:56,106 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:01:56,138 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:01:56,138 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:01:56,138 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:01:56,138 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:01:56,139 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:01:56,139 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:01:56,139 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:01:56,139 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:01:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 18:01:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:01:56,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:56,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 18:01:56,170 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:56,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-12-03 18:01:56,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:56,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:56,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:56,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:56,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:01:56,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:01:56,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:01:56,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:01:56,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:01:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:01:56,595 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 5 states. [2018-12-03 18:01:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:56,839 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-03 18:01:56,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:01:56,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-03 18:01:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:56,853 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:01:56,853 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 18:01:56,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:01:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 18:01:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-12-03 18:01:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:01:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-03 18:01:56,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2018-12-03 18:01:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:56,894 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-03 18:01:56,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:01:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-03 18:01:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:01:56,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:56,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 18:01:56,896 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:56,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 889599113, now seen corresponding path program 1 times [2018-12-03 18:01:56,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:56,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:56,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:56,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:57,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:01:57,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:01:57,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:01:57,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:01:57,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:01:57,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:01:57,049 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-12-03 18:01:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:57,255 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-03 18:01:57,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:01:57,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 18:01:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:57,256 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:01:57,257 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:01:57,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:01:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:01:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-03 18:01:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:01:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-03 18:01:57,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 6 [2018-12-03 18:01:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:57,269 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-03 18:01:57,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:01:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-03 18:01:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:01:57,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:57,270 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:01:57,272 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:57,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:57,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1495298495, now seen corresponding path program 1 times [2018-12-03 18:01:57,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:57,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:57,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:57,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:57,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:57,541 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 18:01:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:57,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:57,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:57,560 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 18:01:57,562 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18] [2018-12-03 18:01:57,618 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:01:57,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:01:57,715 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:01:58,467 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:01:58,469 INFO L272 AbstractInterpreter]: Visited 8 different actions 75 times. Merged at 7 different actions 58 times. Widened at 6 different actions 28 times. Found 8 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 18:01:58,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:58,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:01:58,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:58,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:01:58,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:58,530 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:58,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:58,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:58,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:58,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 18:01:58,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:58,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:01:58,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:01:58,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:01:58,685 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2018-12-03 18:01:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:58,731 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-12-03 18:01:58,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:01:58,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-03 18:01:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:58,733 INFO L225 Difference]: With dead ends: 28 [2018-12-03 18:01:58,733 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:01:58,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:01:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:01:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-03 18:01:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:01:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-03 18:01:58,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-12-03 18:01:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:58,741 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-03 18:01:58,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:01:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-03 18:01:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:01:58,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:58,742 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-12-03 18:01:58,742 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:58,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1053631477, now seen corresponding path program 2 times [2018-12-03 18:01:58,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:58,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:58,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:59,000 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 18:01:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:59,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:59,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:59,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:59,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:01:59,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:59,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:01:59,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:59,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:02:11,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 18:02:11,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:02:11,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:12,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:12,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:12,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2018-12-03 18:02:12,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:12,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:02:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:02:12,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:12,130 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2018-12-03 18:02:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:12,238 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-12-03 18:02:12,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:02:12,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-03 18:02:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:12,239 INFO L225 Difference]: With dead ends: 28 [2018-12-03 18:02:12,239 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:02:12,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:02:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-03 18:02:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:02:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-03 18:02:12,247 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2018-12-03 18:02:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:12,247 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-03 18:02:12,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:02:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-03 18:02:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:02:12,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:12,248 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-12-03 18:02:12,249 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:12,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1036634923, now seen corresponding path program 3 times [2018-12-03 18:02:12,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:12,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:12,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:12,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:12,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:12,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:12,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:12,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:02:12,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:12,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:02:12,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:02:12,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:02:12,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:02:12,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:02:12,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:12,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:12,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:12,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 18:02:12,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:12,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:02:12,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:02:12,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:02:12,851 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 7 states. [2018-12-03 18:02:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:12,961 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-03 18:02:12,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:02:12,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-03 18:02:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:12,968 INFO L225 Difference]: With dead ends: 32 [2018-12-03 18:02:12,968 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:02:12,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:02:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:02:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-03 18:02:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:02:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-03 18:02:12,977 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-12-03 18:02:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:12,978 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-03 18:02:12,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:02:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-03 18:02:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:02:12,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:12,979 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-12-03 18:02:12,980 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:12,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1827412127, now seen corresponding path program 4 times [2018-12-03 18:02:12,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:12,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:12,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:13,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:13,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:13,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:13,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:02:13,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:13,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:02:13,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:13,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:02:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:13,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:13,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:13,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:13,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 18:02:13,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:13,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:02:13,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:02:13,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:02:13,524 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-12-03 18:02:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:13,650 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-03 18:02:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:02:13,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-03 18:02:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:13,652 INFO L225 Difference]: With dead ends: 36 [2018-12-03 18:02:13,652 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:02:13,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:02:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:02:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-03 18:02:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 18:02:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-03 18:02:13,662 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-12-03 18:02:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:13,662 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-03 18:02:13,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:02:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-03 18:02:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:02:13,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:13,663 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-12-03 18:02:13,664 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:13,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1058473833, now seen corresponding path program 5 times [2018-12-03 18:02:13,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:13,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:13,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:13,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:13,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:13,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:13,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:13,916 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:13,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:02:13,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:13,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:02:13,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:02:13,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:03:04,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 18:03:04,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:03:04,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:03:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:04,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:03:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:04,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:03:04,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 18:03:04,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:03:04,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:03:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:03:04,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:03:04,876 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-12-03 18:03:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:05,037 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-03 18:03:05,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:03:05,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-03 18:03:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:05,040 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:03:05,041 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 18:03:05,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:03:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 18:03:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-03 18:03:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 18:03:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-03 18:03:05,051 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2018-12-03 18:03:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:05,052 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-03 18:03:05,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:03:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-03 18:03:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:03:05,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:05,053 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-12-03 18:03:05,053 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:05,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:05,054 INFO L82 PathProgramCache]: Analyzing trace with hash -288981299, now seen corresponding path program 6 times [2018-12-03 18:03:05,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:05,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:05,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:03:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:05,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:05,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:05,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:03:05,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:03:05,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:03:05,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:05,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:03:05,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:03:05,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:03:05,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:03:05,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:03:05,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:03:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:05,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:03:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:05,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:03:05,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 18:03:05,770 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:03:05,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:03:05,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:03:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:03:05,771 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2018-12-03 18:03:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:06,016 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-03 18:03:06,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:03:06,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-12-03 18:03:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:06,020 INFO L225 Difference]: With dead ends: 44 [2018-12-03 18:03:06,021 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 18:03:06,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:03:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 18:03:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-03 18:03:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:03:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-03 18:03:06,032 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2018-12-03 18:03:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:06,032 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-03 18:03:06,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:03:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-03 18:03:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:03:06,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:06,034 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-12-03 18:03:06,034 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:06,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1231682051, now seen corresponding path program 7 times [2018-12-03 18:03:06,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:06,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:03:06,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:06,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:06,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:06,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:03:06,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:03:06,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:03:06,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:06,239 INFO L192 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 [2018-12-03 18:03:06,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:03:06,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:03:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:06,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:03:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:06,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:03:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:06,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:03:06,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 18:03:06,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:03:06,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:03:06,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:03:06,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:03:06,685 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 11 states. [2018-12-03 18:03:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:07,104 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-12-03 18:03:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:03:07,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-12-03 18:03:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:07,106 INFO L225 Difference]: With dead ends: 48 [2018-12-03 18:03:07,106 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 18:03:07,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:03:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 18:03:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-03 18:03:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 18:03:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-12-03 18:03:07,119 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2018-12-03 18:03:07,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:07,120 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-12-03 18:03:07,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:03:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-12-03 18:03:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:03:07,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:07,121 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-12-03 18:03:07,122 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:07,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:07,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1657858617, now seen corresponding path program 8 times [2018-12-03 18:03:07,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:07,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:07,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:03:07,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:07,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:07,352 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:07,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:07,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:03:07,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:03:07,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:03:07,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:07,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:03:07,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:03:07,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:04:41,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 18:04:41,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:04:41,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:04:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:41,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:04:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:41,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:04:41,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 18:04:41,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:04:41,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:04:41,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:04:41,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:04:41,597 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-12-03 18:04:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:04:41,817 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-12-03 18:04:41,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:04:41,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-03 18:04:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:04:41,822 INFO L225 Difference]: With dead ends: 52 [2018-12-03 18:04:41,822 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 18:04:41,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:04:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 18:04:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-03 18:04:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 18:04:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-03 18:04:41,836 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 38 [2018-12-03 18:04:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:04:41,836 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-03 18:04:41,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:04:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-03 18:04:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 18:04:41,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:04:41,838 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-12-03 18:04:41,838 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:04:41,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:04:41,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1841770641, now seen corresponding path program 9 times [2018-12-03 18:04:41,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:04:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:41,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:04:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:41,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:04:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:04:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:42,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:42,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:04:42,202 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:04:42,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:04:42,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:42,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:04:42,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:04:42,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:04:42,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:04:42,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:04:42,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:04:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:42,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:04:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:42,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:04:42,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 18:04:42,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:04:42,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:04:42,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:04:42,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:04:42,704 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 13 states. [2018-12-03 18:04:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:04:42,942 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-12-03 18:04:42,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:04:42,942 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-12-03 18:04:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:04:42,944 INFO L225 Difference]: With dead ends: 56 [2018-12-03 18:04:42,944 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 18:04:42,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:04:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 18:04:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-03 18:04:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 18:04:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-12-03 18:04:42,958 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 42 [2018-12-03 18:04:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:04:42,958 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-12-03 18:04:42,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:04:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-12-03 18:04:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 18:04:42,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:04:42,960 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-12-03 18:04:42,960 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:04:42,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:04:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1411328421, now seen corresponding path program 10 times [2018-12-03 18:04:42,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:04:42,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:42,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:04:42,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:42,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:04:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 18:04:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 18:04:43,064 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 18:04:43,099 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:04:43 BoogieIcfgContainer [2018-12-03 18:04:43,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:04:43,100 INFO L168 Benchmark]: Toolchain (without parser) took 167438.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 667.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -56.7 MB). Peak memory consumption was 610.7 MB. Max. memory is 7.1 GB. [2018-12-03 18:04:43,102 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:04:43,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:04:43,103 INFO L168 Benchmark]: Boogie Preprocessor took 21.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:04:43,103 INFO L168 Benchmark]: RCFGBuilder took 341.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 18:04:43,104 INFO L168 Benchmark]: TraceAbstraction took 167034.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 667.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -77.8 MB). Peak memory consumption was 589.6 MB. Max. memory is 7.1 GB. [2018-12-03 18:04:43,108 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 341.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 167034.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 667.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -77.8 MB). Peak memory consumption was 589.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 54]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_~sn~5, main_~loop1~5, main_~n1~5, main_~x~5; [L16] main_~sn~5 := 0; [L17] main_~loop1~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] main_~n1~5 := main_#t~nondet1; [L20] havoc main_#t~nondet1; [L21] main_~x~5 := 0; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=0, main_~x~5=0] [L25] assume !false; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=0, main_~x~5=0] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=0] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=1] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=2] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=3] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=4] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=5] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=6] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=7] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=8] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=9] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L25] assume !false; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L34] assume !(main_~x~5 % 4294967296 < 10); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L47] assume __VERIFIER_assert_~cond == 0; [L48] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L54] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. UNSAFE Result, 166.9s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 67 SDslu, 750 SDs, 0 SdLazy, 917 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 388 SyntacticMatches, 18 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 16 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 157.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 685 ConstructedInterpolants, 0 QuantifiedInterpolants, 127755 SizeOfPredicates, 10 NumberOfNonLiveVariables, 684 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 270/1980 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...