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_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 14:16:53,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 14:16:53,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 14:16:53,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 14:16:53,277 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 14:16:53,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 14:16:53,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 14:16:53,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 14:16:53,286 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 14:16:53,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 14:16:53,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 14:16:53,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 14:16:53,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 14:16:53,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 14:16:53,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 14:16:53,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 14:16:53,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 14:16:53,304 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 14:16:53,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 14:16:53,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 14:16:53,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 14:16:53,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 14:16:53,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 14:16:53,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 14:16:53,315 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 14:16:53,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 14:16:53,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 14:16:53,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 14:16:53,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 14:16:53,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 14:16:53,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 14:16:53,323 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 14:16:53,323 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 14:16:53,324 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 14:16:53,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 14:16:53,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 14:16:53,327 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-24 14:16:53,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 14:16:53,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 14:16:53,347 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 14:16:53,347 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 14:16:53,347 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 14:16:53,347 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 14:16:53,348 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 14:16:53,348 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 14:16:53,348 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 14:16:53,348 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-24 14:16:53,348 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-24 14:16:53,349 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 14:16:53,349 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 14:16:53,350 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 14:16:53,350 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 14:16:53,350 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 14:16:53,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 14:16:53,351 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 14:16:53,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 14:16:53,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 14:16:53,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 14:16:53,352 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 14:16:53,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 14:16:53,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 14:16:53,352 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 14:16:53,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 14:16:53,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 14:16:53,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 14:16:53,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 14:16:53,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 14:16:53,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:16:53,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 14:16:53,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 14:16:53,355 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 14:16:53,356 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 14:16:53,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 14:16:53,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 14:16:53,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 14:16:53,356 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 14:16:53,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 14:16:53,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 14:16:53,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 14:16:53,429 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 14:16:53,430 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 14:16:53,431 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-12-24 14:16:53,431 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-12-24 14:16:53,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 14:16:53,486 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 14:16:53,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 14:16:53,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 14:16:53,488 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 14:16:53,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/1) ... [2018-12-24 14:16:53,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/1) ... [2018-12-24 14:16:53,532 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-24 14:16:53,533 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-24 14:16:53,533 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-24 14:16:53,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 14:16:53,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 14:16:53,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 14:16:53,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 14:16:53,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/1) ... [2018-12-24 14:16:53,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/1) ... [2018-12-24 14:16:53,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/1) ... [2018-12-24 14:16:53,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/1) ... [2018-12-24 14:16:53,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/1) ... [2018-12-24 14:16:53,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/1) ... [2018-12-24 14:16:53,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/1) ... [2018-12-24 14:16:53,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 14:16:53,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 14:16:53,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 14:16:53,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 14:16:53,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (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-24 14:16:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-24 14:16:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-24 14:16:53,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-24 14:16:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-12-24 14:16:54,068 INFO L272 CfgBuilder]: Using library mode [2018-12-24 14:16:54,069 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-24 14:16:54,069 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:16:54 BoogieIcfgContainer [2018-12-24 14:16:54,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 14:16:54,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 14:16:54,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 14:16:54,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 14:16:54,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:16:53" (1/2) ... [2018-12-24 14:16:54,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ff83d3 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:16:54, skipping insertion in model container [2018-12-24 14:16:54,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:16:54" (2/2) ... [2018-12-24 14:16:54,079 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-12-24 14:16:54,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 14:16:54,098 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-24 14:16:54,114 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-24 14:16:54,151 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 14:16:54,152 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 14:16:54,152 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 14:16:54,152 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 14:16:54,153 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 14:16:54,153 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 14:16:54,153 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 14:16:54,153 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 14:16:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-12-24 14:16:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:16:54,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:54,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:16:54,179 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:16:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-12-24 14:16:54,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:54,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:54,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:54,408 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-24 14:16:54,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:16:54,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 14:16:54,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:16:54,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 14:16:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 14:16:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-24 14:16:54,433 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-12-24 14:16:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:54,581 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-12-24 14:16:54,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 14:16:54,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 14:16:54,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:54,598 INFO L225 Difference]: With dead ends: 20 [2018-12-24 14:16:54,598 INFO L226 Difference]: Without dead ends: 10 [2018-12-24 14:16:54,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-24 14:16:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-24 14:16:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-12-24 14:16:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 14:16:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-24 14:16:54,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-24 14:16:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:54,639 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-24 14:16:54,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 14:16:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-24 14:16:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 14:16:54,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:54,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 14:16:54,640 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:16:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2018-12-24 14:16:54,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:54,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:54,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:54,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:54,804 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-24 14:16:54,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:16:54,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-24 14:16:54,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:16:54,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 14:16:54,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 14:16:54,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-24 14:16:54,807 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-12-24 14:16:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:54,990 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-24 14:16:54,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:16:54,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-24 14:16:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:54,993 INFO L225 Difference]: With dead ends: 17 [2018-12-24 14:16:54,993 INFO L226 Difference]: Without dead ends: 16 [2018-12-24 14:16:54,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-24 14:16:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-24 14:16:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-12-24 14:16:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 14:16:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-24 14:16:55,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-12-24 14:16:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:55,002 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-24 14:16:55,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 14:16:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-24 14:16:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:16:55,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:55,003 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-24 14:16:55,004 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:16:55,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:55,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2018-12-24 14:16:55,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:55,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:55,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:55,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:55,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:55,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:16:55,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-24 14:16:55,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:16:55,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:16:55,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:16:55,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:16:55,059 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-12-24 14:16:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:55,073 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-24 14:16:55,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:16:55,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-24 14:16:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:55,076 INFO L225 Difference]: With dead ends: 18 [2018-12-24 14:16:55,076 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 14:16:55,077 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-24 14:16:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 14:16:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-24 14:16:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 14:16:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-24 14:16:55,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-12-24 14:16:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:55,085 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-24 14:16:55,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:16:55,085 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-24 14:16:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:16:55,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:55,086 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-12-24 14:16:55,086 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:16:55,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2018-12-24 14:16:55,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:55,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:55,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:16:55,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:55,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:55,307 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-24 14:16:55,314 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2018-12-24 14:16:55,393 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:16:55,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:18:02,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:18:02,837 INFO L272 AbstractInterpreter]: Visited 7 different actions 85 times. Merged at 6 different actions 78 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 14:18:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:02,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:18:02,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:02,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:02,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:02,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:02,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:02,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:02,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:03,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:03,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:03,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:03,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:03,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:18:03,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:03,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:18:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:18:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:18:03,466 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-12-24 14:18:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:03,870 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-24 14:18:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:18:03,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-24 14:18:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:03,871 INFO L225 Difference]: With dead ends: 20 [2018-12-24 14:18:03,871 INFO L226 Difference]: Without dead ends: 19 [2018-12-24 14:18:03,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:18:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-24 14:18:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-12-24 14:18:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 14:18:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-24 14:18:03,877 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-12-24 14:18:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:03,878 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-24 14:18:03,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:18:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-24 14:18:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-24 14:18:03,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:03,879 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-12-24 14:18:03,879 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:03,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:03,880 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2018-12-24 14:18:03,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:03,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:03,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:03,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:03,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:04,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:04,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:04,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:04,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:04,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:04,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:04,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:04,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:04,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:18:04,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:04,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:04,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:04,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:04,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:04,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:04,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:04,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:04,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 14:18:04,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:04,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:18:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:18:04,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:18:04,411 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2018-12-24 14:18:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:04,680 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-24 14:18:04,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:18:04,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-24 14:18:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:04,683 INFO L225 Difference]: With dead ends: 25 [2018-12-24 14:18:04,684 INFO L226 Difference]: Without dead ends: 24 [2018-12-24 14:18:04,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:18:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-24 14:18:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-12-24 14:18:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-24 14:18:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-24 14:18:04,689 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-12-24 14:18:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:04,690 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-24 14:18:04,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:18:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-24 14:18:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-24 14:18:04,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:04,691 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-12-24 14:18:04,691 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:04,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:04,692 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2018-12-24 14:18:04,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:04,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:04,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:04,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:04,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:04,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:04,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:04,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:04,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:04,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:04,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:04,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:04,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:05,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:05,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:05,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:05,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:05,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:05,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:05,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:05,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:05,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:05,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 14:18:05,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:05,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:18:05,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:18:05,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:18:05,745 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-12-24 14:18:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:05,957 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-24 14:18:05,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:18:05,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-12-24 14:18:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:05,971 INFO L225 Difference]: With dead ends: 30 [2018-12-24 14:18:05,971 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 14:18:05,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2018-12-24 14:18:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 14:18:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-12-24 14:18:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-24 14:18:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-24 14:18:05,981 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-12-24 14:18:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:05,982 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-24 14:18:05,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:18:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-24 14:18:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-24 14:18:05,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:05,983 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-12-24 14:18:05,983 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:05,984 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2018-12-24 14:18:05,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:05,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:05,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:05,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:06,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:06,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:06,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:06,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:06,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:06,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:06,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:06,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:06,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:06,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:06,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:06,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:06,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:06,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:06,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:06,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-24 14:18:06,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:06,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 14:18:06,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 14:18:06,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:18:06,494 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-12-24 14:18:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:06,779 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-24 14:18:06,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:18:06,782 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-12-24 14:18:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:06,783 INFO L225 Difference]: With dead ends: 35 [2018-12-24 14:18:06,783 INFO L226 Difference]: Without dead ends: 34 [2018-12-24 14:18:06,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:18:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-24 14:18:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-12-24 14:18:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 14:18:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-24 14:18:06,791 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-12-24 14:18:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:06,791 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-24 14:18:06,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 14:18:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-24 14:18:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-24 14:18:06,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:06,792 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-12-24 14:18:06,793 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:06,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2018-12-24 14:18:06,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:06,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:06,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:06,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:06,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:06,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:06,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:06,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:06,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:06,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:06,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:06,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:06,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:06,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-24 14:18:06,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:06,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:06,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:06,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:06,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:06,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:07,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:07,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:07,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-24 14:18:07,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:07,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 14:18:07,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 14:18:07,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2018-12-24 14:18:07,243 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-12-24 14:18:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:07,730 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-24 14:18:07,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:18:07,731 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-24 14:18:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:07,732 INFO L225 Difference]: With dead ends: 40 [2018-12-24 14:18:07,733 INFO L226 Difference]: Without dead ends: 39 [2018-12-24 14:18:07,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2018-12-24 14:18:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-24 14:18:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-12-24 14:18:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 14:18:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-24 14:18:07,741 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-12-24 14:18:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:07,742 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-24 14:18:07,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 14:18:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-24 14:18:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-24 14:18:07,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:07,743 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-12-24 14:18:07,743 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2018-12-24 14:18:07,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:07,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:07,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:07,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:07,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:07,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:07,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:07,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:07,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:07,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:07,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:07,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:07,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:08,018 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:08,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:08,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:08,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:08,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:08,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:08,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:08,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:08,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:08,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-24 14:18:08,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:08,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 14:18:08,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 14:18:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:18:08,389 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2018-12-24 14:18:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:08,758 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-24 14:18:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 14:18:08,758 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-12-24 14:18:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:08,759 INFO L225 Difference]: With dead ends: 45 [2018-12-24 14:18:08,759 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 14:18:08,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 14:18:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 14:18:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-12-24 14:18:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 14:18:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-24 14:18:08,768 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-12-24 14:18:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:08,768 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-24 14:18:08,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 14:18:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-24 14:18:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-24 14:18:08,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:08,770 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-12-24 14:18:08,770 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:08,770 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2018-12-24 14:18:08,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:08,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:08,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:08,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:08,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:08,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:08,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:08,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:08,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:08,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:08,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:08,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:09,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:09,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:09,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:09,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:09,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:09,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:09,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:09,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-24 14:18:09,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:09,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 14:18:09,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 14:18:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2018-12-24 14:18:09,469 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2018-12-24 14:18:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:09,817 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-24 14:18:09,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 14:18:09,818 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-12-24 14:18:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:09,819 INFO L225 Difference]: With dead ends: 50 [2018-12-24 14:18:09,820 INFO L226 Difference]: Without dead ends: 49 [2018-12-24 14:18:09,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:18:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-24 14:18:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-12-24 14:18:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-24 14:18:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-24 14:18:09,834 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-12-24 14:18:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:09,835 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-24 14:18:09,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-24 14:18:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-24 14:18:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-24 14:18:09,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:09,837 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-12-24 14:18:09,837 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2018-12-24 14:18:09,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:09,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:09,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:09,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:09,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:10,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:10,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:10,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:10,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:10,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:10,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:10,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:10,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:10,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-24 14:18:10,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:10,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:10,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:10,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:10,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:10,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:10,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:10,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:10,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-24 14:18:10,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:10,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 14:18:10,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 14:18:10,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2018-12-24 14:18:10,605 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2018-12-24 14:18:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:10,913 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-24 14:18:10,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 14:18:10,914 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-12-24 14:18:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:10,915 INFO L225 Difference]: With dead ends: 55 [2018-12-24 14:18:10,915 INFO L226 Difference]: Without dead ends: 54 [2018-12-24 14:18:10,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2018-12-24 14:18:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-24 14:18:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-12-24 14:18:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 14:18:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-24 14:18:10,926 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-12-24 14:18:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:10,927 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-24 14:18:10,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 14:18:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-24 14:18:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-24 14:18:10,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:10,928 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-12-24 14:18:10,928 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:10,929 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2018-12-24 14:18:10,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:10,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:10,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:11,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:11,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:11,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:11,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:11,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:11,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:11,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:11,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:11,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:11,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:11,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:11,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:11,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:11,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:11,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:11,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:11,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:11,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-24 14:18:11,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:11,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-24 14:18:11,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-24 14:18:11,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 14:18:11,901 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-12-24 14:18:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:12,368 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-24 14:18:12,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 14:18:12,369 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-12-24 14:18:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:12,370 INFO L225 Difference]: With dead ends: 60 [2018-12-24 14:18:12,371 INFO L226 Difference]: Without dead ends: 59 [2018-12-24 14:18:12,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 14:18:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-24 14:18:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-12-24 14:18:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-24 14:18:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-24 14:18:12,381 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-12-24 14:18:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:12,381 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-24 14:18:12,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-24 14:18:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-24 14:18:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-24 14:18:12,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:12,383 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-12-24 14:18:12,383 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:12,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2018-12-24 14:18:12,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:12,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:12,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:12,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:12,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:13,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:13,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:13,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:13,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:13,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:13,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:14,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:14,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:14,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:14,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:14,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:14,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:14,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:14,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:14,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:14,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-24 14:18:14,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:14,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-24 14:18:14,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-24 14:18:14,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:18:14,606 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2018-12-24 14:18:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:14,970 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-24 14:18:14,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 14:18:14,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-12-24 14:18:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:14,972 INFO L225 Difference]: With dead ends: 65 [2018-12-24 14:18:14,972 INFO L226 Difference]: Without dead ends: 64 [2018-12-24 14:18:14,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:18:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-24 14:18:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-12-24 14:18:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 14:18:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-24 14:18:14,985 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-12-24 14:18:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:14,986 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-24 14:18:14,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-24 14:18:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-24 14:18:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 14:18:14,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:14,987 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-12-24 14:18:14,987 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:14,988 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2018-12-24 14:18:14,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:14,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:14,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:15,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:15,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:15,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:15,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:15,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:15,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:15,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:15,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:15,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-24 14:18:15,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:15,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:15,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:15,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:15,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:15,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:15,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:15,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:15,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-24 14:18:15,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:15,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 14:18:15,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 14:18:15,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 14:18:15,947 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-12-24 14:18:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:16,467 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-24 14:18:16,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-24 14:18:16,467 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-12-24 14:18:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:16,468 INFO L225 Difference]: With dead ends: 70 [2018-12-24 14:18:16,469 INFO L226 Difference]: Without dead ends: 69 [2018-12-24 14:18:16,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 14:18:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-24 14:18:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-12-24 14:18:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-24 14:18:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-24 14:18:16,482 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-12-24 14:18:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:16,483 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-24 14:18:16,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 14:18:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-24 14:18:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-24 14:18:16,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:16,484 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-12-24 14:18:16,484 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2018-12-24 14:18:16,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:16,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:16,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:17,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:17,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:17,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:17,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:17,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:17,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:17,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:17,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:17,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:17,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:17,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:17,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:17,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:17,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:17,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:17,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:17,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:17,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-24 14:18:17,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:17,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-24 14:18:17,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-24 14:18:17,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 14:18:17,817 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2018-12-24 14:18:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:18,455 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-24 14:18:18,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 14:18:18,456 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-12-24 14:18:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:18,457 INFO L225 Difference]: With dead ends: 75 [2018-12-24 14:18:18,457 INFO L226 Difference]: Without dead ends: 74 [2018-12-24 14:18:18,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 14:18:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-24 14:18:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-12-24 14:18:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 14:18:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-24 14:18:18,472 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-12-24 14:18:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:18,472 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-24 14:18:18,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-24 14:18:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-24 14:18:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-24 14:18:18,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:18,474 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-12-24 14:18:18,474 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2018-12-24 14:18:18,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:18,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:18,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:18,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:18,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:18,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:18,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:18,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:18,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:18,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:18,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:18,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:18,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:18,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:18,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:18,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:18,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:18,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:19,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:19,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:19,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-24 14:18:19,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:19,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-24 14:18:19,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-24 14:18:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 14:18:19,695 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2018-12-24 14:18:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:20,260 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-24 14:18:20,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-24 14:18:20,261 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2018-12-24 14:18:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:20,262 INFO L225 Difference]: With dead ends: 80 [2018-12-24 14:18:20,262 INFO L226 Difference]: Without dead ends: 79 [2018-12-24 14:18:20,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:18:20,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-24 14:18:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-12-24 14:18:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-24 14:18:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-24 14:18:20,276 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-12-24 14:18:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:20,276 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-24 14:18:20,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-24 14:18:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-24 14:18:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-24 14:18:20,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:20,278 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-12-24 14:18:20,278 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2018-12-24 14:18:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:20,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:20,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:20,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:20,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:20,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:20,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:20,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:20,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:20,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:20,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:20,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-24 14:18:20,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:20,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:20,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:20,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:20,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:20,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:21,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:21,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:21,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-24 14:18:21,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:21,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 14:18:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 14:18:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:18:21,548 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2018-12-24 14:18:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:22,160 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-24 14:18:22,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 14:18:22,162 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-12-24 14:18:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:22,163 INFO L225 Difference]: With dead ends: 85 [2018-12-24 14:18:22,163 INFO L226 Difference]: Without dead ends: 84 [2018-12-24 14:18:22,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2018-12-24 14:18:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-24 14:18:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-12-24 14:18:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-24 14:18:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-24 14:18:22,182 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-12-24 14:18:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:22,183 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-24 14:18:22,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 14:18:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-24 14:18:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-24 14:18:22,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:22,184 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-12-24 14:18:22,185 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2018-12-24 14:18:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:22,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:22,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:22,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:22,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:22,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:22,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:22,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:22,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:22,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:22,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:22,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:22,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:22,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:22,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:22,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:22,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:22,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:24,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:24,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:24,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-24 14:18:24,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:24,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-24 14:18:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-24 14:18:24,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 14:18:24,903 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2018-12-24 14:18:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:25,479 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-24 14:18:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 14:18:25,479 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-12-24 14:18:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:25,480 INFO L225 Difference]: With dead ends: 90 [2018-12-24 14:18:25,480 INFO L226 Difference]: Without dead ends: 89 [2018-12-24 14:18:25,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 14:18:25,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-24 14:18:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-12-24 14:18:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-24 14:18:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-24 14:18:25,495 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-12-24 14:18:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:25,496 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-24 14:18:25,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-24 14:18:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-24 14:18:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-24 14:18:25,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:25,497 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-12-24 14:18:25,497 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2018-12-24 14:18:25,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:25,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:25,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:25,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:25,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:25,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:25,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:25,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:25,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:25,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:25,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:25,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:25,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:25,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:25,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:25,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:25,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:25,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:26,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:26,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:26,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-24 14:18:26,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:26,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-24 14:18:26,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-24 14:18:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 14:18:26,771 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2018-12-24 14:18:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:27,354 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-24 14:18:27,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 14:18:27,355 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2018-12-24 14:18:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:27,356 INFO L225 Difference]: With dead ends: 95 [2018-12-24 14:18:27,356 INFO L226 Difference]: Without dead ends: 94 [2018-12-24 14:18:27,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:18:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-24 14:18:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-12-24 14:18:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-24 14:18:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-24 14:18:27,372 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-12-24 14:18:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:27,372 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-24 14:18:27,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-24 14:18:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-24 14:18:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-24 14:18:27,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:27,373 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-12-24 14:18:27,373 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:27,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:27,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2018-12-24 14:18:27,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:27,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:27,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:27,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:27,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:27,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:27,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:27,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:27,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:27,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:27,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:27,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:27,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:27,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-24 14:18:27,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:27,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:27,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:27,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:27,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:27,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:28,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:29,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:29,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-24 14:18:29,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:29,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 14:18:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 14:18:29,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 14:18:29,076 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2018-12-24 14:18:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:29,711 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-24 14:18:29,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-24 14:18:29,712 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-12-24 14:18:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:29,712 INFO L225 Difference]: With dead ends: 100 [2018-12-24 14:18:29,712 INFO L226 Difference]: Without dead ends: 99 [2018-12-24 14:18:29,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 14:18:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-24 14:18:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-12-24 14:18:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-24 14:18:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-24 14:18:29,725 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-12-24 14:18:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:29,725 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-24 14:18:29,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 14:18:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-24 14:18:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-24 14:18:29,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:29,726 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-12-24 14:18:29,727 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2018-12-24 14:18:29,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:29,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:29,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:29,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:29,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:30,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:30,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:30,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:30,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:30,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:30,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:30,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:30,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:30,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:30,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:30,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:30,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:30,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:30,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:30,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:30,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:31,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:31,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-24 14:18:31,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:31,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-24 14:18:31,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-24 14:18:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:18:31,149 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2018-12-24 14:18:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:31,819 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-24 14:18:31,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 14:18:31,820 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-12-24 14:18:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:31,821 INFO L225 Difference]: With dead ends: 105 [2018-12-24 14:18:31,821 INFO L226 Difference]: Without dead ends: 104 [2018-12-24 14:18:31,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 14:18:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-24 14:18:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-12-24 14:18:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-24 14:18:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-24 14:18:31,833 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-12-24 14:18:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:31,834 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-24 14:18:31,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-24 14:18:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-24 14:18:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-24 14:18:31,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:31,834 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-12-24 14:18:31,834 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:31,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2018-12-24 14:18:31,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:31,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:31,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:31,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:31,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:32,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:32,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:32,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:32,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:32,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:32,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:32,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:32,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:32,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:32,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:32,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:32,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:32,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:33,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:33,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-24 14:18:33,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:33,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-24 14:18:33,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-24 14:18:33,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2018-12-24 14:18:33,878 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2018-12-24 14:18:34,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:34,636 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-24 14:18:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-24 14:18:34,638 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2018-12-24 14:18:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:34,639 INFO L225 Difference]: With dead ends: 110 [2018-12-24 14:18:34,639 INFO L226 Difference]: Without dead ends: 109 [2018-12-24 14:18:34,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:18:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-24 14:18:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-12-24 14:18:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-24 14:18:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-24 14:18:34,653 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-12-24 14:18:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:34,654 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-24 14:18:34,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-24 14:18:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-24 14:18:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-24 14:18:34,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:34,655 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-12-24 14:18:34,655 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2018-12-24 14:18:34,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:34,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:34,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:35,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:35,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:35,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:35,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:35,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:35,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-24 14:18:35,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:35,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:35,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-24 14:18:35,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:35,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:35,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:35,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:35,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:35,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:35,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:36,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:36,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-24 14:18:36,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:36,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 14:18:36,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 14:18:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 14:18:36,722 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2018-12-24 14:18:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:37,527 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-24 14:18:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 14:18:37,527 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2018-12-24 14:18:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:37,528 INFO L225 Difference]: With dead ends: 115 [2018-12-24 14:18:37,528 INFO L226 Difference]: Without dead ends: 114 [2018-12-24 14:18:37,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2018-12-24 14:18:37,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-24 14:18:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-12-24 14:18:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-24 14:18:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-24 14:18:37,545 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-12-24 14:18:37,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:37,545 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-24 14:18:37,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 14:18:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-24 14:18:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-24 14:18:37,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:37,546 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-12-24 14:18:37,546 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:37,547 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2018-12-24 14:18:37,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:37,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:37,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:37,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:37,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:37,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:37,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:37,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:37,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:37,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:37,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:38,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:38,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:38,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:38,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:38,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:38,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:38,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:38,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:39,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:39,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-24 14:18:39,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:39,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-24 14:18:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-24 14:18:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 14:18:39,537 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2018-12-24 14:18:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:40,466 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-12-24 14:18:40,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 14:18:40,467 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2018-12-24 14:18:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:40,468 INFO L225 Difference]: With dead ends: 120 [2018-12-24 14:18:40,468 INFO L226 Difference]: Without dead ends: 119 [2018-12-24 14:18:40,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 14:18:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-24 14:18:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-12-24 14:18:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-24 14:18:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-24 14:18:40,491 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-12-24 14:18:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:40,492 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-24 14:18:40,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-24 14:18:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-24 14:18:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-24 14:18:40,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:40,493 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-12-24 14:18:40,493 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2018-12-24 14:18:40,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:40,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:40,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:40,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:40,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:41,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:41,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:41,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:41,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:41,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:41,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:41,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:41,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:41,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:41,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:41,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:41,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:41,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:42,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:43,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:43,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-24 14:18:43,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:43,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-24 14:18:43,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-24 14:18:43,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:18:43,056 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2018-12-24 14:18:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:44,363 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-12-24 14:18:44,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 14:18:44,364 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2018-12-24 14:18:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:44,365 INFO L225 Difference]: With dead ends: 125 [2018-12-24 14:18:44,365 INFO L226 Difference]: Without dead ends: 124 [2018-12-24 14:18:44,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:18:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-24 14:18:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-12-24 14:18:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-24 14:18:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-12-24 14:18:44,382 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-12-24 14:18:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:44,382 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-12-24 14:18:44,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-24 14:18:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-12-24 14:18:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-24 14:18:44,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:44,383 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-12-24 14:18:44,383 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:44,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:44,383 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2018-12-24 14:18:44,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:44,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:44,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:44,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:44,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:46,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:46,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:46,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:46,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:46,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:46,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:46,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:46,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:46,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-24 14:18:46,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:46,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:46,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:46,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:46,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:46,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:46,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:47,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:47,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-24 14:18:47,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:47,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 14:18:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 14:18:47,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2018-12-24 14:18:47,633 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2018-12-24 14:18:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:48,607 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-12-24 14:18:48,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-24 14:18:48,608 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2018-12-24 14:18:48,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:48,609 INFO L225 Difference]: With dead ends: 130 [2018-12-24 14:18:48,609 INFO L226 Difference]: Without dead ends: 129 [2018-12-24 14:18:48,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 14:18:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-24 14:18:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-12-24 14:18:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-24 14:18:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-24 14:18:48,628 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-12-24 14:18:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:48,628 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-24 14:18:48,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 14:18:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-24 14:18:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-24 14:18:48,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:48,629 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-12-24 14:18:48,629 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:48,630 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2018-12-24 14:18:48,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:48,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:48,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:48,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:48,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:49,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:49,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:49,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:49,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:49,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:49,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:49,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:49,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:49,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:49,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:49,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:49,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:49,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:49,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:49,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:50,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:51,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:51,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-24 14:18:51,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:51,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-24 14:18:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-24 14:18:51,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 14:18:51,165 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2018-12-24 14:18:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:52,166 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-24 14:18:52,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 14:18:52,166 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2018-12-24 14:18:52,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:52,167 INFO L225 Difference]: With dead ends: 135 [2018-12-24 14:18:52,167 INFO L226 Difference]: Without dead ends: 134 [2018-12-24 14:18:52,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 14:18:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-24 14:18:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-12-24 14:18:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-24 14:18:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-12-24 14:18:52,193 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-12-24 14:18:52,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:52,194 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-12-24 14:18:52,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-24 14:18:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-12-24 14:18:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-24 14:18:52,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:52,195 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-12-24 14:18:52,195 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:52,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2018-12-24 14:18:52,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:52,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:52,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:52,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:52,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:52,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:52,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:52,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:52,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:52,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:52,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:52,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:52,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:52,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:52,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:52,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:52,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:53,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:54,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:54,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-24 14:18:54,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:54,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-24 14:18:54,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-24 14:18:54,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 14:18:54,864 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2018-12-24 14:18:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:55,936 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-12-24 14:18:55,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-24 14:18:55,937 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2018-12-24 14:18:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:55,938 INFO L225 Difference]: With dead ends: 140 [2018-12-24 14:18:55,938 INFO L226 Difference]: Without dead ends: 139 [2018-12-24 14:18:55,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:18:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-24 14:18:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-12-24 14:18:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-24 14:18:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-24 14:18:55,961 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-12-24 14:18:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:55,962 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-24 14:18:55,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-24 14:18:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-24 14:18:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-24 14:18:55,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:55,963 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-12-24 14:18:55,963 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:18:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:55,963 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2018-12-24 14:18:55,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:55,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:55,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:55,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:55,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:56,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:56,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:56,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:56,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:56,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:56,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:56,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:56,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:56,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-24 14:18:56,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:56,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:56,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:56,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:56,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:56,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:58,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:59,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:59,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-24 14:18:59,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:59,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 14:18:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 14:18:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:18:59,702 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2018-12-24 14:19:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:00,801 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-12-24 14:19:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 14:19:00,801 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2018-12-24 14:19:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:00,802 INFO L225 Difference]: With dead ends: 145 [2018-12-24 14:19:00,803 INFO L226 Difference]: Without dead ends: 144 [2018-12-24 14:19:00,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2018-12-24 14:19:00,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-24 14:19:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-12-24 14:19:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-24 14:19:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-12-24 14:19:00,824 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-12-24 14:19:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:00,824 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-12-24 14:19:00,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 14:19:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-12-24 14:19:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-24 14:19:00,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:00,825 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-12-24 14:19:00,825 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:00,825 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2018-12-24 14:19:00,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:00,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:00,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:00,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:00,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:01,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:01,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:01,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:01,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:01,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:01,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:01,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:01,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:01,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:01,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:01,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:01,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:01,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:01,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:02,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:03,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:03,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-24 14:19:03,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:03,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-24 14:19:03,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-24 14:19:03,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2018-12-24 14:19:03,954 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2018-12-24 14:19:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:05,364 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-12-24 14:19:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 14:19:05,364 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2018-12-24 14:19:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:05,365 INFO L225 Difference]: With dead ends: 150 [2018-12-24 14:19:05,366 INFO L226 Difference]: Without dead ends: 149 [2018-12-24 14:19:05,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 14:19:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-24 14:19:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-12-24 14:19:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-24 14:19:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-12-24 14:19:05,389 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-12-24 14:19:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:05,389 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-12-24 14:19:05,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-24 14:19:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-12-24 14:19:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-24 14:19:05,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:05,390 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-12-24 14:19:05,391 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:05,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2018-12-24 14:19:05,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:05,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:05,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:06,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:06,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:06,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:06,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:06,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:06,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:06,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:06,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:06,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:06,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:06,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:06,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:06,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:06,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:08,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:08,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-24 14:19:08,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:08,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-24 14:19:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-24 14:19:08,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 14:19:08,243 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2018-12-24 14:19:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:09,641 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-12-24 14:19:09,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 14:19:09,642 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2018-12-24 14:19:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:09,643 INFO L225 Difference]: With dead ends: 155 [2018-12-24 14:19:09,643 INFO L226 Difference]: Without dead ends: 154 [2018-12-24 14:19:09,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:19:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-24 14:19:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-12-24 14:19:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-24 14:19:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-12-24 14:19:09,667 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-12-24 14:19:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:09,667 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-12-24 14:19:09,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-24 14:19:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-12-24 14:19:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-24 14:19:09,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:09,668 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-12-24 14:19:09,668 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:09,669 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2018-12-24 14:19:09,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:09,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:09,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:09,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:09,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:11,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:11,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:11,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:11,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:11,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:11,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:11,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:19:11,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:19:11,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-24 14:19:11,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:11,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:11,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:11,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:11,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:11,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:12,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:14,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:14,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-24 14:19:14,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:14,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 14:19:14,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 14:19:14,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 14:19:14,126 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2018-12-24 14:19:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:15,602 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-12-24 14:19:15,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-24 14:19:15,602 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2018-12-24 14:19:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:15,603 INFO L225 Difference]: With dead ends: 160 [2018-12-24 14:19:15,603 INFO L226 Difference]: Without dead ends: 159 [2018-12-24 14:19:15,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 14:19:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-24 14:19:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-12-24 14:19:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-24 14:19:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-12-24 14:19:15,632 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-12-24 14:19:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:15,633 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-12-24 14:19:15,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 14:19:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-12-24 14:19:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-24 14:19:15,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:15,634 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-12-24 14:19:15,634 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:15,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2018-12-24 14:19:15,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:15,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:15,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:17,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:17,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:17,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:17,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:17,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:17,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:17,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:17,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:17,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:17,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:17,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:17,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:17,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:17,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:18,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:20,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:20,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-24 14:19:20,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:20,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-24 14:19:20,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-24 14:19:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:19:20,408 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2018-12-24 14:19:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:21,811 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-24 14:19:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 14:19:21,812 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2018-12-24 14:19:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:21,813 INFO L225 Difference]: With dead ends: 165 [2018-12-24 14:19:21,813 INFO L226 Difference]: Without dead ends: 164 [2018-12-24 14:19:21,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 14:19:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-24 14:19:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-12-24 14:19:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-24 14:19:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-12-24 14:19:21,842 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-12-24 14:19:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:21,842 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-12-24 14:19:21,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-24 14:19:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-12-24 14:19:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-24 14:19:21,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:21,844 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-12-24 14:19:21,844 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:21,844 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2018-12-24 14:19:21,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:21,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:21,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:21,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:21,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:22,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:22,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:22,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:22,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:22,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:22,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:22,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:22,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:22,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:22,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:22,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:22,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:22,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:23,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:25,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-24 14:19:25,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:25,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-24 14:19:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-24 14:19:25,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 14:19:25,318 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2018-12-24 14:19:26,033 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-24 14:19:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:27,349 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-12-24 14:19:27,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-24 14:19:27,350 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2018-12-24 14:19:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:27,351 INFO L225 Difference]: With dead ends: 170 [2018-12-24 14:19:27,351 INFO L226 Difference]: Without dead ends: 169 [2018-12-24 14:19:27,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:19:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-24 14:19:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-12-24 14:19:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-24 14:19:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-12-24 14:19:27,382 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-12-24 14:19:27,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:27,383 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-12-24 14:19:27,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-24 14:19:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-12-24 14:19:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-24 14:19:27,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:27,384 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-12-24 14:19:27,384 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2018-12-24 14:19:27,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:27,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:27,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:27,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:28,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:28,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:28,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:28,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:28,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:28,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:19:28,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:19:29,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-24 14:19:29,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:29,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:29,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:29,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:29,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:29,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:30,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:31,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:31,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-24 14:19:31,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:31,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 14:19:31,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 14:19:31,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:19:31,906 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2018-12-24 14:19:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:33,428 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-12-24 14:19:33,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 14:19:33,428 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2018-12-24 14:19:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:33,430 INFO L225 Difference]: With dead ends: 175 [2018-12-24 14:19:33,430 INFO L226 Difference]: Without dead ends: 174 [2018-12-24 14:19:33,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2018-12-24 14:19:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-24 14:19:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-12-24 14:19:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-24 14:19:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-12-24 14:19:33,470 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-12-24 14:19:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:33,471 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-12-24 14:19:33,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 14:19:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-12-24 14:19:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-24 14:19:33,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:33,472 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-12-24 14:19:33,472 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2018-12-24 14:19:33,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:33,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:33,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:33,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:34,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:34,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:34,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:34,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:34,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:34,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:34,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:34,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:34,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:34,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:34,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:34,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:34,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:34,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:34,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:36,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:37,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:37,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-24 14:19:37,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:37,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-24 14:19:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-24 14:19:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 14:19:37,685 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2018-12-24 14:19:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:39,265 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-12-24 14:19:39,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 14:19:39,266 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2018-12-24 14:19:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:39,267 INFO L225 Difference]: With dead ends: 180 [2018-12-24 14:19:39,267 INFO L226 Difference]: Without dead ends: 179 [2018-12-24 14:19:39,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 14:19:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-24 14:19:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-12-24 14:19:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-24 14:19:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-12-24 14:19:39,302 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-12-24 14:19:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:39,302 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-12-24 14:19:39,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-24 14:19:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-12-24 14:19:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-24 14:19:39,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:39,303 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-12-24 14:19:39,304 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2018-12-24 14:19:39,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:39,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:39,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:40,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:40,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:40,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:40,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:40,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:40,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:40,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:40,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:41,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:41,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:41,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:41,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:41,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:42,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:43,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:43,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-24 14:19:43,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:43,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-24 14:19:43,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-24 14:19:43,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:19:43,825 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2018-12-24 14:19:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:45,834 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-12-24 14:19:45,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 14:19:45,835 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2018-12-24 14:19:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:45,836 INFO L225 Difference]: With dead ends: 185 [2018-12-24 14:19:45,836 INFO L226 Difference]: Without dead ends: 184 [2018-12-24 14:19:45,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:19:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-24 14:19:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-12-24 14:19:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-24 14:19:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-12-24 14:19:45,873 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-12-24 14:19:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:45,873 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-12-24 14:19:45,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-24 14:19:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-12-24 14:19:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-24 14:19:45,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:45,874 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-12-24 14:19:45,875 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2018-12-24 14:19:45,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:45,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:45,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:46,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:46,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:46,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:46,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:46,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:46,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:19:47,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:19:47,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-24 14:19:47,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:47,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:47,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:47,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:47,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:47,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:48,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:50,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:50,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-24 14:19:50,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:50,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 14:19:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 14:19:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2018-12-24 14:19:50,709 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2018-12-24 14:19:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:52,329 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-12-24 14:19:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-24 14:19:52,329 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2018-12-24 14:19:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:52,330 INFO L225 Difference]: With dead ends: 190 [2018-12-24 14:19:52,330 INFO L226 Difference]: Without dead ends: 189 [2018-12-24 14:19:52,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 14:19:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-24 14:19:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-12-24 14:19:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-24 14:19:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-12-24 14:19:52,363 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-12-24 14:19:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:52,363 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-12-24 14:19:52,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 14:19:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-12-24 14:19:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-24 14:19:52,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:52,364 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-12-24 14:19:52,365 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:52,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2018-12-24 14:19:52,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:52,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:52,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:52,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:53,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:53,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:53,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:53,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:53,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:53,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:53,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:53,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:53,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:53,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:53,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:53,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:53,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:53,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:53,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:55,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:57,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:57,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-24 14:19:57,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:57,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-24 14:19:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-24 14:19:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 14:19:57,746 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2018-12-24 14:19:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:59,653 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-24 14:19:59,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 14:19:59,653 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2018-12-24 14:19:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:59,654 INFO L225 Difference]: With dead ends: 195 [2018-12-24 14:19:59,654 INFO L226 Difference]: Without dead ends: 194 [2018-12-24 14:19:59,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 14:19:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-24 14:19:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-12-24 14:19:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-24 14:19:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-12-24 14:19:59,701 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-12-24 14:19:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:59,701 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-12-24 14:19:59,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-24 14:19:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-12-24 14:19:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-24 14:19:59,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:59,703 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-12-24 14:19:59,703 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:19:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2018-12-24 14:19:59,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:59,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:59,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:59,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:00,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:00,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:00,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:00,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:00,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:00,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:01,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:01,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:20:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:01,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:01,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:01,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:01,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:01,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:02,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:04,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:04,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-24 14:20:04,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:04,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-24 14:20:04,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-24 14:20:04,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2018-12-24 14:20:04,277 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2018-12-24 14:20:04,851 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-24 14:20:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:06,750 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-12-24 14:20:06,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-24 14:20:06,750 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2018-12-24 14:20:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:06,751 INFO L225 Difference]: With dead ends: 200 [2018-12-24 14:20:06,752 INFO L226 Difference]: Without dead ends: 199 [2018-12-24 14:20:06,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:20:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-24 14:20:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-12-24 14:20:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-24 14:20:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-12-24 14:20:06,788 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-12-24 14:20:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:06,788 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-12-24 14:20:06,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-24 14:20:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-12-24 14:20:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-24 14:20:06,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:06,789 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-12-24 14:20:06,789 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:20:06,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:06,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2018-12-24 14:20:06,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:06,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:06,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:06,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:06,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:07,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:07,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:07,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:07,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:07,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:07,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:07,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:20:07,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:20:07,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-24 14:20:07,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:07,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:07,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:07,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:08,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:08,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:09,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:11,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:11,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-24 14:20:11,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:11,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 14:20:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 14:20:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:20:11,672 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2018-12-24 14:20:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:13,554 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-12-24 14:20:13,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 14:20:13,554 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2018-12-24 14:20:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:13,555 INFO L225 Difference]: With dead ends: 205 [2018-12-24 14:20:13,555 INFO L226 Difference]: Without dead ends: 204 [2018-12-24 14:20:13,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:20:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-24 14:20:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-12-24 14:20:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-24 14:20:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-12-24 14:20:13,592 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-12-24 14:20:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:13,592 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-12-24 14:20:13,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 14:20:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-12-24 14:20:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-24 14:20:13,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:13,593 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-12-24 14:20:13,594 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:20:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:13,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2018-12-24 14:20:13,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:13,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:13,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:14,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:14,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:14,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:14,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:14,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:14,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:14,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:20:14,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:20:14,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:20:14,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:14,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:14,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:14,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:14,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:14,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:16,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:18,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:18,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-24 14:20:18,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:18,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-24 14:20:18,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-24 14:20:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2018-12-24 14:20:18,592 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2018-12-24 14:20:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:20,491 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-12-24 14:20:20,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 14:20:20,492 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2018-12-24 14:20:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:20,493 INFO L225 Difference]: With dead ends: 210 [2018-12-24 14:20:20,493 INFO L226 Difference]: Without dead ends: 209 [2018-12-24 14:20:20,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:20:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-24 14:20:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-12-24 14:20:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-24 14:20:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-12-24 14:20:20,529 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-12-24 14:20:20,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:20,529 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-12-24 14:20:20,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-24 14:20:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-12-24 14:20:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-24 14:20:20,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:20,531 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-12-24 14:20:20,531 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:20:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:20,531 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2018-12-24 14:20:20,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:20,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:20,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:20,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:20,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:22,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:22,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:22,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:22,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:22,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:22,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:22,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:22,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:20:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:22,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:22,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:22,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:22,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:22,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:23,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:26,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:26,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-24 14:20:26,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:26,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-24 14:20:26,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-24 14:20:26,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 14:20:26,757 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2018-12-24 14:20:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:28,792 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-12-24 14:20:28,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 14:20:28,793 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2018-12-24 14:20:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:28,794 INFO L225 Difference]: With dead ends: 215 [2018-12-24 14:20:28,794 INFO L226 Difference]: Without dead ends: 214 [2018-12-24 14:20:28,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:20:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-24 14:20:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-12-24 14:20:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-24 14:20:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-12-24 14:20:28,837 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-12-24 14:20:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:28,837 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-12-24 14:20:28,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-24 14:20:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-12-24 14:20:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-24 14:20:28,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:28,838 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-12-24 14:20:28,838 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:20:28,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:28,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2018-12-24 14:20:28,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:28,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:28,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:28,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:28,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:30,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:30,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:30,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:30,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:30,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:30,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:30,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:20:30,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:20:30,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-24 14:20:30,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:30,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:30,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:30,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:30,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:30,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:32,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:34,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:34,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-24 14:20:34,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:34,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 14:20:34,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 14:20:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 14:20:34,838 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2018-12-24 14:20:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:37,093 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-12-24 14:20:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-24 14:20:37,093 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2018-12-24 14:20:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:37,094 INFO L225 Difference]: With dead ends: 220 [2018-12-24 14:20:37,095 INFO L226 Difference]: Without dead ends: 219 [2018-12-24 14:20:37,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:20:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-24 14:20:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-12-24 14:20:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-24 14:20:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-12-24 14:20:37,136 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-12-24 14:20:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:37,137 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-12-24 14:20:37,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 14:20:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-12-24 14:20:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-24 14:20:37,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:37,138 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-12-24 14:20:37,138 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:20:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2018-12-24 14:20:37,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:37,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:37,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:37,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:37,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:38,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:38,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:38,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:38,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:38,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:38,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:38,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:20:38,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:20:39,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:20:39,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:39,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:39,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:39,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:39,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:39,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:40,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:43,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:43,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-24 14:20:43,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:43,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-24 14:20:43,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-24 14:20:43,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:20:43,263 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2018-12-24 14:20:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:45,430 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-12-24 14:20:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 14:20:45,431 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2018-12-24 14:20:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:45,432 INFO L225 Difference]: With dead ends: 225 [2018-12-24 14:20:45,432 INFO L226 Difference]: Without dead ends: 224 [2018-12-24 14:20:45,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:20:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-12-24 14:20:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-12-24 14:20:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-24 14:20:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-12-24 14:20:45,477 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-12-24 14:20:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:45,477 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-12-24 14:20:45,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-24 14:20:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-12-24 14:20:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-24 14:20:45,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:45,478 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-12-24 14:20:45,478 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:20:45,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:45,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2018-12-24 14:20:45,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:45,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:45,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:45,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:45,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:46,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:46,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:46,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:46,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:46,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:46,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:46,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:46,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:20:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:46,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:46,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:46,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:46,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:46,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:48,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:50,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:50,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-24 14:20:50,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:50,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-24 14:20:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-24 14:20:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2018-12-24 14:20:50,968 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2018-12-24 14:20:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:53,436 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-12-24 14:20:53,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-24 14:20:53,436 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2018-12-24 14:20:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:53,438 INFO L225 Difference]: With dead ends: 230 [2018-12-24 14:20:53,438 INFO L226 Difference]: Without dead ends: 229 [2018-12-24 14:20:53,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:20:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-24 14:20:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-12-24 14:20:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-24 14:20:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-12-24 14:20:53,493 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-12-24 14:20:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:53,493 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-12-24 14:20:53,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-24 14:20:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-12-24 14:20:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-24 14:20:53,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:53,495 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-12-24 14:20:53,495 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:20:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2018-12-24 14:20:53,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:53,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:53,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:53,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:53,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:54,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:54,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:54,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:54,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:54,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:54,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:54,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:20:54,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:20:55,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-24 14:20:55,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:55,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:55,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:55,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:55,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:55,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:56,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:00,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:00,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-24 14:21:00,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:00,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 14:21:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 14:21:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 14:21:00,087 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2018-12-24 14:21:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:02,788 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-12-24 14:21:02,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 14:21:02,789 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2018-12-24 14:21:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:02,790 INFO L225 Difference]: With dead ends: 235 [2018-12-24 14:21:02,790 INFO L226 Difference]: Without dead ends: 234 [2018-12-24 14:21:02,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:21:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-24 14:21:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-12-24 14:21:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-24 14:21:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-12-24 14:21:02,856 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-12-24 14:21:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:02,857 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-12-24 14:21:02,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 14:21:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-12-24 14:21:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-24 14:21:02,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:02,859 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-12-24 14:21:02,859 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:21:02,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:02,859 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2018-12-24 14:21:02,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:02,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:02,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:04,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:04,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:04,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:04,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:04,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:21:04,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:21:04,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:21:04,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:04,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:04,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:04,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:04,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:04,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:05,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:09,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:09,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-24 14:21:09,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:09,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-24 14:21:09,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-24 14:21:09,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2018-12-24 14:21:09,228 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2018-12-24 14:21:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:11,765 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-12-24 14:21:11,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 14:21:11,765 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2018-12-24 14:21:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:11,767 INFO L225 Difference]: With dead ends: 240 [2018-12-24 14:21:11,767 INFO L226 Difference]: Without dead ends: 239 [2018-12-24 14:21:11,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 14:21:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-24 14:21:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-12-24 14:21:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-24 14:21:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-12-24 14:21:11,836 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-12-24 14:21:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:11,837 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-12-24 14:21:11,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-24 14:21:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-12-24 14:21:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-24 14:21:11,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:11,838 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-12-24 14:21:11,839 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:21:11,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:11,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2018-12-24 14:21:11,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:11,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:11,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:11,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:11,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:13,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:13,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:13,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:13,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:13,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:13,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:13,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:13,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:21:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:13,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:13,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:13,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:13,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:13,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:15,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:18,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:18,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-24 14:21:18,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:18,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-24 14:21:18,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-24 14:21:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:21:18,558 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2018-12-24 14:21:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:21,175 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-12-24 14:21:21,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 14:21:21,181 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2018-12-24 14:21:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:21,182 INFO L225 Difference]: With dead ends: 245 [2018-12-24 14:21:21,182 INFO L226 Difference]: Without dead ends: 244 [2018-12-24 14:21:21,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 14:21:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-12-24 14:21:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-12-24 14:21:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-24 14:21:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-12-24 14:21:21,247 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-12-24 14:21:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:21,247 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-12-24 14:21:21,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-24 14:21:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-12-24 14:21:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-24 14:21:21,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:21,248 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-12-24 14:21:21,249 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:21:21,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:21,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2018-12-24 14:21:21,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:21,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:21,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:21,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:21,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:22,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:22,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:22,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:22,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:22,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:22,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:22,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:21:22,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:21:23,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-24 14:21:23,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:23,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:23,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:23,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:23,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:23,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:24,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:28,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:28,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-24 14:21:28,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:28,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 14:21:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 14:21:28,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2018-12-24 14:21:28,287 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2018-12-24 14:21:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:30,953 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-12-24 14:21:30,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-24 14:21:30,954 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2018-12-24 14:21:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:30,955 INFO L225 Difference]: With dead ends: 250 [2018-12-24 14:21:30,955 INFO L226 Difference]: Without dead ends: 249 [2018-12-24 14:21:30,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 14:21:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-12-24 14:21:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-12-24 14:21:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-12-24 14:21:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-12-24 14:21:31,005 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-12-24 14:21:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:31,005 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-12-24 14:21:31,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 14:21:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-12-24 14:21:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-12-24 14:21:31,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:31,006 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-12-24 14:21:31,007 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:21:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:31,007 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2018-12-24 14:21:31,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:31,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:31,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:32,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:32,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:32,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:32,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:32,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:32,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:32,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:21:32,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:21:32,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:21:32,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:32,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:32,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:32,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:32,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:32,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:34,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:38,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:38,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-24 14:21:38,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:38,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-24 14:21:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-24 14:21:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 14:21:38,126 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2018-12-24 14:21:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:40,816 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-12-24 14:21:40,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 14:21:40,817 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2018-12-24 14:21:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:40,818 INFO L225 Difference]: With dead ends: 255 [2018-12-24 14:21:40,819 INFO L226 Difference]: Without dead ends: 254 [2018-12-24 14:21:40,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 14:21:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-24 14:21:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-12-24 14:21:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-24 14:21:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-12-24 14:21:40,873 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-12-24 14:21:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:40,873 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-12-24 14:21:40,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-24 14:21:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-12-24 14:21:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-24 14:21:40,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:40,875 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-12-24 14:21:40,875 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:21:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:40,876 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2018-12-24 14:21:40,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:40,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:40,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:40,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:40,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:42,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:42,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:42,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:42,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:42,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:42,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:42,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:42,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:21:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:42,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:42,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:42,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:42,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:42,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:44,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:48,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:48,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2018-12-24 14:21:48,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:48,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-24 14:21:48,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-24 14:21:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2018-12-24 14:21:48,007 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2018-12-24 14:21:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:51,014 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-12-24 14:21:51,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-24 14:21:51,014 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2018-12-24 14:21:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:51,016 INFO L225 Difference]: With dead ends: 260 [2018-12-24 14:21:51,016 INFO L226 Difference]: Without dead ends: 259 [2018-12-24 14:21:51,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 14:21:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-24 14:21:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-12-24 14:21:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-24 14:21:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-12-24 14:21:51,080 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-12-24 14:21:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:51,080 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-12-24 14:21:51,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-24 14:21:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-12-24 14:21:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-24 14:21:51,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:51,082 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-12-24 14:21:51,082 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:21:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2018-12-24 14:21:51,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:51,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:51,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:51,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:51,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:52,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:52,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:52,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:52,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:52,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:52,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:52,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:21:52,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:21:52,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-24 14:21:52,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:52,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:52,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:52,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:52,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:52,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:54,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:58,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:58,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2018-12-24 14:21:58,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:58,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-24 14:21:58,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-24 14:21:58,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 14:21:58,829 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2018-12-24 14:22:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:01,890 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-12-24 14:22:01,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 14:22:01,891 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2018-12-24 14:22:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:01,892 INFO L225 Difference]: With dead ends: 265 [2018-12-24 14:22:01,892 INFO L226 Difference]: Without dead ends: 264 [2018-12-24 14:22:01,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2018-12-24 14:22:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-24 14:22:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-12-24 14:22:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-24 14:22:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-12-24 14:22:01,953 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-12-24 14:22:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:01,953 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-12-24 14:22:01,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-24 14:22:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-12-24 14:22:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-24 14:22:01,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:01,955 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-12-24 14:22:01,955 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:22:01,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2018-12-24 14:22:01,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:01,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:01,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:01,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:01,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:03,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:03,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:03,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:03,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:03,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:03,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:03,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:22:03,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:22:03,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:22:03,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:03,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:03,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:03,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:03,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:03,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:05,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:09,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:09,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2018-12-24 14:22:09,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:09,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-24 14:22:09,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-24 14:22:09,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2018-12-24 14:22:09,612 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2018-12-24 14:22:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:12,653 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-12-24 14:22:12,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 14:22:12,654 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2018-12-24 14:22:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:12,655 INFO L225 Difference]: With dead ends: 270 [2018-12-24 14:22:12,655 INFO L226 Difference]: Without dead ends: 269 [2018-12-24 14:22:12,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2018-12-24 14:22:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-24 14:22:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-12-24 14:22:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-24 14:22:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-12-24 14:22:12,725 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-12-24 14:22:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:12,725 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-12-24 14:22:12,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-24 14:22:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-12-24 14:22:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-24 14:22:12,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:12,727 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-12-24 14:22:12,727 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:22:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2018-12-24 14:22:12,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:12,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:12,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:12,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:12,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:14,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:14,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:14,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:14,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:14,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:14,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:14,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:14,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:22:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:14,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:14,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:14,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:14,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:14,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:16,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:20,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:20,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2018-12-24 14:22:20,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:20,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-24 14:22:20,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-24 14:22:20,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:22:20,629 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2018-12-24 14:22:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:23,696 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-12-24 14:22:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 14:22:23,696 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2018-12-24 14:22:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:23,697 INFO L225 Difference]: With dead ends: 275 [2018-12-24 14:22:23,697 INFO L226 Difference]: Without dead ends: 274 [2018-12-24 14:22:23,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2018-12-24 14:22:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-24 14:22:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-12-24 14:22:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-24 14:22:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-12-24 14:22:23,761 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-12-24 14:22:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:23,761 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-12-24 14:22:23,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-24 14:22:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-12-24 14:22:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-24 14:22:23,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:23,763 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-12-24 14:22:23,763 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:22:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2018-12-24 14:22:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:23,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:23,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:23,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:25,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:25,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:25,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:25,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:25,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:25,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:25,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:22:25,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:22:25,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-24 14:22:25,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:25,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:26,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:26,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:26,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:26,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:27,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:31,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:31,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2018-12-24 14:22:31,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:31,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-24 14:22:31,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-24 14:22:31,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2018-12-24 14:22:31,936 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2018-12-24 14:22:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:35,244 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-12-24 14:22:35,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-24 14:22:35,244 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2018-12-24 14:22:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:35,246 INFO L225 Difference]: With dead ends: 280 [2018-12-24 14:22:35,246 INFO L226 Difference]: Without dead ends: 279 [2018-12-24 14:22:35,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2018-12-24 14:22:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-24 14:22:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-12-24 14:22:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-24 14:22:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-12-24 14:22:35,323 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-12-24 14:22:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:35,323 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-12-24 14:22:35,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-24 14:22:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-12-24 14:22:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-24 14:22:35,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:35,325 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-12-24 14:22:35,325 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:22:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2018-12-24 14:22:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:35,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:35,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:35,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:35,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:37,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:37,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:37,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:37,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:37,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:37,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:37,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:22:37,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:22:37,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:22:37,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:37,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:37,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:37,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:37,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:37,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:39,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:43,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:43,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2018-12-24 14:22:43,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:43,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-24 14:22:43,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-24 14:22:43,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 14:22:43,255 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2018-12-24 14:22:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:46,537 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-12-24 14:22:46,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 14:22:46,537 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2018-12-24 14:22:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:46,538 INFO L225 Difference]: With dead ends: 285 [2018-12-24 14:22:46,538 INFO L226 Difference]: Without dead ends: 284 [2018-12-24 14:22:46,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2018-12-24 14:22:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-24 14:22:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-12-24 14:22:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-24 14:22:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-12-24 14:22:46,608 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-12-24 14:22:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:46,609 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-12-24 14:22:46,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-24 14:22:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-12-24 14:22:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-24 14:22:46,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:46,610 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-12-24 14:22:46,610 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:22:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2018-12-24 14:22:46,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:46,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:46,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:48,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:48,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:48,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:48,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:48,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:48,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:48,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:48,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:22:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:48,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:48,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:48,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:48,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:48,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:50,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:55,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:55,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2018-12-24 14:22:55,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:55,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-24 14:22:55,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-24 14:22:55,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 14:22:55,062 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2018-12-24 14:22:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:58,422 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-12-24 14:22:58,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-24 14:22:58,422 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2018-12-24 14:22:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:58,423 INFO L225 Difference]: With dead ends: 290 [2018-12-24 14:22:58,424 INFO L226 Difference]: Without dead ends: 289 [2018-12-24 14:22:58,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2018-12-24 14:22:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-24 14:22:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-12-24 14:22:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-24 14:22:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-12-24 14:22:58,493 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-12-24 14:22:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:58,494 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-12-24 14:22:58,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-24 14:22:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-12-24 14:22:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-24 14:22:58,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:58,495 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-12-24 14:22:58,495 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:22:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2018-12-24 14:22:58,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:58,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:58,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:58,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:58,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:00,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:00,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:00,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:00,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:00,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:00,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:00,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:23:00,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:23:00,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-24 14:23:00,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:00,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:00,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:00,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:00,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:00,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:03,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:07,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:07,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2018-12-24 14:23:07,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:07,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-24 14:23:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-24 14:23:07,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:23:07,409 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2018-12-24 14:23:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:11,098 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-12-24 14:23:11,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 14:23:11,099 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2018-12-24 14:23:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:11,100 INFO L225 Difference]: With dead ends: 295 [2018-12-24 14:23:11,100 INFO L226 Difference]: Without dead ends: 294 [2018-12-24 14:23:11,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2018-12-24 14:23:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-24 14:23:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-12-24 14:23:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-24 14:23:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-12-24 14:23:11,172 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-12-24 14:23:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:11,172 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-12-24 14:23:11,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-24 14:23:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-12-24 14:23:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-12-24 14:23:11,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:11,174 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-12-24 14:23:11,174 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:23:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2018-12-24 14:23:11,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:11,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:11,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:13,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:13,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:13,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:13,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:13,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:13,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:13,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:23:13,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:23:13,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:23:13,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:13,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:13,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:13,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:13,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:13,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:15,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:19,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:19,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2018-12-24 14:23:19,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:19,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-24 14:23:19,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-24 14:23:19,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2018-12-24 14:23:19,859 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2018-12-24 14:23:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:23,594 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-12-24 14:23:23,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 14:23:23,594 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2018-12-24 14:23:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:23,596 INFO L225 Difference]: With dead ends: 300 [2018-12-24 14:23:23,596 INFO L226 Difference]: Without dead ends: 299 [2018-12-24 14:23:23,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2018-12-24 14:23:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-24 14:23:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-12-24 14:23:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-24 14:23:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-12-24 14:23:23,678 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-12-24 14:23:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:23,678 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-12-24 14:23:23,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-24 14:23:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-12-24 14:23:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-12-24 14:23:23,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:23,680 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-12-24 14:23:23,680 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:23:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:23,680 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2018-12-24 14:23:23,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:23,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:23,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:23,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:25,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:25,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:25,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:25,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:25,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:25,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:26,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:26,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:23:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:26,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:26,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:26,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:26,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:26,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:28,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:32,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:32,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2018-12-24 14:23:32,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:32,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-24 14:23:32,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-24 14:23:32,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 14:23:32,762 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2018-12-24 14:23:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:36,715 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-12-24 14:23:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 14:23:36,715 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2018-12-24 14:23:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:36,716 INFO L225 Difference]: With dead ends: 305 [2018-12-24 14:23:36,716 INFO L226 Difference]: Without dead ends: 304 [2018-12-24 14:23:36,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2018-12-24 14:23:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-24 14:23:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-12-24 14:23:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-24 14:23:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-12-24 14:23:36,793 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-12-24 14:23:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:36,793 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-12-24 14:23:36,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-24 14:23:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-12-24 14:23:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-24 14:23:36,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:36,795 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-12-24 14:23:36,795 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:23:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:36,795 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2018-12-24 14:23:36,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:36,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:36,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:36,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:36,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:38,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:38,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:38,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:38,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:38,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:38,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:38,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:23:38,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:23:39,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-24 14:23:39,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:39,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:39,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:39,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:39,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:39,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:41,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:45,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:45,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2018-12-24 14:23:45,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:45,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-24 14:23:45,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-24 14:23:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2018-12-24 14:23:45,843 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2018-12-24 14:23:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:49,632 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-12-24 14:23:49,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-24 14:23:49,632 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2018-12-24 14:23:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:49,633 INFO L225 Difference]: With dead ends: 310 [2018-12-24 14:23:49,634 INFO L226 Difference]: Without dead ends: 309 [2018-12-24 14:23:49,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2018-12-24 14:23:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-24 14:23:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2018-12-24 14:23:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-24 14:23:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-12-24 14:23:49,771 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2018-12-24 14:23:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:49,771 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-12-24 14:23:49,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-24 14:23:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-12-24 14:23:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-12-24 14:23:49,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:49,773 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2018-12-24 14:23:49,773 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:23:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2018-12-24 14:23:49,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:49,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:49,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:49,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:49,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:51,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:51,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:51,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:51,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:51,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:51,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:23:51,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:23:52,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:23:52,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:52,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:52,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:52,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:52,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:52,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:54,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:58,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:58,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2018-12-24 14:23:58,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:59,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-24 14:23:59,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-24 14:23:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:23:59,003 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2018-12-24 14:24:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:03,009 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-12-24 14:24:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 14:24:03,009 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2018-12-24 14:24:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:03,011 INFO L225 Difference]: With dead ends: 315 [2018-12-24 14:24:03,011 INFO L226 Difference]: Without dead ends: 314 [2018-12-24 14:24:03,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2018-12-24 14:24:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-24 14:24:03,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2018-12-24 14:24:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-12-24 14:24:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-12-24 14:24:03,108 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2018-12-24 14:24:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:03,109 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-12-24 14:24:03,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-24 14:24:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-12-24 14:24:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-12-24 14:24:03,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:03,110 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2018-12-24 14:24:03,110 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:24:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:03,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2018-12-24 14:24:03,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:03,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:03,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:03,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:05,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:05,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:05,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:05,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:05,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:05,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:05,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:05,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:24:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:05,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:05,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:24:05,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:24:05,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:24:05,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:24:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:08,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:12,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:12,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2018-12-24 14:24:12,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:12,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-24 14:24:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-24 14:24:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2018-12-24 14:24:12,685 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2018-12-24 14:24:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:16,921 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-12-24 14:24:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-24 14:24:16,922 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2018-12-24 14:24:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:16,923 INFO L225 Difference]: With dead ends: 320 [2018-12-24 14:24:16,923 INFO L226 Difference]: Without dead ends: 319 [2018-12-24 14:24:16,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2018-12-24 14:24:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-24 14:24:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2018-12-24 14:24:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-24 14:24:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-12-24 14:24:17,011 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2018-12-24 14:24:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:17,011 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-12-24 14:24:17,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-24 14:24:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-12-24 14:24:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-12-24 14:24:17,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:17,014 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2018-12-24 14:24:17,014 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:24:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2018-12-24 14:24:17,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:17,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:17,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:19,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:19,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:19,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:19,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:19,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:19,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:19,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:24:19,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:24:19,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-24 14:24:19,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:24:19,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:19,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:24:19,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:24:19,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:24:19,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:24:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:22,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:26,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:26,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2018-12-24 14:24:26,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:26,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-24 14:24:26,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-24 14:24:26,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 14:24:26,727 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2018-12-24 14:24:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:30,855 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-12-24 14:24:30,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 14:24:30,856 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2018-12-24 14:24:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:30,857 INFO L225 Difference]: With dead ends: 325 [2018-12-24 14:24:30,857 INFO L226 Difference]: Without dead ends: 324 [2018-12-24 14:24:30,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2018-12-24 14:24:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-24 14:24:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2018-12-24 14:24:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-24 14:24:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-12-24 14:24:30,944 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2018-12-24 14:24:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:30,945 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-12-24 14:24:30,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-24 14:24:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-12-24 14:24:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-12-24 14:24:30,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:30,946 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2018-12-24 14:24:30,947 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:24:30,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:30,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2018-12-24 14:24:30,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:30,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:30,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:30,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:30,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:33,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:33,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:33,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:33,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:33,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:33,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:33,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:24:33,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:24:33,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:24:33,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:24:33,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:33,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:24:33,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:24:33,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:24:33,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:24:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:36,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:40,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:40,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2018-12-24 14:24:40,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:40,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-24 14:24:40,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-24 14:24:40,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2018-12-24 14:24:40,615 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2018-12-24 14:24:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:45,173 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-12-24 14:24:45,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 14:24:45,173 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2018-12-24 14:24:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:45,175 INFO L225 Difference]: With dead ends: 330 [2018-12-24 14:24:45,175 INFO L226 Difference]: Without dead ends: 329 [2018-12-24 14:24:45,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2018-12-24 14:24:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-12-24 14:24:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2018-12-24 14:24:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-12-24 14:24:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-12-24 14:24:45,272 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2018-12-24 14:24:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:45,273 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-12-24 14:24:45,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-24 14:24:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-12-24 14:24:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-12-24 14:24:45,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:45,274 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2018-12-24 14:24:45,274 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:24:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2018-12-24 14:24:45,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:45,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:45,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:47,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:47,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:47,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:47,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:47,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:47,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:47,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:47,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:24:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:48,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:48,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:24:48,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:24:48,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:24:48,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:24:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:50,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:55,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:55,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2018-12-24 14:24:55,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:55,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-24 14:24:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-24 14:24:55,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:24:55,235 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2018-12-24 14:24:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:59,792 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-12-24 14:24:59,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 14:24:59,792 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2018-12-24 14:24:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:59,794 INFO L225 Difference]: With dead ends: 335 [2018-12-24 14:24:59,794 INFO L226 Difference]: Without dead ends: 334 [2018-12-24 14:24:59,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2018-12-24 14:24:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-24 14:24:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2018-12-24 14:24:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-24 14:24:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-12-24 14:24:59,889 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2018-12-24 14:24:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:59,889 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-12-24 14:24:59,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-24 14:24:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-12-24 14:24:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-12-24 14:24:59,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:59,891 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2018-12-24 14:24:59,891 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:24:59,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:59,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2018-12-24 14:24:59,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:59,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:59,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:02,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:02,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:02,315 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:02,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:02,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:02,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:02,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:25:02,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:25:02,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-24 14:25:02,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:02,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:02,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:25:02,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:25:02,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:25:02,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:25:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:05,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:10,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:10,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2018-12-24 14:25:10,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:10,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-24 14:25:10,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-24 14:25:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 14:25:10,076 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2018-12-24 14:25:14,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:14,636 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2018-12-24 14:25:14,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-24 14:25:14,636 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2018-12-24 14:25:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:14,638 INFO L225 Difference]: With dead ends: 340 [2018-12-24 14:25:14,638 INFO L226 Difference]: Without dead ends: 339 [2018-12-24 14:25:14,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2018-12-24 14:25:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-24 14:25:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2018-12-24 14:25:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-24 14:25:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2018-12-24 14:25:14,731 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2018-12-24 14:25:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:14,731 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2018-12-24 14:25:14,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-24 14:25:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2018-12-24 14:25:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-12-24 14:25:14,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:14,732 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2018-12-24 14:25:14,733 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:25:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:14,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2018-12-24 14:25:14,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:14,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:14,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:25:14,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:14,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:17,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:17,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:17,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:17,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:17,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:17,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:17,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:25:17,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:25:17,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:25:17,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:17,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:17,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:25:17,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:25:17,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:25:17,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:25:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:20,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:25,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:25,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2018-12-24 14:25:25,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:25,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-24 14:25:25,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-24 14:25:25,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 14:25:25,934 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2018-12-24 14:25:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:30,560 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-12-24 14:25:30,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 14:25:30,561 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2018-12-24 14:25:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:30,562 INFO L225 Difference]: With dead ends: 345 [2018-12-24 14:25:30,562 INFO L226 Difference]: Without dead ends: 344 [2018-12-24 14:25:30,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2018-12-24 14:25:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-24 14:25:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2018-12-24 14:25:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-24 14:25:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-12-24 14:25:30,672 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2018-12-24 14:25:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:30,672 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-12-24 14:25:30,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-24 14:25:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-12-24 14:25:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-12-24 14:25:30,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:30,674 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2018-12-24 14:25:30,674 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:25:30,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2018-12-24 14:25:30,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:30,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:30,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:25:30,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:30,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:33,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:33,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:33,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:33,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:33,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:33,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:33,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:25:33,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:25:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:33,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:33,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:25:33,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:25:33,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:25:33,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:25:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:36,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:41,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:41,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2018-12-24 14:25:41,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:41,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-24 14:25:41,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-24 14:25:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2018-12-24 14:25:41,166 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2018-12-24 14:25:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:46,079 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2018-12-24 14:25:46,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-24 14:25:46,080 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2018-12-24 14:25:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:46,081 INFO L225 Difference]: With dead ends: 350 [2018-12-24 14:25:46,081 INFO L226 Difference]: Without dead ends: 349 [2018-12-24 14:25:46,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2018-12-24 14:25:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-24 14:25:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2018-12-24 14:25:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-12-24 14:25:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-12-24 14:25:46,179 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2018-12-24 14:25:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:46,179 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-12-24 14:25:46,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-24 14:25:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-12-24 14:25:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-12-24 14:25:46,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:46,181 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2018-12-24 14:25:46,181 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:25:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2018-12-24 14:25:46,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:25:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:46,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:48,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:48,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:48,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:48,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:48,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:48,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:48,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:25:48,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:25:49,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-24 14:25:49,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:49,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:49,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:25:49,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:25:49,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:25:49,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:25:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:52,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:56,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:56,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2018-12-24 14:25:56,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:56,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-24 14:25:56,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-24 14:25:56,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:25:56,988 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2018-12-24 14:26:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:01,950 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-12-24 14:26:01,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 14:26:01,951 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2018-12-24 14:26:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:01,952 INFO L225 Difference]: With dead ends: 355 [2018-12-24 14:26:01,952 INFO L226 Difference]: Without dead ends: 354 [2018-12-24 14:26:01,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2018-12-24 14:26:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-24 14:26:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2018-12-24 14:26:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-12-24 14:26:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-12-24 14:26:02,053 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2018-12-24 14:26:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:02,054 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-12-24 14:26:02,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-24 14:26:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-12-24 14:26:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-24 14:26:02,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:02,055 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2018-12-24 14:26:02,055 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:26:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2018-12-24 14:26:02,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:02,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:02,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:02,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:02,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:04,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:04,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:04,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:04,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:04,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:04,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:04,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:04,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:05,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:05,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:05,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:05,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:26:05,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:05,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:05,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:08,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:13,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:13,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2018-12-24 14:26:13,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:13,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-24 14:26:13,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-24 14:26:13,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2018-12-24 14:26:13,186 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2018-12-24 14:26:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:18,320 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2018-12-24 14:26:18,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 14:26:18,321 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2018-12-24 14:26:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:18,322 INFO L225 Difference]: With dead ends: 360 [2018-12-24 14:26:18,322 INFO L226 Difference]: Without dead ends: 359 [2018-12-24 14:26:18,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2018-12-24 14:26:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-12-24 14:26:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2018-12-24 14:26:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-24 14:26:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-12-24 14:26:18,434 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2018-12-24 14:26:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:18,435 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-12-24 14:26:18,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-24 14:26:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-12-24 14:26:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-12-24 14:26:18,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:18,436 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2018-12-24 14:26:18,436 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:26:18,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2018-12-24 14:26:18,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:18,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:18,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:18,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:21,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:21,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:21,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:21,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:21,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:21,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:21,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:21,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:21,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:21,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:26:21,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:21,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:21,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:25,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:29,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:29,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2018-12-24 14:26:29,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:29,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-24 14:26:29,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-24 14:26:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 14:26:29,490 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2018-12-24 14:26:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:34,711 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-12-24 14:26:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 14:26:34,711 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2018-12-24 14:26:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:34,712 INFO L225 Difference]: With dead ends: 365 [2018-12-24 14:26:34,713 INFO L226 Difference]: Without dead ends: 364 [2018-12-24 14:26:34,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2018-12-24 14:26:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-12-24 14:26:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2018-12-24 14:26:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-24 14:26:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-12-24 14:26:34,825 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2018-12-24 14:26:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:34,825 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-12-24 14:26:34,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-24 14:26:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-12-24 14:26:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-12-24 14:26:34,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:34,827 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2018-12-24 14:26:34,827 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:26:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:34,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2018-12-24 14:26:34,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:34,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:34,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:34,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:34,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:37,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:37,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:37,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:37,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:37,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:37,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:37,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:37,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:38,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-24 14:26:38,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:38,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:38,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:26:38,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:38,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:38,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:41,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:46,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:46,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2018-12-24 14:26:46,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:46,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-24 14:26:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-24 14:26:46,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2018-12-24 14:26:46,217 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2018-12-24 14:26:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:51,496 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2018-12-24 14:26:51,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-24 14:26:51,496 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2018-12-24 14:26:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:51,498 INFO L225 Difference]: With dead ends: 370 [2018-12-24 14:26:51,498 INFO L226 Difference]: Without dead ends: 369 [2018-12-24 14:26:51,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2018-12-24 14:26:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-24 14:26:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-12-24 14:26:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-12-24 14:26:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2018-12-24 14:26:51,605 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2018-12-24 14:26:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:51,605 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2018-12-24 14:26:51,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-24 14:26:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2018-12-24 14:26:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-12-24 14:26:51,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:51,607 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2018-12-24 14:26:51,607 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:26:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:51,607 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2018-12-24 14:26:51,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:51,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:51,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:51,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:51,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:54,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:54,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:54,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:54,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:54,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:54,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:54,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:54,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:54,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:54,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:54,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:54,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:26:54,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:54,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:54,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:58,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:02,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:02,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2018-12-24 14:27:02,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:02,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-24 14:27:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-24 14:27:02,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:27:02,979 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2018-12-24 14:27:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:08,460 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-12-24 14:27:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 14:27:08,460 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2018-12-24 14:27:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:08,462 INFO L225 Difference]: With dead ends: 375 [2018-12-24 14:27:08,462 INFO L226 Difference]: Without dead ends: 374 [2018-12-24 14:27:08,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2018-12-24 14:27:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-24 14:27:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2018-12-24 14:27:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-12-24 14:27:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-12-24 14:27:08,580 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2018-12-24 14:27:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:08,580 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-12-24 14:27:08,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-24 14:27:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-12-24 14:27:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-12-24 14:27:08,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:08,582 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2018-12-24 14:27:08,582 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:27:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2018-12-24 14:27:08,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:08,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:08,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:08,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:08,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:11,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:11,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:11,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:11,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:11,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:11,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:27:11,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:11,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:27:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:11,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:11,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:27:11,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:11,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:11,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:15,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:19,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:19,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2018-12-24 14:27:19,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:19,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-24 14:27:19,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-24 14:27:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2018-12-24 14:27:19,774 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2018-12-24 14:27:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:25,310 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2018-12-24 14:27:25,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-24 14:27:25,310 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2018-12-24 14:27:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:25,312 INFO L225 Difference]: With dead ends: 380 [2018-12-24 14:27:25,312 INFO L226 Difference]: Without dead ends: 379 [2018-12-24 14:27:25,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2018-12-24 14:27:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-12-24 14:27:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2018-12-24 14:27:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-24 14:27:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-12-24 14:27:25,437 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2018-12-24 14:27:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:25,437 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-12-24 14:27:25,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-24 14:27:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-12-24 14:27:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-24 14:27:25,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:25,439 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2018-12-24 14:27:25,439 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:27:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2018-12-24 14:27:25,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:25,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:25,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:25,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:25,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:28,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:28,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:28,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:28,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:28,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:28,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:27:28,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:27:28,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:27:29,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-24 14:27:29,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:29,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:29,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:27:29,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:29,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:29,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:33,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:37,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:37,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2018-12-24 14:27:37,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:37,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-24 14:27:37,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-24 14:27:37,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 14:27:37,886 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2018-12-24 14:27:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:43,490 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-12-24 14:27:43,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 14:27:43,491 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2018-12-24 14:27:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:43,493 INFO L225 Difference]: With dead ends: 385 [2018-12-24 14:27:43,493 INFO L226 Difference]: Without dead ends: 384 [2018-12-24 14:27:43,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2018-12-24 14:27:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-12-24 14:27:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2018-12-24 14:27:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-24 14:27:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-12-24 14:27:43,608 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2018-12-24 14:27:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:43,608 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-12-24 14:27:43,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-24 14:27:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-12-24 14:27:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-12-24 14:27:43,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:43,610 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2018-12-24 14:27:43,610 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:27:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2018-12-24 14:27:43,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:43,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:43,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:47,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:47,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:47,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:47,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:47,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:47,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:27:47,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:27:47,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:27:47,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:27:47,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:47,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:47,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:27:47,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:47,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:47,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:50,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:55,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:55,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2018-12-24 14:27:55,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:55,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-24 14:27:55,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-24 14:27:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 14:27:55,741 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2018-12-24 14:28:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:01,495 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2018-12-24 14:28:01,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 14:28:01,495 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2018-12-24 14:28:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:01,497 INFO L225 Difference]: With dead ends: 390 [2018-12-24 14:28:01,497 INFO L226 Difference]: Without dead ends: 389 [2018-12-24 14:28:01,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2018-12-24 14:28:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-12-24 14:28:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2018-12-24 14:28:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-12-24 14:28:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-12-24 14:28:01,626 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2018-12-24 14:28:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:01,626 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-12-24 14:28:01,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-24 14:28:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-12-24 14:28:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-12-24 14:28:01,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:01,628 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2018-12-24 14:28:01,628 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:28:01,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:01,628 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2018-12-24 14:28:01,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:01,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:01,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:01,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:01,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:04,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:04,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:04,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:04,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:04,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:04,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:28:04,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:04,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:05,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:05,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:28:05,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:05,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:05,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:09,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:13,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:13,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2018-12-24 14:28:13,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:13,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-24 14:28:13,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-24 14:28:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:28:13,642 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2018-12-24 14:28:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:19,559 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-12-24 14:28:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 14:28:19,560 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2018-12-24 14:28:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:19,561 INFO L225 Difference]: With dead ends: 395 [2018-12-24 14:28:19,561 INFO L226 Difference]: Without dead ends: 394 [2018-12-24 14:28:19,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2018-12-24 14:28:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-24 14:28:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2018-12-24 14:28:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-24 14:28:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-12-24 14:28:19,694 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2018-12-24 14:28:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:19,694 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-12-24 14:28:19,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-24 14:28:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-12-24 14:28:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-12-24 14:28:19,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:19,696 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2018-12-24 14:28:19,696 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:28:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2018-12-24 14:28:19,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:19,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:19,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:19,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:19,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:23,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:23,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:23,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:23,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:23,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:23,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:28:23,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:28:23,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:28:23,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-24 14:28:23,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:23,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:23,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:28:23,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:23,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:27,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:32,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:32,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2018-12-24 14:28:32,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:32,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-24 14:28:32,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-24 14:28:32,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2018-12-24 14:28:32,263 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2018-12-24 14:28:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:38,479 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-12-24 14:28:38,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-24 14:28:38,479 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2018-12-24 14:28:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:38,481 INFO L225 Difference]: With dead ends: 400 [2018-12-24 14:28:38,481 INFO L226 Difference]: Without dead ends: 399 [2018-12-24 14:28:38,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2018-12-24 14:28:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-24 14:28:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2018-12-24 14:28:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-24 14:28:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2018-12-24 14:28:38,603 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2018-12-24 14:28:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:38,603 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2018-12-24 14:28:38,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-24 14:28:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2018-12-24 14:28:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-12-24 14:28:38,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:38,605 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2018-12-24 14:28:38,605 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:28:38,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:38,605 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2018-12-24 14:28:38,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:38,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:38,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:38,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:41,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:41,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:41,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:41,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:41,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:41,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:28:41,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:28:41,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:28:41,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:28:41,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:41,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:41,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:28:41,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:41,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:46,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:50,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:50,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2018-12-24 14:28:50,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:50,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-24 14:28:50,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-24 14:28:50,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 14:28:50,736 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2018-12-24 14:28:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:56,729 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-12-24 14:28:56,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 14:28:56,730 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2018-12-24 14:28:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:56,731 INFO L225 Difference]: With dead ends: 405 [2018-12-24 14:28:56,731 INFO L226 Difference]: Without dead ends: 404 [2018-12-24 14:28:56,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2018-12-24 14:28:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-12-24 14:28:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2018-12-24 14:28:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-12-24 14:28:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-12-24 14:28:56,871 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2018-12-24 14:28:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:56,872 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-12-24 14:28:56,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-24 14:28:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-12-24 14:28:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-12-24 14:28:56,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:56,873 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2018-12-24 14:28:56,874 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:28:56,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:56,874 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2018-12-24 14:28:56,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:56,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:56,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:56,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:56,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:00,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:00,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:00,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:00,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:00,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:00,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:29:00,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:00,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:00,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:00,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:29:00,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:00,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:00,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:04,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:09,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:09,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2018-12-24 14:29:09,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:09,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-24 14:29:09,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-24 14:29:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2018-12-24 14:29:09,675 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2018-12-24 14:29:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:15,885 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2018-12-24 14:29:15,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-24 14:29:15,885 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2018-12-24 14:29:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:15,887 INFO L225 Difference]: With dead ends: 410 [2018-12-24 14:29:15,887 INFO L226 Difference]: Without dead ends: 409 [2018-12-24 14:29:15,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2018-12-24 14:29:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-12-24 14:29:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2018-12-24 14:29:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-12-24 14:29:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2018-12-24 14:29:16,030 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2018-12-24 14:29:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:16,030 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2018-12-24 14:29:16,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-24 14:29:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2018-12-24 14:29:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-12-24 14:29:16,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:16,032 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2018-12-24 14:29:16,032 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:29:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2018-12-24 14:29:16,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:16,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:16,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:19,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:19,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:19,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:19,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:29:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:19,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:20,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-24 14:29:20,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:20,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:20,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:29:20,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:20,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:20,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:24,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:29,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:29,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2018-12-24 14:29:29,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:29,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-24 14:29:29,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-24 14:29:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:29:29,360 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2018-12-24 14:29:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:35,853 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-12-24 14:29:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 14:29:35,853 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2018-12-24 14:29:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:35,855 INFO L225 Difference]: With dead ends: 415 [2018-12-24 14:29:35,855 INFO L226 Difference]: Without dead ends: 414 [2018-12-24 14:29:35,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2018-12-24 14:29:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-12-24 14:29:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2018-12-24 14:29:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-24 14:29:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-12-24 14:29:35,989 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2018-12-24 14:29:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:35,989 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-12-24 14:29:35,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-24 14:29:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-12-24 14:29:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-12-24 14:29:35,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:35,991 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2018-12-24 14:29:35,991 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-24 14:29:35,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:35,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2018-12-24 14:29:35,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:35,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:35,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:35,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:35,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat