java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:41:13,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:41:13,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:41:13,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:41:13,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:41:13,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:41:13,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:41:13,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:41:13,342 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:41:13,343 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:41:13,343 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:41:13,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:41:13,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:41:13,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:41:13,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:41:13,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:41:13,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:41:13,357 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:41:13,362 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:41:13,363 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:41:13,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:41:13,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:41:13,372 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:41:13,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:41:13,373 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:41:13,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:41:13,377 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:41:13,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:41:13,379 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:41:13,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:41:13,381 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:41:13,382 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:41:13,382 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:41:13,382 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:41:13,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:41:13,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:41:13,386 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:41:13,402 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:41:13,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:41:13,403 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:41:13,403 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:41:13,404 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:41:13,404 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:41:13,404 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:41:13,404 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:41:13,405 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:41:13,405 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:41:13,405 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:41:13,405 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:41:13,405 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:41:13,406 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:41:13,406 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:41:13,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:41:13,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:41:13,407 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:41:13,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:41:13,407 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:41:13,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:41:13,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:41:13,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:41:13,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:41:13,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:41:13,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:41:13,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:41:13,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:41:13,409 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:41:13,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:41:13,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:41:13,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:41:13,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:41:13,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:41:13,410 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:41:13,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:41:13,411 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:41:13,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:41:13,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:41:13,411 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:41:13,412 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:41:13,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:41:13,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:41:13,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:41:13,463 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:41:13,463 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:41:13,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl [2018-12-03 16:41:13,464 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl' [2018-12-03 16:41:13,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:41:13,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:41:13,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:13,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:41:13,516 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:41:13,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:13,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:41:13,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:41:13,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:41:13,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:41:13,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:41:13,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:41:13,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:41:13,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (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 16:41:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:41:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:41:13,871 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:41:13,872 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 16:41:13,872 INFO L202 PluginConnector]: Adding new model nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:41:13 BoogieIcfgContainer [2018-12-03 16:41:13,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:41:13,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:41:13,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:41:13,877 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:41:13,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/2) ... [2018-12-03 16:41:13,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d6f788 and model type nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:41:13, skipping insertion in model container [2018-12-03 16:41:13,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:41:13" (2/2) ... [2018-12-03 16:41:13,880 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bpl [2018-12-03 16:41:13,892 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:41:13,899 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:41:13,918 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:41:13,961 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:41:13,961 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:41:13,962 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:41:13,962 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:41:13,962 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:41:13,962 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:41:13,962 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:41:13,963 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:41:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 16:41:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:41:13,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:13,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:41:14,003 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:14,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:41:14,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:14,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:14,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:14,466 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 16:41:14,469 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 16:41:14,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:14,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:41:14,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:14,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:14,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:14,489 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 16:41:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:14,563 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 16:41:14,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:14,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:41:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:14,574 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:41:14,574 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:41:14,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:41:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 16:41:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:41:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 16:41:14,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-03 16:41:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:14,608 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 16:41:14,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 16:41:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:41:14,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:14,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:41:14,609 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:14,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2018-12-03 16:41:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:14,702 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 16:41:14,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:14,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:41:14,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:14,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:14,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:14,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:14,705 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-12-03 16:41:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:14,745 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 16:41:14,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:14,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 16:41:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:14,746 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:41:14,746 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:41:14,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:41:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:41:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:41:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:41:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 16:41:14,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 16:41:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:14,751 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 16:41:14,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 16:41:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:41:14,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:14,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 16:41:14,752 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:14,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2018-12-03 16:41:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:14,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:14,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:14,921 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 16:41:14,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:14,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:14,922 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 16:41:14,924 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-03 16:41:14,963 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:41:14,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:41:15,197 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:41:15,198 INFO L272 AbstractInterpreter]: Visited 6 different actions 20 times. Merged at 3 different actions 7 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:41:15,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:15,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:41:15,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:15,244 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 16:41:15,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:15,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:15,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:15,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:41:15,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:15,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 16:41:15,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:15,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:41:15,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:41:15,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:41:15,610 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-12-03 16:41:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:15,763 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2018-12-03 16:41:15,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:41:15,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 16:41:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:15,765 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:41:15,765 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:41:15,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:41:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:41:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 16:41:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:41:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 16:41:15,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-12-03 16:41:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:15,772 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 16:41:15,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:41:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 16:41:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:41:15,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:15,773 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-12-03 16:41:15,773 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:15,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1701183725, now seen corresponding path program 2 times [2018-12-03 16:41:15,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:15,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:15,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:15,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:15,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:16,009 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:41:16,011 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 16:41:16,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:16,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:16,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:16,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:16,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:16,012 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 16:41:16,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:16,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:16,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:41:16,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:16,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:16,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:41:16,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:16,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 4] total 15 [2018-12-03 16:41:16,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:16,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:41:16,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:41:16,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:41:16,393 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 12 states. [2018-12-03 16:41:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:16,970 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2018-12-03 16:41:16,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:41:16,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 16:41:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:16,976 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:41:16,976 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:41:16,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:41:16,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:41:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-12-03 16:41:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:41:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-03 16:41:16,983 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 11 [2018-12-03 16:41:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:16,984 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-03 16:41:16,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:41:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-12-03 16:41:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:41:16,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:16,985 INFO L402 BasicCegarLoop]: trace histogram [9, 3, 3, 1, 1, 1] [2018-12-03 16:41:16,985 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:16,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1092129078, now seen corresponding path program 3 times [2018-12-03 16:41:16,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:16,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:16,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 16:41:17,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:17,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:17,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:17,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:17,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:17,148 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 16:41:17,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:17,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:17,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:17,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:17,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 16:41:17,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:41:17,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:17,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 5] total 17 [2018-12-03 16:41:17,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:17,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:41:17,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:41:17,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:41:17,420 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 13 states. [2018-12-03 16:41:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:17,927 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-12-03 16:41:17,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:41:17,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-12-03 16:41:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:17,929 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:41:17,929 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:41:17,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:41:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:41:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-12-03 16:41:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:41:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-03 16:41:17,937 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2018-12-03 16:41:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:17,938 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-03 16:41:17,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:41:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-03 16:41:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:41:17,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:17,939 INFO L402 BasicCegarLoop]: trace histogram [16, 4, 4, 1, 1, 1] [2018-12-03 16:41:17,940 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:17,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:17,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1971073885, now seen corresponding path program 4 times [2018-12-03 16:41:17,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:17,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:17,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:17,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:17,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-03 16:41:18,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:18,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:18,219 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:18,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:18,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:18,219 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 16:41:18,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:18,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:18,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 16:41:18,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-03 16:41:18,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:18,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 16 [2018-12-03 16:41:18,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:18,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:41:18,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:41:18,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:41:18,674 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 12 states. [2018-12-03 16:41:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:18,902 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-12-03 16:41:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:41:18,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-12-03 16:41:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:18,907 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:41:18,908 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:41:18,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:41:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:41:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-12-03 16:41:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:41:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-03 16:41:18,917 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 27 [2018-12-03 16:41:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:18,918 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-03 16:41:18,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:41:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-03 16:41:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:41:18,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:18,919 INFO L402 BasicCegarLoop]: trace histogram [20, 5, 5, 1, 1, 1] [2018-12-03 16:41:18,920 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:18,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:18,920 INFO L82 PathProgramCache]: Analyzing trace with hash 385916811, now seen corresponding path program 5 times [2018-12-03 16:41:18,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:18,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:18,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:18,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:18,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-03 16:41:19,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:19,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:19,279 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:19,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:19,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:19,279 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 16:41:19,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:19,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:19,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:41:19,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:19,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 105 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-12-03 16:41:19,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 105 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-12-03 16:41:19,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:19,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2018-12-03 16:41:19,539 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:19,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:41:19,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:41:19,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:41:19,541 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 13 states. [2018-12-03 16:41:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:21,095 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2018-12-03 16:41:21,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:41:21,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 16:41:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:21,097 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:41:21,097 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:41:21,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=383, Invalid=1873, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:41:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:41:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-12-03 16:41:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:41:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-03 16:41:21,112 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 33 [2018-12-03 16:41:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:21,113 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-03 16:41:21,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:41:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-03 16:41:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 16:41:21,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:21,114 INFO L402 BasicCegarLoop]: trace histogram [30, 6, 6, 1, 1, 1] [2018-12-03 16:41:21,115 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:21,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash -747117725, now seen corresponding path program 6 times [2018-12-03 16:41:21,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:21,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:21,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:21,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:21,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-03 16:41:21,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:21,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:21,395 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:21,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:21,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:21,395 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 16:41:21,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:21,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:21,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:21,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:21,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 186 proven. 15 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-12-03 16:41:21,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 186 proven. 15 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-12-03 16:41:21,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:21,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2018-12-03 16:41:21,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:21,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:41:21,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:41:21,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:41:21,794 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 15 states. [2018-12-03 16:41:22,225 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-03 16:41:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:23,265 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2018-12-03 16:41:23,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:41:23,266 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-12-03 16:41:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:23,267 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:41:23,267 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:41:23,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=565, Invalid=3341, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:41:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:41:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-12-03 16:41:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:41:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-12-03 16:41:23,286 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 45 [2018-12-03 16:41:23,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:23,286 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-12-03 16:41:23,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:41:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-12-03 16:41:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:41:23,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:23,290 INFO L402 BasicCegarLoop]: trace histogram [42, 7, 7, 1, 1, 1] [2018-12-03 16:41:23,291 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:23,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:23,291 INFO L82 PathProgramCache]: Analyzing trace with hash -976958341, now seen corresponding path program 7 times [2018-12-03 16:41:23,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:23,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:23,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:23,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:23,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 0 proven. 1057 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-03 16:41:23,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:23,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:23,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:23,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:23,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:23,654 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 16:41:23,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:23,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:23,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 301 proven. 21 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-12-03 16:41:23,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 301 proven. 21 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-12-03 16:41:24,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:24,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2018-12-03 16:41:24,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:24,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:41:24,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:41:24,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:41:24,086 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 17 states. [2018-12-03 16:41:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:26,020 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2018-12-03 16:41:26,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:41:26,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-12-03 16:41:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:26,022 INFO L225 Difference]: With dead ends: 135 [2018-12-03 16:41:26,022 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:41:26,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=761, Invalid=5559, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:41:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:41:26,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2018-12-03 16:41:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:41:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-12-03 16:41:26,043 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 59 [2018-12-03 16:41:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:26,043 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-12-03 16:41:26,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:41:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-12-03 16:41:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:41:26,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:26,045 INFO L402 BasicCegarLoop]: trace histogram [56, 8, 8, 1, 1, 1] [2018-12-03 16:41:26,045 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:26,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:26,045 INFO L82 PathProgramCache]: Analyzing trace with hash -95013757, now seen corresponding path program 8 times [2018-12-03 16:41:26,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:26,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:26,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:26,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:26,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 0 proven. 1828 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-03 16:41:26,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:26,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:26,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:26,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:26,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:26,650 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 16:41:26,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:26,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:27,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:41:27,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:27,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 456 proven. 28 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-12-03 16:41:27,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 456 proven. 28 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-12-03 16:41:27,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:27,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2018-12-03 16:41:27,623 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:27,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:41:27,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:41:27,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:41:27,624 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 19 states. [2018-12-03 16:41:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:30,220 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2018-12-03 16:41:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:41:30,222 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-12-03 16:41:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:30,223 INFO L225 Difference]: With dead ends: 169 [2018-12-03 16:41:30,223 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:41:30,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2597 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=965, Invalid=8737, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 16:41:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:41:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2018-12-03 16:41:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:41:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-12-03 16:41:30,246 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 75 [2018-12-03 16:41:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:30,247 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-12-03 16:41:30,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:41:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-12-03 16:41:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:41:30,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:30,249 INFO L402 BasicCegarLoop]: trace histogram [72, 9, 9, 1, 1, 1] [2018-12-03 16:41:30,249 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:30,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash -972083989, now seen corresponding path program 9 times [2018-12-03 16:41:30,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:30,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:30,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:30,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:30,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 0 proven. 2961 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-12-03 16:41:30,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:30,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:30,720 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:30,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:30,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:30,720 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 16:41:30,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:30,729 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:30,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:30,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:30,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 657 proven. 36 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2018-12-03 16:41:30,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 657 proven. 36 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2018-12-03 16:41:31,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:31,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2018-12-03 16:41:31,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:31,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:41:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:41:31,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:41:31,367 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 21 states. [2018-12-03 16:41:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:34,762 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2018-12-03 16:41:34,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 16:41:34,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-12-03 16:41:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:34,764 INFO L225 Difference]: With dead ends: 207 [2018-12-03 16:41:34,765 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 16:41:34,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4058 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1171, Invalid=13109, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:41:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 16:41:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-12-03 16:41:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:41:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-12-03 16:41:34,793 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 93 [2018-12-03 16:41:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:34,793 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-12-03 16:41:34,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:41:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-12-03 16:41:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:41:34,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:34,795 INFO L402 BasicCegarLoop]: trace histogram [90, 10, 10, 1, 1, 1] [2018-12-03 16:41:34,795 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:34,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash -86765277, now seen corresponding path program 10 times [2018-12-03 16:41:34,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:34,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:34,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:34,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:34,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5005 backedges. 0 proven. 4555 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-12-03 16:41:35,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:35,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:35,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:35,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:35,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:35,168 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 16:41:35,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:35,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:35,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5005 backedges. 910 proven. 45 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-12-03 16:41:35,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5005 backedges. 910 proven. 45 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-12-03 16:41:35,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:35,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2018-12-03 16:41:35,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:35,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:41:35,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:41:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:41:35,767 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 23 states. [2018-12-03 16:41:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:39,889 INFO L93 Difference]: Finished difference Result 249 states and 283 transitions. [2018-12-03 16:41:39,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-12-03 16:41:39,890 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 113 [2018-12-03 16:41:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:39,891 INFO L225 Difference]: With dead ends: 249 [2018-12-03 16:41:39,892 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 16:41:39,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6060 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1373, Invalid=18933, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 16:41:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 16:41:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-12-03 16:41:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:41:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-12-03 16:41:39,924 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 113 [2018-12-03 16:41:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:39,925 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-12-03 16:41:39,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:41:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-12-03 16:41:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 16:41:39,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:39,928 INFO L402 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-12-03 16:41:39,928 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:39,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1978185509, now seen corresponding path program 11 times [2018-12-03 16:41:39,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:39,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:39,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:39,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:39,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 16:41:40,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:40,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:40,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:40,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:40,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:40,358 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 16:41:40,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:40,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:35,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-12-03 16:44:35,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:35,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6775 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-03 16:44:37,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 18 proven. 6480 refuted. 277 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-03 16:45:47,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:47,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 23] total 45 [2018-12-03 16:45:47,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:47,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:45:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:45:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=1435, Unknown=22, NotChecked=0, Total=2070 [2018-12-03 16:45:47,507 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 24 states. [2018-12-03 16:45:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:48,056 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-12-03 16:45:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:45:48,057 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2018-12-03 16:45:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:48,058 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:45:48,058 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 16:45:48,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 71.7s TimeCoverageRelationStatistics Valid=613, Invalid=1435, Unknown=22, NotChecked=0, Total=2070 [2018-12-03 16:45:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 16:45:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-12-03 16:45:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 16:45:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-12-03 16:45:48,091 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-12-03 16:45:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:48,091 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-12-03 16:45:48,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:45:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-12-03 16:45:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 16:45:48,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:48,093 INFO L402 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-12-03 16:45:48,094 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:48,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash 972368739, now seen corresponding path program 12 times [2018-12-03 16:45:48,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:48,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:48,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:48,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:48,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 16:45:49,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:49,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:49,220 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:49,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:49,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:49,221 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 16:45:49,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:45:49,230 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:45:49,313 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:45:49,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:49,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 16:45:49,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 16:45:49,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:49,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 16:45:49,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:49,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:45:49,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:45:49,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:45:49,871 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 16 states. [2018-12-03 16:45:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:50,241 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-12-03 16:45:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:45:50,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 147 [2018-12-03 16:45:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:50,243 INFO L225 Difference]: With dead ends: 173 [2018-12-03 16:45:50,244 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 16:45:50,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:45:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 16:45:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-12-03 16:45:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:45:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-12-03 16:45:50,268 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-12-03 16:45:50,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:50,269 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-12-03 16:45:50,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:45:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-12-03 16:45:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 16:45:50,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:50,271 INFO L402 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-12-03 16:45:50,271 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:50,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1739293163, now seen corresponding path program 13 times [2018-12-03 16:45:50,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:50,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:50,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:50,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:50,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 16:45:52,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:52,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:52,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:52,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:52,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:52,022 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 16:45:52,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:52,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:45:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:52,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 16:45:52,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 16:45:52,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:52,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 16:45:52,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:52,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:45:52,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:45:52,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:45:52,936 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 17 states. [2018-12-03 16:45:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:53,442 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-12-03 16:45:53,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:45:53,442 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2018-12-03 16:45:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:53,443 INFO L225 Difference]: With dead ends: 185 [2018-12-03 16:45:53,443 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 16:45:53,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:45:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 16:45:53,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-12-03 16:45:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 16:45:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-12-03 16:45:53,475 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-12-03 16:45:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:53,475 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-12-03 16:45:53,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:45:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-12-03 16:45:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 16:45:53,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:53,477 INFO L402 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-12-03 16:45:53,478 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:53,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:53,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1848396915, now seen corresponding path program 14 times [2018-12-03 16:45:53,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:53,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:53,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:53,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:53,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 16:45:53,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:53,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:53,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:53,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:53,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:53,884 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 16:45:53,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:45:53,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:06,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 85 check-sat command(s) [2018-12-03 16:49:06,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:07,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 16:49:07,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 16:49:08,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:08,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 16:49:08,088 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:08,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:49:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:49:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:49:08,089 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 18 states. [2018-12-03 16:49:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:08,423 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-12-03 16:49:08,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:49:08,424 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 171 [2018-12-03 16:49:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:08,425 INFO L225 Difference]: With dead ends: 197 [2018-12-03 16:49:08,425 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 16:49:08,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:49:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 16:49:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-12-03 16:49:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 16:49:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-12-03 16:49:08,457 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-12-03 16:49:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:08,458 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-12-03 16:49:08,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:49:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-12-03 16:49:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 16:49:08,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:08,460 INFO L402 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-12-03 16:49:08,460 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:08,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash -848721157, now seen corresponding path program 15 times [2018-12-03 16:49:08,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:08,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:08,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:08,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 16:49:09,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:09,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:09,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:09,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:09,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:09,719 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 16:49:09,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:09,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:09,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:09,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:09,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 16:49:09,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 16:49:10,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:10,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 16:49:10,673 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:10,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:49:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:49:10,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:49:10,674 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 19 states. [2018-12-03 16:49:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:11,083 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-12-03 16:49:11,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:49:11,083 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 183 [2018-12-03 16:49:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:11,084 INFO L225 Difference]: With dead ends: 209 [2018-12-03 16:49:11,084 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 16:49:11,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:49:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 16:49:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-12-03 16:49:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 16:49:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-12-03 16:49:11,122 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-12-03 16:49:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:11,122 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-12-03 16:49:11,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:49:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-12-03 16:49:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 16:49:11,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:11,124 INFO L402 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-12-03 16:49:11,125 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:11,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1437254269, now seen corresponding path program 16 times [2018-12-03 16:49:11,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:11,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:11,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:11,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:11,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 16:49:12,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:12,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:12,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:12,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:12,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:12,204 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 16:49:12,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:12,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:12,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 16:49:12,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 16:49:13,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:13,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 16:49:13,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:13,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:49:13,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:49:13,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:49:13,411 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 20 states. [2018-12-03 16:49:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:13,841 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-12-03 16:49:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:49:13,841 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 195 [2018-12-03 16:49:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:13,842 INFO L225 Difference]: With dead ends: 221 [2018-12-03 16:49:13,843 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 16:49:13,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:49:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 16:49:13,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-12-03 16:49:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 16:49:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-12-03 16:49:13,884 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-12-03 16:49:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:13,884 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-12-03 16:49:13,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:49:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-12-03 16:49:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 16:49:13,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:13,886 INFO L402 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-12-03 16:49:13,886 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:13,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1323394059, now seen corresponding path program 17 times [2018-12-03 16:49:13,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:13,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:13,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 16:49:14,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:14,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:14,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:14,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:14,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:14,903 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 16:49:14,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:14,913 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:12,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 98 check-sat command(s) [2018-12-03 16:55:12,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:18,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 16:55:18,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 16:55:19,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:19,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 16:55:19,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:19,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:55:19,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:55:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:55:19,314 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 21 states. [2018-12-03 16:55:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:19,820 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-12-03 16:55:19,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:55:19,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 207 [2018-12-03 16:55:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:19,822 INFO L225 Difference]: With dead ends: 233 [2018-12-03 16:55:19,822 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 16:55:19,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:55:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 16:55:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-12-03 16:55:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 16:55:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-12-03 16:55:19,862 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-12-03 16:55:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:19,862 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-12-03 16:55:19,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:55:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-12-03 16:55:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 16:55:19,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:19,863 INFO L402 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-12-03 16:55:19,864 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:19,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1442840941, now seen corresponding path program 18 times [2018-12-03 16:55:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:19,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:19,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:55:20,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:20,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:20,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:20,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:20,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:20,400 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 16:55:20,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:20,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:20,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:20,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:20,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:55:20,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:55:21,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:21,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 16:55:21,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:21,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:55:21,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:55:21,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:55:21,894 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 22 states. [2018-12-03 16:55:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:22,456 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-12-03 16:55:22,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:55:22,457 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 219 [2018-12-03 16:55:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:22,458 INFO L225 Difference]: With dead ends: 245 [2018-12-03 16:55:22,458 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 16:55:22,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 416 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:55:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 16:55:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-12-03 16:55:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-03 16:55:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-12-03 16:55:22,521 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-12-03 16:55:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:22,521 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-12-03 16:55:22,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:55:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-12-03 16:55:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-03 16:55:22,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:22,523 INFO L402 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-12-03 16:55:22,523 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:22,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash -811397861, now seen corresponding path program 19 times [2018-12-03 16:55:22,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:22,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:22,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:22,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:22,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 16:55:23,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:23,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:23,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:23,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:23,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:23,407 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:23,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:23,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:23,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 16:55:23,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 16:55:24,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:24,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 16:55:24,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:24,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:55:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:55:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:55:24,797 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 23 states. [2018-12-03 16:55:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:25,379 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-12-03 16:55:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:55:25,379 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 231 [2018-12-03 16:55:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:25,381 INFO L225 Difference]: With dead ends: 257 [2018-12-03 16:55:25,381 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 16:55:25,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:55:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 16:55:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-12-03 16:55:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-03 16:55:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-12-03 16:55:25,433 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-12-03 16:55:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:25,433 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-12-03 16:55:25,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:55:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-12-03 16:55:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-03 16:55:25,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:25,435 INFO L402 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-12-03 16:55:25,435 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:25,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2025623459, now seen corresponding path program 20 times [2018-12-03 16:55:25,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:25,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:25,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 16:55:26,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:26,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:26,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:26,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:26,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:26,794 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:26,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:26,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)