java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:37:58,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:37:58,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:37:58,283 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:37:58,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:37:58,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:37:58,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:37:58,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:37:58,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:37:58,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:37:58,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:37:58,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:37:58,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:37:58,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:37:58,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:37:58,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:37:58,314 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:37:58,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:37:58,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:37:58,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:37:58,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:37:58,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:37:58,334 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:37:58,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:37:58,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:37:58,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:37:58,340 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:37:58,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:37:58,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:37:58,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:37:58,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:37:58,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:37:58,347 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:37:58,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:37:58,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:37:58,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:37:58,351 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:37:58,372 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:37:58,372 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:37:58,374 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:37:58,374 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:37:58,374 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:37:58,374 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:37:58,375 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:37:58,375 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:37:58,375 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:37:58,376 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:37:58,376 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:37:58,376 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:37:58,376 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:37:58,376 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:37:58,377 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:37:58,377 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:37:58,378 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:37:58,379 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:37:58,379 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:37:58,380 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:37:58,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:37:58,380 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:37:58,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:37:58,380 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:37:58,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:37:58,381 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:37:58,381 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:37:58,382 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:37:58,382 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:37:58,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:37:58,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:37:58,383 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:37:58,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:37:58,383 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:37:58,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:37:58,384 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:37:58,384 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:37:58,384 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:37:58,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:37:58,385 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:37:58,385 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:37:58,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:37:58,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:37:58,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:37:58,449 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:37:58,449 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:37:58,450 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl [2018-12-03 15:37:58,451 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl' [2018-12-03 15:37:58,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:37:58,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:37:58,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:37:58,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:37:58,515 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:37:58,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... [2018-12-03 15:37:58,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... [2018-12-03 15:37:58,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:37:58,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:37:58,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:37:58,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:37:58,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... [2018-12-03 15:37:58,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... [2018-12-03 15:37:58,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... [2018-12-03 15:37:58,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... [2018-12-03 15:37:58,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... [2018-12-03 15:37:58,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... [2018-12-03 15:37:58,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... [2018-12-03 15:37:58,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:37:58,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:37:58,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:37:58,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:37:58,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:37:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:37:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:37:58,844 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:37:58,845 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 15:37:58,845 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:37:58 BoogieIcfgContainer [2018-12-03 15:37:58,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:37:58,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:37:58,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:37:58,850 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:37:58,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:37:58" (1/2) ... [2018-12-03 15:37:58,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782dba1f and model type nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:37:58, skipping insertion in model container [2018-12-03 15:37:58,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:37:58" (2/2) ... [2018-12-03 15:37:58,853 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bpl [2018-12-03 15:37:58,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:37:58,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:37:58,891 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:37:58,936 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:37:58,936 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:37:58,937 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:37:58,937 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:37:58,937 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:37:58,937 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:37:58,937 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:37:58,938 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:37:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 15:37:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:37:58,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:58,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:37:58,964 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:58,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:58,971 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:37:58,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:59,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:59,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:59,136 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 15:37:59,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:37:59,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:37:59,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:37:59,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:37:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:37:59,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:37:59,159 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 15:37:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:59,243 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 15:37:59,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:37:59,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:37:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:59,255 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:37:59,255 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:37:59,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:37:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:37:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 15:37:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:37:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 15:37:59,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-03 15:37:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:59,294 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 15:37:59,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:37:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 15:37:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:37:59,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:59,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:37:59,296 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:59,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:59,296 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2018-12-03 15:37:59,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:59,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:59,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:59,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:37:59,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:37:59,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:37:59,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:37:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:37:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:37:59,455 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-03 15:37:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:59,663 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 15:37:59,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:37:59,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 15:37:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:59,665 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:37:59,665 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:37:59,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:37:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:37:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:37:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:37:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 15:37:59,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 15:37:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:59,670 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 15:37:59,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:37:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 15:37:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:37:59,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:59,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:37:59,671 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:59,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2018-12-03 15:37:59,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:59,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:59,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:59,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:59,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:59,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:59,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:59,783 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 15:37:59,785 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-03 15:37:59,828 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:37:59,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:38:00,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:38:00,148 INFO L272 AbstractInterpreter]: Visited 6 different actions 28 times. Merged at 5 different actions 17 times. Widened at 3 different actions 3 times. Found 7 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:38:00,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:00,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:38:00,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:00,163 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 15:38:00,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:00,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:00,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:00,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:00,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:00,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2018-12-03 15:38:00,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:00,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:38:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:38:00,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:38:00,485 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-12-03 15:38:00,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:00,653 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 15:38:00,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:38:00,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 15:38:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:00,655 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:38:00,655 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:38:00,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:38:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:38:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:38:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:38:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 15:38:00,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 15:38:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:00,660 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 15:38:00,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:38:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 15:38:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:38:00,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:00,662 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 15:38:00,662 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:00,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:00,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1959435275, now seen corresponding path program 2 times [2018-12-03 15:38:00,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:00,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:00,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:00,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:38:00,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:00,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:00,713 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:00,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:00,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:00,713 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 15:38:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:00,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:00,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:38:00,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:00,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:38:00,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:38:00,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:00,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-03 15:38:00,962 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:00,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:38:00,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:38:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:38:00,964 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2018-12-03 15:38:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:01,005 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-03 15:38:01,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:38:01,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 15:38:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:01,007 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:38:01,008 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:38:01,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:38:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:38:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 15:38:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:38:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 15:38:01,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-12-03 15:38:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:01,014 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 15:38:01,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:38:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 15:38:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:38:01,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:01,016 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-12-03 15:38:01,016 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:01,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:01,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1701183725, now seen corresponding path program 3 times [2018-12-03 15:38:01,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:01,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:01,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:01,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:01,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:38:01,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:01,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:01,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:01,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:01,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:01,169 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 15:38:01,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:01,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:01,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:01,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:01,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:38:01,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:38:01,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:01,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2018-12-03 15:38:01,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:01,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:38:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:38:01,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:38:01,399 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 9 states. [2018-12-03 15:38:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:01,435 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 15:38:01,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:38:01,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-03 15:38:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:01,441 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:38:01,441 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:38:01,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:38:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:38:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:38:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:38:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 15:38:01,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 15:38:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:01,447 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 15:38:01,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:38:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 15:38:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:38:01,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:01,448 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-12-03 15:38:01,448 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:01,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:01,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1295239837, now seen corresponding path program 4 times [2018-12-03 15:38:01,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:01,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:01,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:01,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:01,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:38:01,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:01,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:01,554 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:01,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:01,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:01,555 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 15:38:01,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:01,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:01,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:38:02,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:38:02,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:02,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2018-12-03 15:38:02,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:02,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:38:02,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:38:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:38:02,165 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-12-03 15:38:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:02,221 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-12-03 15:38:02,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:38:02,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-12-03 15:38:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:02,223 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:38:02,223 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:38:02,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:38:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:38:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:38:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:38:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 15:38:02,228 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 15:38:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:02,229 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 15:38:02,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:38:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 15:38:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:38:02,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:02,230 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-12-03 15:38:02,230 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:02,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1398752045, now seen corresponding path program 5 times [2018-12-03 15:38:02,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:02,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:02,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:38:02,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:02,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:02,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:02,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:02,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:02,423 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 15:38:02,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:02,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:02,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:38:02,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:02,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:38:02,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:38:02,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:02,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2018-12-03 15:38:02,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:02,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:38:02,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:38:02,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:38:02,912 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-12-03 15:38:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:02,951 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-03 15:38:02,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:38:02,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-12-03 15:38:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:02,952 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:38:02,952 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:38:02,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:38:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:38:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:38:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:38:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 15:38:02,957 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-12-03 15:38:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:02,957 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 15:38:02,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:38:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 15:38:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:38:02,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:02,958 INFO L402 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-12-03 15:38:02,959 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:02,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash 149890851, now seen corresponding path program 6 times [2018-12-03 15:38:02,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:02,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:02,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:02,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:02,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:38:03,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:03,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:03,085 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:03,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:03,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:03,085 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 15:38:03,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:03,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:03,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:03,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:03,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:38:03,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:38:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 15:38:03,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:03,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:38:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:38:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:38:03,365 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-12-03 15:38:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:03,420 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-03 15:38:03,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:38:03,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-12-03 15:38:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:03,423 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:38:03,423 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:38:03,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:38:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:38:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:38:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:38:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 15:38:03,429 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-12-03 15:38:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:03,429 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 15:38:03,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:38:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 15:38:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:38:03,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:03,430 INFO L402 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-12-03 15:38:03,431 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:03,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:03,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1248978285, now seen corresponding path program 7 times [2018-12-03 15:38:03,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:03,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:03,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:38:03,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:03,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:03,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:03,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:03,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:03,586 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 15:38:03,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:03,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:03,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:38:03,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:38:03,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:03,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-12-03 15:38:03,885 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:03,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:38:03,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:38:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:38:03,886 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 17 states. [2018-12-03 15:38:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:03,922 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-03 15:38:03,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:38:03,923 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-12-03 15:38:03,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:03,924 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:38:03,924 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:38:03,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:38:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:38:03,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:38:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:38:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 15:38:03,930 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-12-03 15:38:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:03,931 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 15:38:03,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:38:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 15:38:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:38:03,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:03,932 INFO L402 BasicCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1] [2018-12-03 15:38:03,932 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:03,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -734545693, now seen corresponding path program 8 times [2018-12-03 15:38:03,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:03,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:03,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 15:38:04,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:04,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:04,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:04,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:04,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:04,088 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 15:38:04,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:04,099 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:04,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:38:04,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:04,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 15:38:04,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 15:38:04,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:04,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-12-03 15:38:04,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:04,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:38:04,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:38:04,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:38:04,464 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 19 states. [2018-12-03 15:38:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:04,532 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-12-03 15:38:04,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:38:04,534 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 15:38:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:04,535 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:38:04,535 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:38:04,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:38:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:38:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:38:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:38:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 15:38:04,544 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-12-03 15:38:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:04,545 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 15:38:04,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:38:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 15:38:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:38:04,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:04,546 INFO L402 BasicCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1] [2018-12-03 15:38:04,546 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:04,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:04,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1875765165, now seen corresponding path program 9 times [2018-12-03 15:38:04,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:04,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:04,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:38:04,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:04,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:04,951 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:04,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:04,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:04,952 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 15:38:04,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:04,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:04,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:04,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:04,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:38:05,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:38:05,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:05,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 15:38:05,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:05,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:38:05,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:38:05,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:38:05,489 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2018-12-03 15:38:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:05,557 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-03 15:38:05,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:38:05,565 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-12-03 15:38:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:05,566 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:38:05,566 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:38:05,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:38:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:38:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:38:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:38:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 15:38:05,574 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-12-03 15:38:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:05,574 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 15:38:05,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:38:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 15:38:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:38:05,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:05,576 INFO L402 BasicCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1] [2018-12-03 15:38:05,576 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:05,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:05,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1112151389, now seen corresponding path program 10 times [2018-12-03 15:38:05,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:05,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:05,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:05,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:05,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 15:38:05,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:05,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:05,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:05,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:05,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:05,833 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:05,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:05,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:05,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 15:38:06,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 15:38:06,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:06,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-12-03 15:38:06,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:06,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:38:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:38:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:38:06,414 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 23 states. [2018-12-03 15:38:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:06,469 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-03 15:38:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:38:06,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-12-03 15:38:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:06,479 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:38:06,480 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:38:06,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:38:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:38:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:38:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:38:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 15:38:06,489 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-12-03 15:38:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:06,489 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 15:38:06,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:38:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 15:38:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:38:06,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:06,490 INFO L402 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2018-12-03 15:38:06,491 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:06,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash -413354477, now seen corresponding path program 11 times [2018-12-03 15:38:06,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:06,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:06,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:38:06,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:06,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:06,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:06,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:06,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:06,748 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:06,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:06,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:06,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:38:06,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:06,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:38:06,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:38:06,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:06,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 15:38:06,900 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:06,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:38:06,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:38:06,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:38:06,901 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-12-03 15:38:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:06,978 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-03 15:38:06,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:38:06,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-03 15:38:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:06,979 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:38:06,979 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:38:06,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:38:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:38:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-12-03 15:38:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:38:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-03 15:38:06,990 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2018-12-03 15:38:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:06,990 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-03 15:38:06,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:38:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-03 15:38:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:38:06,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:06,992 INFO L402 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-12-03 15:38:06,992 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:06,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:06,992 INFO L82 PathProgramCache]: Analyzing trace with hash -836205413, now seen corresponding path program 12 times [2018-12-03 15:38:06,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:06,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:06,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:06,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:06,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 15:38:07,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:07,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:07,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:07,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:07,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:07,106 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:07,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:07,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:07,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:07,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:07,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 15:38:07,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 15:38:07,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:07,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2018-12-03 15:38:07,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:07,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:38:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:38:07,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:38:07,324 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-12-03 15:38:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:07,379 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-12-03 15:38:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:38:07,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-03 15:38:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:07,381 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:38:07,381 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:38:07,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:38:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:38:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-12-03 15:38:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:38:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-12-03 15:38:07,394 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-12-03 15:38:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:07,394 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-12-03 15:38:07,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:38:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-12-03 15:38:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:38:07,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:07,396 INFO L402 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-12-03 15:38:07,397 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:07,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash 21677859, now seen corresponding path program 13 times [2018-12-03 15:38:07,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:07,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:07,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 15:38:07,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:07,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:07,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:07,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:07,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:07,554 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:07,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:07,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:07,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 15:38:07,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 15:38:07,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:07,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2018-12-03 15:38:07,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:07,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:38:07,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:38:07,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:38:07,806 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-12-03 15:38:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:07,945 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-12-03 15:38:07,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:38:07,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-12-03 15:38:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:07,947 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:38:07,947 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:38:07,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:38:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:38:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-12-03 15:38:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:38:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-12-03 15:38:07,964 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-12-03 15:38:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:07,965 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-12-03 15:38:07,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:38:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-12-03 15:38:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:38:07,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:07,966 INFO L402 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-12-03 15:38:07,967 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:07,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:07,967 INFO L82 PathProgramCache]: Analyzing trace with hash 246775211, now seen corresponding path program 14 times [2018-12-03 15:38:07,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:07,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:07,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:07,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:07,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 15:38:08,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:08,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:08,313 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:08,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:08,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:08,313 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:08,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:08,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:08,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:38:08,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:08,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 15:38:08,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 15:38:08,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:08,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2018-12-03 15:38:08,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:08,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:38:08,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:38:08,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:38:08,786 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-12-03 15:38:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:08,872 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-12-03 15:38:08,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:38:08,873 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-12-03 15:38:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:08,874 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:38:08,874 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 15:38:08,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:38:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 15:38:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-12-03 15:38:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:38:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-12-03 15:38:08,893 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-12-03 15:38:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:08,893 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-12-03 15:38:08,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:38:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-12-03 15:38:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:38:08,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:08,895 INFO L402 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-12-03 15:38:08,895 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:08,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash 693807155, now seen corresponding path program 15 times [2018-12-03 15:38:08,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:08,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:08,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 15:38:09,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:09,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:09,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:09,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:09,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:09,075 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:09,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:09,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:09,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:09,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:09,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 15:38:09,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 15:38:09,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:09,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2018-12-03 15:38:09,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:09,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:38:09,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:38:09,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:38:09,396 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-12-03 15:38:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:09,472 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-12-03 15:38:09,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:38:09,473 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-12-03 15:38:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:09,474 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:38:09,474 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:38:09,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:38:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:38:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-12-03 15:38:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:38:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-03 15:38:09,501 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-12-03 15:38:09,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:09,501 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-03 15:38:09,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:38:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-03 15:38:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:38:09,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:09,506 INFO L402 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-12-03 15:38:09,506 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:09,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1456716101, now seen corresponding path program 16 times [2018-12-03 15:38:09,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:09,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:09,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 15:38:09,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:09,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:09,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:09,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:09,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:09,788 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:09,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:09,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:09,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 15:38:10,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 15:38:10,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:10,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 15:38:10,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:10,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:38:10,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:38:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:38:10,201 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-12-03 15:38:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:10,355 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-03 15:38:10,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:38:10,356 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-12-03 15:38:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:10,357 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:38:10,358 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 15:38:10,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:38:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 15:38:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-12-03 15:38:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:38:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-03 15:38:10,393 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-12-03 15:38:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:10,394 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-03 15:38:10,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:38:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-03 15:38:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:38:10,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:10,400 INFO L402 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-12-03 15:38:10,401 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:10,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1961076413, now seen corresponding path program 17 times [2018-12-03 15:38:10,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:10,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:10,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:10,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:10,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 15:38:10,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:10,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:10,657 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:10,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:10,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:10,658 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:10,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:10,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:10,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 15:38:10,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:10,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 15:38:10,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 15:38:11,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:11,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 15:38:11,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:11,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:38:11,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:38:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:38:11,075 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-12-03 15:38:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:11,146 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-12-03 15:38:11,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:38:11,147 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-12-03 15:38:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:11,148 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:38:11,148 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 15:38:11,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 179 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:38:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 15:38:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-12-03 15:38:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:38:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-12-03 15:38:11,171 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-12-03 15:38:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:11,171 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-12-03 15:38:11,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:38:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-12-03 15:38:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:38:11,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:11,173 INFO L402 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-12-03 15:38:11,173 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:11,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash -249765941, now seen corresponding path program 18 times [2018-12-03 15:38:11,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:11,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:11,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 15:38:11,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:11,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:11,434 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:11,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:11,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:11,434 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:11,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:11,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:11,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:11,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:11,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 15:38:11,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 15:38:11,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:11,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:38:11,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:11,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:38:11,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:38:11,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:38:11,830 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-12-03 15:38:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:11,932 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-03 15:38:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:38:11,932 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-12-03 15:38:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:11,934 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:38:11,934 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:38:11,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 201 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:38:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:38:11,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-12-03 15:38:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:38:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-12-03 15:38:11,961 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-12-03 15:38:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:11,962 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-12-03 15:38:11,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:38:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-12-03 15:38:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:38:11,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:11,963 INFO L402 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-12-03 15:38:11,963 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:11,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:11,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1574970797, now seen corresponding path program 19 times [2018-12-03 15:38:11,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:11,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:11,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:11,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:11,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:38:18,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:18,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-12-03 15:38:18,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:18,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 15:38:18,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 15:38:18,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:38:18,257 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-12-03 15:38:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:20,520 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-12-03 15:38:20,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:38:20,521 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-12-03 15:38:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:20,522 INFO L225 Difference]: With dead ends: 5119 [2018-12-03 15:38:20,522 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:38:20,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:38:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:38:20,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:38:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:38:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:38:20,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-12-03 15:38:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:20,534 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:38:20,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 15:38:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:38:20,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:38:20,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:38:25,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:25,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:25,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:25,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:25,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:25,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:25,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:25,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:26,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:27,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:27,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:27,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:27,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:27,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:27,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:27,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:28,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:28,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:28,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:28,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:28,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:28,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:28,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:29,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:30,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:30,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:30,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:30,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:30,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:30,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:30,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:31,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:31,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:31,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:31,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:31,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:31,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:31,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:32,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:32,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:32,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:32,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:32,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:32,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:33,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:33,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:33,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:33,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:34,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:34,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:34,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:34,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:34,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:34,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:34,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:35,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:35,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:36,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:36,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:36,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:36,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:36,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:36,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:38,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:39,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:41,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:41,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:41,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:42,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:42,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:42,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:42,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:42,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:43,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:44,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:45,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:45,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:46,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:46,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:46,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:47,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:48,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:48,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:48,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:49,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:50,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:50,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:50,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:50,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:50,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:51,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:51,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:52,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:52,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:52,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:52,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:52,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:52,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:54,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:54,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:54,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:55,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:55,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:58,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:58,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:59,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:59,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:00,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:01,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:02,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:02,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:02,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:02,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:05,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:05,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:05,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:05,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:05,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:06,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:07,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:08,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:09,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:09,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:11,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:11,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:12,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:12,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:14,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:14,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:14,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:21,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:21,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:23,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:24,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:25,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:26,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:26,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:27,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:27,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:32,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:32,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:32,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:32,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:34,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:37,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:39,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:40,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:40,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:41,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:43,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:43,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:46,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:54,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:40:03,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:40:17,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:40:21,905 WARN L180 SmtUtils]: Spent 2.02 m on a formula simplification. DAG size of input: 5095 DAG size of output: 2493 [2018-12-03 15:40:22,839 WARN L180 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-12-03 15:42:28,659 WARN L180 SmtUtils]: Spent 2.10 m on a formula simplification. DAG size of input: 2493 DAG size of output: 362 [2018-12-03 15:42:35,124 WARN L180 SmtUtils]: Spent 6.46 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-12-03 15:42:35,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-12-03 15:42:35,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-12-03 15:42:35,127 INFO L444 ceAbstractionStarter]: At program point L61(lines 31 61) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-12-03 15:42:35,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-12-03 15:42:35,127 INFO L444 ceAbstractionStarter]: At program point L44(lines 44 49) the Hoare annotation is: false [2018-12-03 15:42:35,129 INFO L444 ceAbstractionStarter]: At program point L70(lines 48 70) the Hoare annotation is: (let ((.cse38 (<= ULTIMATE.start_main_~j~5 2)) (.cse31 (<= ULTIMATE.start_main_~j~5 6)) (.cse13 (<= ULTIMATE.start_main_~j~5 5)) (.cse17 (<= ULTIMATE.start_main_~j~5 7)) (.cse6 (<= ULTIMATE.start_main_~j~5 9)) (.cse39 (<= ULTIMATE.start_main_~j~5 0)) (.cse7 (<= ULTIMATE.start_main_~j~5 3)) (.cse37 (<= ULTIMATE.start_main_~j~5 1)) (.cse29 (<= ULTIMATE.start_main_~j~5 4)) (.cse36 (<= ULTIMATE.start_main_~j~5 8)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5))) (let ((.cse22 (<= 40 ULTIMATE.start_main_~k~5)) (.cse26 (<= 60 ULTIMATE.start_main_~k~5)) (.cse27 (<= 90 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse23 (<= 70 ULTIMATE.start_main_~k~5)) (.cse12 (and .cse36 .cse4)) (.cse32 (<= 50 ULTIMATE.start_main_~k~5)) (.cse28 (and .cse29 .cse4)) (.cse21 (and .cse37 .cse4)) (.cse25 (<= 80 ULTIMATE.start_main_~k~5)) (.cse18 (<= ULTIMATE.start_main_~i~5 7)) (.cse2 (<= ULTIMATE.start_main_~i~5 4)) (.cse10 (and .cse7 .cse4)) (.cse24 (and .cse4 .cse39)) (.cse35 (<= 30 ULTIMATE.start_main_~k~5)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse16 (and .cse4 .cse6)) (.cse11 (<= ULTIMATE.start_main_~i~5 8)) (.cse14 (and .cse17 .cse4)) (.cse9 (<= ULTIMATE.start_main_~i~5 3)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse8 (<= ULTIMATE.start_main_~i~5 0)) (.cse30 (<= ULTIMATE.start_main_~i~5 2)) (.cse1 (and .cse13 .cse4)) (.cse15 (<= ULTIMATE.start_main_~i~5 6)) (.cse20 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse33 (and .cse31 .cse4)) (.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse19 (<= ULTIMATE.start_main_~i~5 5)) (.cse34 (and .cse4 .cse38))) (or (and .cse0 (<= 45 ULTIMATE.start_main_~k~5) .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse6) (and .cse0 (<= 3 ULTIMATE.start_main_~k~5) .cse7 .cse4 .cse8) (and .cse0 .cse9 .cse10 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 (<= 88 ULTIMATE.start_main_~k~5) .cse12) (and .cse0 .cse13 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse14 .cse15 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 .cse10 (<= 83 ULTIMATE.start_main_~k~5)) (and .cse0 .cse16 .cse9 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 7 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse8) (and .cse0 .cse1 .cse18 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 57 ULTIMATE.start_main_~k~5) .cse14) (and (and .cse20 .cse21) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse0 .cse22 .cse9 .cse4) (and .cse0 .cse4 .cse6 (<= 9 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse23 .cse15 .cse4) (and .cse0 .cse11 .cse24 .cse25) (and .cse0 (<= 61 ULTIMATE.start_main_~k~5) .cse21 .cse15) (and .cse0 .cse17 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and (and .cse20 .cse4) (<= 100 ULTIMATE.start_main_~k~5)) (and .cse0 .cse26 .cse24 .cse15) (and .cse0 .cse22 .cse24 .cse2) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse20 .cse12)) (and .cse0 .cse11 .cse27 .cse4) (and .cse0 (<= 78 ULTIMATE.start_main_~k~5) .cse12 .cse18) (and .cse0 .cse10 (<= 73 ULTIMATE.start_main_~k~5) .cse18) (and .cse0 (<= 34 ULTIMATE.start_main_~k~5) .cse9 .cse28) (and .cse0 .cse19 .cse26 .cse4) (and .cse0 (<= 38 ULTIMATE.start_main_~k~5) .cse9 .cse12) (and .cse0 (<= 77 ULTIMATE.start_main_~k~5) .cse14 .cse18) (and .cse0 .cse29 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 (<= 29 ULTIMATE.start_main_~k~5) .cse30 .cse4 .cse6) (and .cse0 .cse31 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse8) (and (and .cse20 .cse10) (<= 93 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 71 ULTIMATE.start_main_~k~5) .cse21 .cse18) (and .cse27 (and .cse20 .cse24)) (and .cse0 .cse16 (<= 69 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse32 .cse4 .cse2) (and .cse0 .cse9 .cse1 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 .cse28 (<= 54 ULTIMATE.start_main_~k~5) .cse19) (and .cse0 (<= 56 ULTIMATE.start_main_~k~5) .cse19 .cse33) (and (<= 92 ULTIMATE.start_main_~k~5) (and .cse20 .cse34)) (and .cse0 (<= 76 ULTIMATE.start_main_~k~5) .cse33 .cse18) (and .cse0 .cse2 .cse16 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse0 .cse14 (<= 47 ULTIMATE.start_main_~k~5) .cse2) (and (<= 99 ULTIMATE.start_main_~k~5) (and .cse20 .cse16)) (and .cse0 .cse30 .cse4 .cse35) (and .cse0 .cse31 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse12 .cse15 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 18 ULTIMATE.start_main_~k~5) .cse36 .cse4 .cse5) (and .cse0 .cse34 .cse15 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 1 ULTIMATE.start_main_~k~5) .cse37 .cse4 .cse8) (and .cse0 (<= 41 ULTIMATE.start_main_~k~5) .cse21 .cse2) (and .cse0 (<= 72 ULTIMATE.start_main_~k~5) .cse34 .cse18) (and .cse0 (<= 11 ULTIMATE.start_main_~k~5) .cse37 .cse4 .cse5) (and .cse0 .cse29 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse38) (and .cse0 .cse3 .cse30 .cse4 .cse39) (and .cse0 .cse10 .cse15 (<= 63 ULTIMATE.start_main_~k~5)) (and (<= 74 ULTIMATE.start_main_~k~5) .cse0 .cse28 .cse18) (and .cse0 (<= 64 ULTIMATE.start_main_~k~5) .cse28 .cse15) (and .cse0 .cse11 (<= 82 ULTIMATE.start_main_~k~5) .cse34) (and .cse0 .cse19 (<= 51 ULTIMATE.start_main_~k~5) .cse21) (and .cse0 .cse36 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse14 .cse9 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse0 .cse33 (<= 66 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse23 .cse24 .cse18) (and .cse0 .cse33 .cse9 (<= 36 ULTIMATE.start_main_~k~5)) (and .cse0 .cse34 (<= 42 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse19 .cse12 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 55 ULTIMATE.start_main_~k~5) .cse1) (and (and .cse20 .cse1) (<= 95 ULTIMATE.start_main_~k~5)) (and .cse0 .cse28 .cse2 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 48 ULTIMATE.start_main_~k~5) .cse2 .cse12) (and .cse0 .cse11 (<= 84 ULTIMATE.start_main_~k~5) .cse28) (and .cse0 .cse11 .cse33 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse31 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse30 (<= 27 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse30 (<= 28 ULTIMATE.start_main_~k~5) .cse36 .cse4) (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse39 .cse8) (and .cse0 .cse32 .cse19 .cse24) (and .cse0 .cse11 (<= 89 ULTIMATE.start_main_~k~5) .cse16) (and (and .cse20 .cse14) (<= 97 ULTIMATE.start_main_~k~5)) (and .cse0 .cse29 .cse30 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse16 (<= 79 ULTIMATE.start_main_~k~5) .cse18) (and (and .cse20 .cse28) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse38 .cse8) (and .cse0 .cse10 (<= 43 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse11 .cse1 (<= 85 ULTIMATE.start_main_~k~5)) (and .cse0 .cse9 .cse21 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse7 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse11 (<= 81 ULTIMATE.start_main_~k~5) .cse21) (and .cse0 .cse30 (<= 25 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse0 .cse4 .cse25 .cse18) (and .cse0 (<= 46 ULTIMATE.start_main_~k~5) .cse33 .cse2) (and .cse0 (<= 53 ULTIMATE.start_main_~k~5) .cse19 .cse10) (and .cse0 .cse24 .cse9 .cse35) (and .cse0 .cse13 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse7 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse40 .cse4 .cse39 .cse5) (and .cse0 .cse19 .cse16 (<= 59 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 .cse14 (<= 87 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse4 .cse38 (<= 22 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 32 ULTIMATE.start_main_~k~5) .cse9 .cse34) (and .cse0 .cse40 .cse4 .cse8) (and .cse0 .cse30 (<= 21 ULTIMATE.start_main_~k~5) .cse37 .cse4) (and .cse0 (<= 65 ULTIMATE.start_main_~k~5) .cse1 .cse15) (and (and .cse20 .cse33) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 .cse34 (<= 52 ULTIMATE.start_main_~k~5))))) [2018-12-03 15:42:35,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2018-12-03 15:42:35,162 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:42:35 BoogieIcfgContainer [2018-12-03 15:42:35,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:42:35,163 INFO L168 Benchmark]: Toolchain (without parser) took 276649.67 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -204.0 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-12-03 15:42:35,164 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:42:35,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:42:35,165 INFO L168 Benchmark]: Boogie Preprocessor took 24.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:42:35,165 INFO L168 Benchmark]: RCFGBuilder took 262.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:42:35,166 INFO L168 Benchmark]: TraceAbstraction took 276315.39 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -225.1 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-12-03 15:42:35,169 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 262.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 276315.39 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -225.1 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 4) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 3 && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 3 && 10 <= main_~m~5) && 83 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 3) && 39 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && main_~i~5 <= 6) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5) && 100 <= main_~k~5)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 4)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 78 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 73 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 34 <= main_~k~5) && main_~i~5 <= 3) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 60 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 38 <= main_~k~5) && main_~i~5 <= 3) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 93 <= main_~k~5)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 69 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 5 && 10 <= main_~m~5) && 35 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 54 <= main_~k~5) && main_~i~5 <= 5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || (92 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 76 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 4) && 10 <= main_~m~5 && main_~j~5 <= 9) && 49 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 47 <= main_~k~5) && main_~i~5 <= 4)) || (99 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 41 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 6) && 63 <= main_~k~5)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 64 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 82 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 3) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 3) && 36 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 42 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 55 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 4) && 44 <= main_~k~5)) || (((10 <= main_~n~5 && 48 <= main_~k~5) && main_~i~5 <= 4) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 6 && 10 <= main_~m~5) && 86 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 6) && 26 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 28 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 2) && 24 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 79 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 43 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 5 && 10 <= main_~m~5) && 85 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1 && 10 <= main_~m~5) && 31 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 3) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 9) && 59 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 7 && 10 <= main_~m~5) && 87 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 2) && 22 <= main_~k~5)) || (((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 65 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 276.2s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 254.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 400 SDslu, 431 SDs, 0 SdLazy, 658 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1625 GetRequests, 1178 SyntacticMatches, 61 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2985 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5119 NumberOfFragments, 1940 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2338881 FormulaSimplificationTreeSizeReduction, 122.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 391585 FormulaSimplificationTreeSizeReductionInter, 132.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 2201 ConstructedInterpolants, 0 QuantifiedInterpolants, 791047 SizeOfPredicates, 36 NumberOfNonLiveVariables, 3435 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 57 InterpolantComputations, 3 PerfectInterpolantSequences, 14938/59577 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...